Showing papers on "Paging published in 1980"

Control signal transmission system for use in a mobile radio communication system

Abstract: A control signal transmission system for mobile radio communications uses a plurality of control channels extending between a plurality of mobile units and at least one control center. The control center transmits system information signals and paging signals during individually associated time frames. The mobile units transmit response signals corresponding to the paging signals by transmitting to the control centers through the control channels. At least one frame of the system provides for a transmission of responsive information signals, following each frame including the paging signals. Each of these response signals includes an identification number of the replying mobile unit.

Multiprocessor Scheduling with Memory Allocation—A Deterministic Approach

Abstract: This paper proposes a deterministic approach to the preemptive scheduling of independent tasks, which takes into account primary memory allocation in multiprocessor systems with virtual memory and a common primary memory. Each central processing unit (CPU) is assumed to have dedicated paging devices and thus paging- device competition does not exist in the system. The system workload is based on an analytic approximation to the lifetime curve of a task. Exact and approximate algorithms are presented which minimize or tend to minimize the length of schedules on an arbitrary number of identical processors. In the general case, the exact algorithm is based on nonlinear programming; however, the approximate algorithm requires the solution of several nonlinear equations with one unknown. For certain cases, analytical results have also been obtained.

Paging receiver with display

Abstract: A paging receiver demodulates a carrier wave modulated with a paging signal code and a plurality of information key codes, respectively. The demodulated information key codes are decoded by a receiver when its own paging signal code is detected. The receiver contains a plurality of words corresponding to said information key codes, respectively. These stored words are read out when they correspond to the decoded information. The read-out codes are then displayed.

Paging receiver having a serial code plug

Abstract: A paging receiver selectively operable in either a six tone battery saving mode or in a five tone non-battery saving mode. The receiver features a serial code plug for programming a programmable tone detector to be responsive to a specific paging receiver address comprising a predetermined combination of preamble and paging signals. The use of a serial code plug in place of the parallel code plug previously known and utilized in the industry allows a reduced complexity of the paging receiver and a corresponding size, weight and cost savings.

Picture paging for efficient image processing

Abstract: Picture paging is introduced as a technique for minimizing storage and transmission costs in the handling of large-scale image data. Page design, and possible page formats, are considered, concentrating on normally-oriented rectangles. A steepest-gradient descent algorithm for page set determination is presented, with results for a PDP-11/40 UNIX implementation. Savings of up to 35% can be realized for an arbitrary cost function applied to test figures.

Multiprogramming and memory contention

Abstract: We study memory contention during multiprogramming when programs are free to compete for page frames. A random walk between the possible partitions of memory over the set of active programs is used to model memory contention and calculate throughput. Our model of contention takes into account program characteristics by using miss ratio curves, and also considers memory size and page fetch latency. With the aid of numerous trace-driven simulations, we are able to verify our model, finding good agreement both in the observed distribution of memory among competing programs and in CPU utilization. We find that for high ratios of secondary to primary memory access time and under conditions of high memory contention, small programs with compact working sets are able to run with far less than expected interference from larger, more diffuse programs. In the case of multiprogramming the same program several times, we find that observed partition distributions are not necessarily even and that higher than expected levels of CPU use are observed. Lower ratios of access time are found to yield different results; programs compete on a more even basis and partition memory relatively more evenly than with higher ratios.

System for optimizing performance of paging store

Abstract: Operations to prepare a secondary paging store for a data transfer relative to a central processor main store are overlapped in time with chaining operations of an input-output channel relative to the main store for preparing a command defining the transfer operation. In a preferred embodiment the paging store is organized for sequential access to page records and the operations to prepare the paging store include a calculation of a "roll mode" displacement factor which defines a randomly chosen displacement position in a designated page area for beginning the transfer with minimized latency. This factor is calculated as a function of channel operational characteristics as well as the bit timing rate of the paging store. The displacement calculation is also adapted for a paging store having different timing rates for transferring data and regenerating stored data. The displacement factor is stored in a buffer register and conditionally transferred to the channel when the channel next selects the paging store in association with the chained command. The transfer of the displacement factor is conditioned on the timing of the channel selection relative to the accessibility timing of the displacement position. If the selection is late the response to the selection is delayed until a new factor is calculated. Such re-calculations will be relatively infrequent in a system which is not overloaded with channel contention activity.

Selective paging and intercommunication system

Abstract: A battery powered paging and intercommunication system for application in a mine or other environment where it is necessary to conserve battery power comprises a plurality of transceivers electrically coupled to a common pair of signal lines. Each of the transceivers includes a push-to-talk switch for applying voice signals onto the lines as well as a push-to-page switch that amplifies received voice signals for reproduction through a loudspeaker. Each transceiver also includes dual tone multifrequency (DTMF) encoder and decoder circuitry for addressing a preselected transceiver on the lines for paging. A timer circuit within the transceiver limits the period of time the transceiver limits the period of time the transceiver is in the paging mode to reduce battery consumption. As a system check during paging, the called transceiver generates "beep-back" signals on the lines indicating to the calling transceiver that it is receiving paging signals. A second timer circuit controls a light flasher at the called transceiver to serve as a call back signal.

On Optimal Performance in Self-Organizing Paging Algorithams

Abstract: A brief survey is given of developments in the study of self organizing paging algorithms and the associated library problem. It has been conjectured that two related algorithms, transposition and climb, are optimal in these fields and we establish this optimality for a specific distribution of page references.

Paging Behaviour and Performance Optimization in a Codasyl DBMS.

