• Title/Summary/Keyword: paging

Search Result 187, Processing Time 0.027 seconds

A Program Code Compression Method with Very Fast Decoding for Mobile Devices (휴대장치를 위한 고속복원의 프로그램 코드 압축기법)

  • Kim, Yong-Kwan;Wee, Young-Cheul
    • Journal of KIISE:Software and Applications
    • /
    • v.37 no.11
    • /
    • pp.851-858
    • /
    • 2010
  • Most mobile devices use a NAND flash memory as their secondary memory. A compressed code of the firmware is stored in the NAND flash memory of mobile devices in order to reduce the size and the loading time of the firmware from the NAND flash memory to a main memory. In order to use a demand paging properly, a compressed code should be decompressed very quickly. The thesis introduces a new dictionary based compression algorithm for the fast decompression. The introduced compression algorithm uses a different method with the current LZ method by storing the "exclusive or" value of the two instructions when the instruction for compression is not equal to the referenced instruction. Therefore, the thesis introduces a new compression format that minimizes the bit operation in order to improve the speed of decompression. The experimental results show that the decoding time is reduced up to 5 times and the compression ratio is improved up to 4% compared to the zlib. Moreover, the proposed compression method with the fast decoding time leads to 10-20% speed up of booting time compared to the booting time of the uncompressed method.

Effective resource selection and mobility management scheme in mobile grid computing (모바일 그리드 컴퓨팅에서 효율적인 자원 확보와 이동성 관리 기법)

  • Lee, Dae-Won
    • The Journal of Korean Association of Computer Education
    • /
    • v.13 no.1
    • /
    • pp.53-64
    • /
    • 2010
  • In this paper, we tried to enable a mobile device as a resource to access to mobile grid networks. By advanced Internet techniques, the use of mobile devices has been rapidly increased. Some researches in mobile grid computing tried to combine grid computing with mobile devices. However, according to intrinsic properties of mobile environments, mobile devices have many considerations, such as mobility management, disconnected operation, device heterogeneity, service discovery, resource sharing, security, and so on. To solve these problems, there are two trends for mobile grid computing: a proxy-based mobile grid architecture and an agent-based mobile grid architecture. We focus on a proxy-based mobile grid architecture with IP-paging, which can easily manage idle mobile devices and grid resource status information. Also, we use SIP(Session Initiation Protocol)to support mobility management, mobile grid services. We manage variation of mobile device state and power by paging cache. Finally, using the candidate set and the reservation set of resources, we perform task migration. The performance evaluation by simulation, shows improvement of efficiency and stability during execution.

  • PDF

Dynamic Location Area Management Scheme Based on Mobile Subscribers in Cellular Mobile System (셀룰라 이동 통신 시스템에서 가입자 중심의 동적 위치 영역 할당 기법)

  • Kim, Sang-O;Lee, Jae-Yong;Ryu, Dae-Hui
    • The Transactions of the Korea Information Processing Society
    • /
    • v.3 no.5
    • /
    • pp.1179-1186
    • /
    • 1996
  • A previous location area scheme was proposed for cellular network, in which the size of location area of a user is dynamically determined by is current mobility and call arrival rate as the burden of system reaches the minimum. This scheme, however, doesn't consider other individual's movement pattern respectively because of allocating location area with a system's fixed pattern. When mobile subscribers move fast, this scheme allocates especially so large location area to reduce the number of location registration that it makes much paging cost. In this paper, we suggest new dynamic location area management which allocates location area according to each subscriber's mobility regarding its current location as center point. This new scheme allocates fast subscriber larger location area, which resulted in reducing the number of location registration. And small area paging reduces paging cost.

  • PDF

The SAFE Management System Model Based on Context Automatic Awareness

  • Han, Kook-Hee;Liu, Yiwen;Kwon, Young-Jik;Kang, Byeong-Do
    • Proceedings of the Korea Society for Industrial Systems Conference
    • /
    • 2007.02a
    • /
    • pp.87-96
    • /
    • 2007
  • Ubiquitous is a Latin-derived word meaning "to exist at any time and place" like water or air. In computing, the word "ubiquitous" indicates an environment in which users have access to networks without any limitation regarding computer networks or places. Important issues in building Ubiquitous Korea (U-Korea) are the social problems appearing with a rapid increase in the old age population. Nowadays, with the rise of the nuclear family, the increase in the number of elderly people living alone, and the change in the status of women, both wives and husbands are employed outside the home, and the relatives who would be responsible for supporting the elderly sometimes are on long or short business trips, and it happens that old people can't be looked after. Therefore the government developed a wireless paging system for the sick, disabled, old and weak so that when an emergency happens, by just simply dialing 119, an emergency aid center could take prompt action. However, the present wireless paging systems composing the under-layer of the emergency aid information system have some problems, such as, a lack of reliability, problems among terminals, mobile transmitters and receiving terminals, the users' refusal to admit the need for the system and poor operational skills, administrators' perfunctory management and checks, etc. On account of these problems, the system efficiency has degraded and therefore a system upgrade is necessary. In this paper, we attempt to evaluate the newly implemented SAFE119 system, a new wireless paging system seeking to correct the problems of the current system.

  • PDF

