Showing papers on "Paging published in 2004"

Adaptive incremental checkpointing for massively parallel systems

Abstract: Given the scale of massively parallel systems, occurrence of faults is no longer an exception but a regular event. Periodic checkpointing is becoming increasingly important in these systems. However, huge memory footprints of parallel applications place severe limitations on scalability of normal checkpointing techniques. Incremental checkpointing is a well researched technique that addresses scalability concerns, but most of the implementations require paging support from hardware and the underlying operating system, which may not be always available. In this paper, we propose a software based adaptive incremental checkpoint technique which uses a secure hash function to uniquely identify changed blocks in memory. Our algorithm is the first self-optimizing algorithm that dynamically computes the optimal block boundaries, based on the history of changed blocks. This provides better opportunities for minimizing checkpoint file size. Since the hash is computed in software, we do not need any system support for this. We have implemented and tested this mechanism on the BlueGene/L system. Our results on several well-known benchmarks are encouraging, both in terms of reduction in average checkpoint file size and adaptivity towards application's memory access patterns.

Software management systems and methods for automotive computing devices

Abstract: Methods and systems for operating automotive computing devices are described. In one embodiment, a small amount of static RAM (SRAM) is incorporated into an automotive computing device. The SRAM is battery-backed to provide a non-volatile memory space in which critical data, e.g. the object store, can be maintained in the event of a power loss. Circuitry is provided to ensure that the SRAM receives back up power from the battery at appropriate times. Software manages the SRAM and the other storage assembly components and makes use of virtual paging or virtual addressing techniques to keep track of where various pages, including object store pages, are stored in the system. The software knows where all of the object store pages are located so that in the event of a power loss, the page locations are known and hence the pages can be used when power is restored. The SRAM is advantageously used to maintain so-called “dirty pages” or pages that have been written to so that these pages are not lost in the event of a power interruption. Additionally, the software can also provide an orderly means by which pages in the SRAM can be written out to flash memory thereby avoiding unnecessary flash write operations which, in turn, increases the lifetime of the flash memory.

Automotive computing devices with emergency power shut down capabilities

Abstract: Methods and systems for operating automotive computing devices are described. In one embodiment, a small amount of static RAM (SRAM) is incorporated into an automotive computing device. The SRAM is battery-backed to provide a non-volatile memory space in which critical data can be maintained in the event of a power loss. Circuitry is provided to ensure that the SRAM receives back up power from the battery at the appropriate time. Software manages the SRAM and the other storage assembly components and makes use of virtual paging or virtual addressing techniques to keep track of where various pages, including object store pages, are stored in the system. The software knows exactly where all of the object store pages are stored so that in the event of a power loss, the page locations are known and hence the pages can be used when power is restored.

Method for transmitting MBMS paging information in a mobile communication system

Abstract: A mobile communication system includes a radio network controller (RNC), at least one Node B, and at least one user equipment (UE) able to receive a broadcast service from the Node B. The RNC generates a paging control frame based on the paging information including paging indicator bit mapping information indicating paging for each broadcast service; transmits the paging control frame to the Node B; and receives a response message to the paging control frame from the Node B. The Node B receives paging information including paging indicator bit mapping information indicating paging for each broadcast service, from the RNC through a paging control frame; transmits a response message including the paging information to the RNC in response to the paging control frame; and transmits the paging indicator to the UE based on the paging information.

Compiler-assisted demand paging for embedded systems with flash memory

Abstract: In this paper, we propose a novel, application specific demand paging mechanism for low-end embedded systems with flash memory as secondary storage. These systems are not equipped with virtual memory. A small memory space called an execution buffer is allocated to page an application. An application-specific page manager manages the buffer. The manager is generated by a compiler post-pass and combined with the application image. Our compiler post-pass analyzes the ELF executable image of an application and transforms function call/return instructions into calls to the page manager. As a result, each function of the code can be loaded into memory on demand at run time. To minimize the overhead of demand paging, code clustering algorithms are also presented. We evaluate our techniques with five embedded applications. We show that our approach can reduce the code memory size by 33% on average with reasonable performance degradation (8-20%) and energy consumption (10% more on average) for low-end embedded systems.