Abstract: The Programs (which include both the software and documentation) contain proprietary information of Oracle Corporation; they are provided under a license agreement containing restrictions on use and disclosure and are also protected by copyright, patent, and other intellectual and industrial property laws. Reverse engineering, disassembly, or decompilation of the Programs is prohibited. The information contained in this document is subject to change without notice. If you find any problems in the documentation, please report them to us in writing. Oracle Corporation does not warrant that this document is error free. Except as may be expressly permitted in your license agreement for these Programs, no part of these Programs may be reproduced or transmitted in any form or by any means, electronic or mechanical, for any purpose, without the express written permission of Oracle Corporation. documentation and technical data, shall be subject to the licensing restrictions set forth in the applicable Oracle license agreement, and, to the extent applicable, the additional rights set The Programs are not intended for use in any nuclear, aviation, mass transit, medical, or other inherently dangerous applications. It shall be the licensee's responsibility to take all appropriate fail-safe, back up, redundancy and other measures to ensure the safe use of such applications if the Programs are used for such purposes, and Oracle Corporation disclaims liability for any damages caused by such use of the Programs. Oracle is a registered trademark of Oracle Corporation. All other company or product names mentioned are used for identification purposes only and may be trademarks of their respective owners. The Programs may provide links to Web sites and access to content, products, and services from third parties. Oracle is not responsible for the availability of, or any content provided on, third-party Web sites. You bear all risks associated with the use of such content. If you choose to purchase any products or services from a third party, the relationship is directly between you and the third party. Oracle is not responsible for: (a) the quality of third-party products or servcies; or (b) fulfilling any of the terms of the agreement with the third party, including delivery of products or services and warranty obligations related to purchased products or services. Oracle is not responsible for any loss or damage of any sort that you may incur from dealing with any third party.

B board paging system

Abstract: PURPOSE:To enable an operator to any other switching process while holding a main wire, by informing a called subscriber of a paging number and by making the called subscriber dial a specific number and its paging number to send them to a B board. CONSTITUTION:When a person in charge that a main-wire originating subscriber requests is absent on the side of called telephone set B, on operator disconnects an extension and dials a special number to acquire PGT (paging trunk) 2 via route 23; and information on a call to the person in charge and the paging number are sent via speaker 3 and the main wire is left held. Then, the called subscriber dials the special number of paging and a pool number by the nearest telephone set C to call corresponding B board ATT6 via route 24 and OPT (operator trunk) 7 and after a talk between the operator and called subscriber, the B board is disconnected through the operation of the operator, so that the called subscriber start a talk with the calling subscriber on the main wire via route 25 and incoming trunk 4. Therefore, the operator can supervise a call in a corresponding busy state and a load upon an extension subscriber is also reduced.

Paging receiver and method of operation thereof

Abstract: A paging receiver selectively operable in either a six tone battery saving mode or in a five tone non-battery saving mode. The receiver includes a digital tone detector (12) programmable to respond to the sequence of paging tones, then to the preamble tone, and then to the sequence of paging tones. This arrangement permits the receiver to rapidly detect sequential paging tones when the battery saving mode is not utilized or to rapidly detect the preamble tone and sequential paging tones when the battery saving mode is utilized.

Paging service system

Abstract: PURPOSE:To prevent the lowering in the service to the individual broadcast, by keeping each individual broadcast at the occurrence of paging. CONSTITUTION:When the request for paging is taken place, the caller is connected to the simultaneous broadcast paging trunk SPPGT. Offhook is monitored at the relay A. The start lead ST is connected to each individual broadcast trunck PGT to start the relay R. As a result, the individual broadcast trunk PGT disconnects the communication path of the terminal A0-relay contact r-terminal A1-terminal B0- relay contact r-terminal B1 to give hold tone to the caller during individual broadcast in the path of the hold sound source HDT-relay contact r-terminal A0-and terminal B0, and it is waited until the end of paging broadcast while being connected to the individual broadcast trunk PGT1. When paging broadcast is finished, the relay R is restored enabling individual broadcast.

Performance Modeling of Multiprocessor Systems with Paging.

Abstract: : The rapid advancement in semiconductor technology continues to change the environment in which computers are designed. As hardware costs decline, systems with multiple processors become an interesting alternative to conventional single processor system. An analytic model has been developed to describe the performance of a wide range of multiprocessor system configurations and workloads. This model deals specifically with P tightly-coupled, identical processors with shared primary and secondary memory. Secondary memory consists of a paging drum with S sectors. The workload consists of J independent, identically-distributed jobs whose faulting or I/O behavior is described by both a mean (lambda faults/sector-time) and a squared coefficient of variation (K). In addition, the processing overhead for each I/O request is added to a job's execution time at a processor (C) sector-times/fault). The model developed provides an estimate of system throughput for various numbers of processors, jobs, and drum sectors, and for various workloads. The model can be used to examine the behavior of multiprocessor systems, including the sensitivity of system throughput to each of the system parameters and parameters trade-offs related to system performance. In particular, in a system with a fixed amount of memory, the addition of jobs to the system causes a change in the memory allocation for each job and thus modifies each job's faulting behavior. The above formula for throughput is useful to examine the desirability of adding or subtracting jobs in such a system.

Incoming transfer system

Abstract: PURPOSE:To ensure the announcement of the incoming arrival regardless of the called party's whereabouts, by securing the paging of the loudspeaker or the pocket bell at the absence transfer time. CONSTITUTION:When subscriber A dials the number of subscriber B, central controller CC decides whether subscriber B has the absence transfer register or not. And in case the absence transfer is registered, controller CC reads the transfer address information out of memory device M. In case the transfer address is extension subscriber C or attendant board ATT, the absence transfer connection is given via intra-office trunk IOT. And in case the paging information is set to device M as the transfer address, the connection is secured to loudspeaker paging trunk PGT or pocket bell paging trunk PBPT. Thus the incoming service can be attained.