A Location Management Scheme using Direction Characteristics of Mobile Terminals in Mobile Communication Systems (이동 통신 시스템에서 이동 단말의 방향성을 고려한 위치 관리 기법)

  • 김태수;송의성;한연희;황종선;길준민
    • Journal of KIISE:Information Networking
    • /
    • v.30 no.1
    • /
    • pp.48-64
    • /
    • 2003
  • Recently, as the number of mobile users keeps increasing explosively, the location management to track the mobile users in mobile communication systems is being more important. However, the previous location management schemes have been used static location information without the consideration of a user's moving direction. This results in unnecessary pagings, consequently it increases location management costs. In this paper, we propose a mew location management costs. In this paper, we propose a new location the cell occurred a location update. It also determines whether the location update will be executed or not, by the offset operation of direction vector. Thus, a user's paging areas are generated dynamically along the user's moving direction. The wide of paging areas is also determined dynamically. Besides, we present analytic model for our scheme. To compare with our scheme, the distance-based scheme is analyzed. The numerical result shows that our scheme is more efficient than the distance-based scheme in the most cases except a low CMR. Particularly if a user move into a specific direction, our scheme has the lower location management cost than that of the distance-based scheme.

A Study on Demand Paging For NAND Flash Memory Storages (NAND 플래시 메모리 저장장치를 위한 요구 페이징 기법 연구)

  • Yoo, Yoon-Suk;Ryu, Yeon-Seung
    • Journal of Korea Multimedia Society
    • /
    • v.10 no.5
    • /
    • pp.583-593
    • /
    • 2007
  • We study the page replacement algorithms for demand paging, called CFLRU/C, CFLRU/E and DL-CFLRU/E, that reduce the number of erase operations and improve the wear-leveling degree of flash memory. Under the CFLRU/C and CFLRU/E algorithms, the victim page is the least recently used dean page within the pre-specified window. However, when there is not any dean page within the window, the CFLRU/C evicts the dirty page with the lowest frequency while the CFLRU/E evicts the dirty page with the highest number of erase operations. The DL-CFLRU/E algorithm maintains two page lists called the dean page list and the dirty page list, and first finds the page within the dean page list when it selects a victim. However, when it can not find any dean page within the dean page list, it evicts the dirty page with the highest number of erase operations within the window of the dirty page list. In this thesis, we show through simulation that the proposed schemes reduce the number of erase operations and improve the wear-leveling than the existing schemes like LRU.

  • PDF

A Novel Idle Mode Operation in IEEE 802.11 WLANs: Prototype Implementation and Performance Evaluation (IEEE 802.11 WLAN을 위한 Idle Mode Operation: Prototype 구현 및 성능 측정)

  • Jin, Sung-Geun;Han, Kwang-Hun;Choi, Sung-Hyun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.2A
    • /
    • pp.152-161
    • /
    • 2007
  • IEEE 802.11 Wireless Local Area Network (WLAN) became a prevailing technology for the broadband wireless Internet access, and new applications such as Voice over WLAM (VoWLAN) are fast emerging today. For the battery-powered VoWLAN devices, the standby time extension is a key concern for the market acceptance while today's 802.11 is not optimized for such an operation. In this paper, we propose a novel Idle Mode operation, which comprises paging, idle handoff, and delayed handoff. Under the idle mode operation, a Mobile Host (MH) does not need to perform a handoff within a predefined Paging Area (PA). Only when the MH enters a new PA, an idle handoff is performed with a minimum level of signaling. Due to the absence of such an idle mode operation, both IP paging and Power Saving Mode (PSM) have been considered the alternatives so far even though they are not efficient approaches. We implement our proposed scheme in order to prove the feasibility. The implemented prototype demonstrates that the proposed scheme outperforms the legacy alternatives with respect to energy consumption, thus extending the standby time.

Predictive Location Management Strategy Using Two Directional Consecutive LAs in a Cellular Network (이동 통신망에서 방향성을 지닌 2개의 연속적 위치영역을 이용한 예측 위치 관리 전략)

  • Chang, I.K.;Hong, J.S.;Kim, J.P.;Lie, C.H.
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.33 no.3
    • /
    • pp.43-58
    • /
    • 2008
  • In this paper, we have presented a dynamic, predictive location update scheme that takes into account each user's mobility patterns. A user's past movement history is used to create two-dimensional transition probability matrix which makes use of two directional consecutive location areas. A mobile terminal utilizes the transition probability to develop a predictive path which consists of several predictive nodes and then the location update is saved as long as a mobile user follows the predictive path. Using continuous-time Markov chain, cost functions of location update and paging are derived and it is shown that the number of predictive nodes can be determined optimally. To evaluate the proposed scheme, simulations are designed and the numerical analysis is carried out. The numerical analysis features user's mobility patterns and regularity, call arrival rates, and cost ratio of location update to paging. Results show that the proposed scheme gives lower total location management cost, compared to the other location update schemes.

Development of Vibration Motor Using Coreless Permanent Magnet DC Motor (무철심 영구자석 직류 모터를 이용한 진동자 개발)

  • Hwang, Sang-Moon;Chung, Shi-Uk
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.16 no.7
    • /
    • pp.15-23
    • /
    • 1999
  • With a remarkable expansion of communication industry, a pager or a cellular phone becomes a necessary communication device in modern society. However, a paging signal by a buzzer is often acted as an unpleasant noise in some places, thus necessitating a paging signal by a vibration motor. In this paper, a simpler type of a vibration motor, a coreless permanent magnet(PM) DC motor, is considered to substitute for the conventional vibration motors. Using an analytical method, electromagnetic field and operating torque were calculated for the given inner and outer PM type motors, and the results were confirmed by FEM analysis. As design parameters, number of PM poles, PM radial thickness, coil arc angle and number of winding stacks were chosen for sensitivity analysis. It shows that coil arc angle is the most important design parameter to increase the motor performance, without giving an adverse effect on motor weight, size and manufacturing cost. Based on the analysis of the outer PM type motor, an outer square PM type motor is proposed as the final design. Compared to the outer PM type, outer square type provides more flexibility to attach to the small size cellular phones. With the optimum design of square outer PM DC motor, it can successfully substitute the conventional types with less expensive manufacturing cost. better performance and smaller necessary space.

  • PDF