Tone generating electronic device with paging module for verification of energy curtailment

Abstract: A curtailment module is disclosed for enabling an energy provider to send a request to curtail energy use to a user. The curtailment module includes an interface for electronic communications with a temperature control device. A paging module is used to receive the request from the energy provider through a paging network. The curtailment module also includes a processor in electronic communication with the paging module for receiving the request from the paging module. Memory is also included and is in electronic communication with the processor for storing a curtailment message and history data. The curtailment module also includes a sound component in electronic communication with the processor for outputting an audio verification. A code generator is stored in the memory and executable by the processor to generate a verification code using the curtailment message and the history data as inputs. The code generator also generates the audio verification based on the verification code to verify whether the request was followed.

Location area planning and cell-to-switch assignment in cellular networks

Abstract: Location area (LA) planning plays an important role in cellular networks because of the tradeoff caused by paging and registration signalling. The upper boundary for the size of an LA is the service area of a mobile services switching center (MSC). In that extreme case, the cost of paging is at its maximum but no registration is needed. On the other hand, if each cell is an LA, the paging cost is minimal but the cost of registration is the largest. Between these extremes lie one or more partitions of the MSC service area that minimize the total cost of paging and registration. In this paper, we seek to determine the location areas in an optimum fashion. Cell to switch assignments are also determined to achieve the minimization of the network cost. For that purpose, we use the available network information to formulate a realistic optimization problem, and propose an algorithm based on simulated annealing (SA) for its solution. Then, we investigate the quality of the SA-based technique by comparing it to greedy search, random generation methods, and a heuristic algorithm.

Restricting memory access to protect data when sharing a common address space

Abstract: A first software entity occupies a portion of a linear address space of a second software entity and prevents the second software entity from accessing the memory of the first software entity. For example, in one embodiment of the invention, the first software entity is a virtual machine monitor (VMM), which supports a virtual machine (VM), the second software entity. The VMM sometimes directly executes guest instructions from the VM and, at other times, the VMM executes binary translated instructions derived from guest instructions. When executing binary translated instructions, the VMM uses memory segmentation to protect its memory. When directly executing guest instructions, the VMM may use either memory segmentation or a memory paging mechanism to protect its memory. When the memory paging mechanism is active during direct execution, the protection from the memory segmentation mechanism may be selectively deactivated to improve the efficiency of the virtual computer system.

Optimal sequential paging in cellular wireless networks

Abstract: In a high-capacity cellular network with limited spectral resources, it is desirable to minimize the radio bandwidth costs associated with paging when locating mobile users. Sequential paging, in which cells in the coverage area are partitioned into groups and paged in a non-increasing order of user location probabilities, permits a reduction in the average radio costs of paging at the expense of greater delay in locating the users. We present a polynomial time algorithm for minimizing paging cost under the average delay constraint, a problem that has previously been considered intractable. We show the conditions under which cluster paging, a simple heuristic technique proposed for use with dynamic location update schemes, is optimal. We also present analytical results on the average delay and paging cost obtained with sequential paging, including tight bounds.

Navigation system using wireless paging network and method of providing traffic information therefor

Abstract: A navigation system using a wireless paging network and a traffic information providing method in the navigation system. The navigation system has a traffic information management server, a paging server and a navigation terminal. The paging server broadcasts real-time information including traffic information and living information (e.g., breaking news) and the navigation terminal provides traffic information with the real-time information to a user. Therefore, no extra communication charges are imposed and real-time traffic information and other living information (e.g., breaking news, incident information, etc.) are provided together with route guidance information.

Apparatus and method for controlling sleep mode in wireless access communication system

Abstract: An apparatus and method for controlling a sleep mode in a wireless access communication system. The apparatus determines a predetermined number of groups for grouping at least one subscriber terminal according to type information of a paging interval equal to the sum of the sleep interval and the listening interval, and registers the subscriber terminal in one group from among the groups on the basis of the paging interval type of the subscriber terminal. Upon receipt of the group information, the apparatus controls a base station to pre-recognize a terminal woken up at a predetermined time from among a plurality of terminals entering the sleep mode, resulting in reduction of the number of unnecessary paging message transmissions and improved efficiency of the wireless access communication system.

Paging system and method for providing multicast multimedia broadcast/multicast service

Abstract: A paging system and method for use in a multimedia/broadcast multicast service (MBMS). The paging system checks a paging indicator channel of a UE (User Equipment), and determines whether there is a paging signal associated with a broadcast service. If the paging signal associated with the broadcast service is detected, the paging system recognizes the channel information indicative of the paging fact, checks paging information included in an ID for differentiating between the broadcast service and other broadcast services and a paging response indicator adapted to determine a transmission channel scheme of the broadcast service, establishes a radio link, and receives control information using the radio link. The base station controller adapted to manage a cell including the UE transmits MBMS transmission scheme information to the UE in advance using the paging information, resulting in maximum use efficiency of RRC (Radio Resource Controller) resources.

Paging methods and apparatus

Abstract: Improved paging methods and apparatus are described. Paging requirements for a page' are determined from paging information. Paging requirements may include, e.g., transmission delay constraints, paging resource requirements, whether or not a page is to be acknowledged, quality of service information, etc. A page is generated and transmitted by the node determining the paging requirements. In other embodiments, paging requirement information is communicated in a message to a node which is responsible for paging transmission resource allocation and/or actual transmission of a page. The methods and apparatus of the present invention allow pages to be treated on a differential basis according to a page's particular requirements. Different quality of service levels can be maintained for pages with pages having a higher QoS being given resource allocation priority and/or scheduling priority over pages corresponding to lower levels of page QoS.

Modeling Locality: A Probabilistic Analysis of LRU and FWF

Abstract: In this paper we explore the effects of locality on the performance of paging algorithms. Traditional competitive analysis fails to explain important properties of paging assessed by practical experience. In particular, the competitive ratios of paging algorithms that are known to be efficient in practice (e.g. LRU) are as poor as those of naive heuristics (e.g. FWF). It has been recognized that the main reason for these discrepancies lies in an unsatisfactory modelling of locality of reference exhibited by real request sequences.

Scalable paging of platform configuration registers

Abstract: A method, computer program, and system for paging platform configuration registers in and out of a trusted platform module. In a trusted computing platform, an unlimited number of platform configuration registers can be obtained through paging. The trust platform module encrypts and decrypts platform configuration registers for storage outside the trusted platform module.

Electronic access control, tracking and paging system

Abstract: A universal wireless access control and paging system including universal wireless identity devices, fixed RF nodes, location beacons, and other devices which can store access privileges, store and provide personal identification information, record personal activity and presence, and deliver text or audio messages. The key component in the system is the universal identification card which contains wireless communication circuitry, data display circuitry, and a memory circuit for the storage of personal and location information. Further the universal identification card contains a microprocessor coupled to the memory circuitry, the display circuitry and the data communications circuitry. The device also can contain an input means to allow the user to control the card function during operation. This includes the ability to select what personal information can be accessed over the wireless communication means.

Method and network system for establishing peer to peer communication between two users equipments camping in different cells

Abstract: A method to be performed in a network system is provided, for establishing P2P communication between two UEs, comprising steps of: receiving a call request from the calling UE of the two Ues (s102); judging whether the two UEs are camping in the same cell (s105); sending a paging message to the called UE if the two UEs are camping in different cells (s106); receiving a paging response from the called UE (s108); determining whether the two UEs meet the requirement for P2P communication according to the call request and the paging response (s109). In an embodiment, system information is sent to a UE so that said UE can switch to the same cell (s203), and radio resource information for peer to peer link probing is sent to the two Ues after they are accessing the same cell (s207). The cells can be managed by different network systems, and the cell request, paging response and a connection message from another network can include P2P communication capability of the respective calling or called UE.

Mobile communications network system, mobile terminal, and paging method

Abstract: A mobile communication network system is provided in which when a radio system is selected from plural types of radio systems as a radio system for use in paging, the optimum radio system for the mobile terminal to be paged can be selected. When it is selected, traffic does not concentrate on a specific radio system, or no excess delay occurs when the mobile terminal starts communications. When the mobile communications network system performs paging as a paging notification to a mobile terminal through any one of various radio systems under a communications environment in which radio waves of various radio systems having different communication systems are used, a radio system is selected from a plurality of radio systems depending on the application used in the communications of the paging requested mobile terminal and a paging operation is performed through the selected radio system when a paging request is issued.

Exploiting information theory for adaptive mobility and resource management in future cellular networks

Abstract: We utilize tools from information theory to develop adaptive algorithms for two key problems in cellular networks: location tracking and resource management. The use of information theory is motivated by the fundamental observation that overheads in many aspects of mobile computing can be traced to the randomness or uncertainty in an individual user's movement behavior. We present a model-independent information-theoretic approach for estimating and managing this uncertainty, and relate it to the entropy or information content of the user's movement process. Information-theoretic mobility management algorithms are very simple, yet reduce overhead by /spl sim/80 percent in simulated scenarios by optimally adapting to each individual's movement. These algorithms also allow for flexible tradeoff between location update and paging costs. Simulation results demonstrate how an information-theory-motivated resource provisioning strategy can meet QoS bounds with very small wastage of resources, thus dramatically reducing the overall blocking rate.

Paging method for an MBMS service in a mobile communication system

Abstract: A paging method for informing a UE of the existence or absence of control information in transmission of the control information according to the support of an MBMS in a mobile communication system. In the method, paging according to a voice and packet service and paging according to an MBMS are differentiated from each other. Accordingly, a first paging indication channel for identifying the paging according to the voice and packet service and a second paging indication channel for identifying the paging according to the MBMS are differentiated from each other and used.

Parallel network RAM: effectively utilizing global cluster memory for large data-intensive parallel programs

Abstract: Large scientific parallel applications demand large amounts of memory space. Current parallel computing platforms schedule jobs without fully knowing their memory requirements. This leads to uneven memory allocation in which some nodes are overloaded. This, in turn, leads to disk paging, which is extremely expensive in the context of scientific parallel computing. To solve this problem, we propose a new peer-to-peer solution called parallel network RAM. This approach avoids the use of disk and better utilizes available RAM resources. This approach will allow larger problems to be solved while reducing the computational, communication and synchronization overhead typically involved in parallel applications.

Paging for broadcast and multicast services

Abstract: Paging is provided in a communication network, and implemented in a network infrastructure device ( 101 ). Multiple flows including a particular flow are assigned to one or more flow groups. Flow groups, including the foregoing flows, are assigned to at least one paging category, wherein the flow groups have a first paging slot. The paging category is transmitted ( 107 ) to one or more communication units ( 103 ), wherein the communication unit(s) ( 103 ) has requested the particular flow.

Concurrent search of mobile users in cellular networks

Abstract: In this paper, we propose to concurrently search for a number of mobile users in a wireless cellular network based on the probabilistic information about the locations of mobile users. The concurrent search approach guarantees that all k mobile users will be located within k time slots. It is shown that even in the worst case when mobile users appear equally in all the cells of the network, the concurrent search approach is able to reduce the average paging cost by 25%. More importantly, this is achieved without an increase in the worst case paging delay or in the worst case paging cost. Depending on the total number of mobile users to be located, total number of cells in the network, and the probabilistic information about the locations of mobile users, the reduction of the average paging cost due to the usage of the concurrent search approach ranges from 25% to 88%. The case in which perfect probabilistic information is unavailable is also studied.

Fast call setup system and method in a mobile communications system

Abstract: A fast call setup system and method for a mobile communications device is provided. A mobile terminal monitors a paging channel on a first predetermined cycle, the paging channel comprising a plurality of slots for monitoring. After a traffic channel is disconnected upon receiving a release order (S1), the network provides reduced slot cycle parameters to the mobile terminal (S2). The mobile terminal uses these parameters to monitor the paging channel using a reduced slot cycle. Upon the expiration of an operational timer or through an intervention of either the network or the mobile terminal, the reduced slot cycle is terminated and a normal slot cycle is reinstated.

Multi media broadcasting and method of organizing broadcasting business call finding

Abstract: The method integrates paging course with radio resource setting-up course to reduce possibly uplink response. The existing PCH IubFP frame structure is extended and to add multimedia and multicast service indication bit in PCH IubFP frame which includes paging indication and paging message loaded with service information of multimedia and multicast. Unused 12 pieces of bits in PICH frame structure of paging indication channel is added for service identification or paging indication of multimedia and multicast. The paging indication information and paging message are transmitted by radio network controller RNC to Node B in order to transmit them at air infercase.

Method and system for improving performance and scalability of applications that utilize a flow-based-programming methodology

Abstract: A method, system, apparatus, and computer program product is presented for improving the execution performance of flow-based-program (FBP) programs and improving the execution performance further on systems with additional processing resources (scalability). A FBP supervisor is inserted as the initial executable program, which program will interrogate the features of the operating system upon which it is executing including but not limited to number of processors, memory capacity, auxiliary memory capacity (paging dataset size), and networking capabilities. The supervisor will create an optimum number of processing environments (e.g. threads in a Windows environment) to service the user FBP application. The supervisor will further expose other services to the FBP application which improve the concurrent execution of the work granules (processes) within that FBP application. The supervisor further improves the generation and logging of messages through structured message libraries which are extended to the application programmer. The overall supervisor design maximizes concurrency, eliminates unnecessary work, and offers services so a process should suspend rather than block.

Paging control apparatus, mobile node, paging control system, and paging control method

Abstract: A paging agent 30 according to the present invention receives a paging request packet from a mobile node, and then determines a paging area, in response to the packet. The paging agent 30 notifies the mobile node of the determined paging area and controls this paging area. When the paging agent 30 receives a data packet directed to the mobile node in a paging control mode, it holds the packet in a buffer 371 and starts forwarding the data packet thus held, as triggered by reception of a paging notification confirmation packet from the mobile node.

An information-theoretic framework for optimal location tracking in multisystem 4G wireless networks

Abstract: An information-theoretic framework is developed for optimal location management in multisystem, fourth generation (4G) wireless networks. The framework envisions that each individual subsystem operates fairly independently, and does not require public knowledge of individual subnetwork topologies. To capture the variation in paging and location update costs in this heterogeneous environment, the location management problem is formulated in terms of a new concept of weighted entropy. The update process is based on the Lempel-Ziv compression algorithms, which are applied to a vector-valued sequence consisting of both the mobile's movement pattern and its session activity state. Three different tracking strategies which differ in their degrees of centralized control and provide trade off between the location update and paging costs, are proposed and evaluated. While both the proposed centralized and distributed location management strategies are endowed with optimal update capability, the proposed selective location management heuristic also offers a practical trade off between update and paging costs. Simulation experiments demonstrate that our proposed schemes can result in more than 50% savings in both update and paging costs, in comparison with the basic movement-based, multisystem location management strategy. These update strategies can be realized with only modest amounts of memory (12-15 Kbytes) on the mobile.

A generic, ‘in-house’, alphanumeric paging system for prospective activity impairments after traumatic brain injury

Abstract: Objective: For settings having suitable infrastructure, generic, ‘in-house’ alphanumeric paging systems can be constructed that are fully under clinician control. Development of such a system for therapeutic application is described and a single-case study presented that assessed whether the system could improve repetitive, prospective use of a daily planner.Design: ABA′ single case.Methods: The participant was male, in his mid-30s, having cognitive impairments subsequent to recent TBI superimposed on remote neurological changes. The pager reminded him to record therapeutic information in a daily planner, for discussion with a family member each evening.Results: During intervention (B) trials, reliable memory log usage was noted. By trial five of return-to-baseline (A′) trials, there was decreased memory log use.Conclusions: Alphanumeric paging facilitated reliable use of a memory log compensation technique. The ‘in-house’ paging system proved particularly suitable for intervention development. Limits of ...