Showing papers on "Paging published in 1982"

Apparatus and method for a data processing unit sharing a plurality of operating systems

Abstract: Apparatus and method for a supervisor for data processing system capable of utilizing a plurality of operating systems. The supervisor includes apparatus for identifying a condition in the data processing system requiring a different operating system. A reserved memory area associated with the currently active operating system is then addressed and register contents of a central processing unit are stored in the reserved memory area. The reserved memory of the operating system being activated is addressed and causes the address of the reserved memory of the operating system being activated, the data related to permitting the physical memory associated with the operating system being activated, contents of registers safestored in the reserve-memory and, data establishing the decor of the operating system being activated are entered in the central processing unit. The operating system to be activated is then enabled, and execution of permitted instructions by the second operating system is begun. The physical memory locations are determined by a real address through use of a paging mechanism permitting storage of portions of the operating systems in non-contiguous groups of locations while isolating the memory available to each operating system.

Adjacent radio cells paging channel chaining system

Abstract: The free transmission capacity of one or more paging channels within a radio cell is employed in order to transmit organization specifications concerning the paging channel frequencies employed in the neighboring radio cells. The appertaining mobile radio station carries out level comparison measurements at suitable chronological intervals on the specific paging channel frequencies for the purpose of its potentially necessary reassignment to a neighboring radio cell. A reassignment of the appertaining mobile radio station to the corresponding neighboring radio cell occurs when a better radio connection quality exists on one of the neighboring radio cell paging channels.

Picture information storage retrieval device

Abstract: PURPOSE:To achieve efficient retrieval by varying the page intervals of pictures to be displayed and display time per picture in accordance with retrieval conditions inputted to the console part of a picture information storage retrieval device which performs page-by-page display of pictures. CONSTITUTION:When a setting part 7 for system sequence control mode sets a retrieval mode, a system control part 5 controls respective parts to place them in a retrieval waiting state, and when retrieval information is inputted from a retrieval information input part 6, the system control part 5 generates a list of storage addresses of the picture information to write it in a storage part 14 for picture retrieval addresses through a retrieval display control part 11. On this writing operation, the stored addresses are read out successively to specify the addresses of a picture information storage part 2 successively, and the stored picture information is read out successively and then stored in a picture information storage part 15 for display. The retrieval display control part 11 operates by receiving signals, which vary and set a paging speed and the number of pages, from variable-signal input parts 12 and 13 to perform rapid and efficient retrieval.

Paging receiver with a decoder-P-ROM

Abstract: A paging receiver comprises a P-ROM with a built-in decoder for storage of N kinds of information. The stored contents of the P-ROM are read out in series in response to a clock frequency equal to or greater than N times the clock corresponding to the data speed of a received signal. Substantially simultaneous comparison of N kinds of the read-out data with the received signal is effected to determine whether or not the received signal is a paging signal for the own receiver.

A large database DNA sequence handling program with generalized searching specifications.

Abstract: The program described allows for the creation and manipulation of files of DNA sequence data up to very great lengths. The program uses its own paging system to load segments of the sequence into a small internal buffer so that the program does not have excessive memory requirements. The program offers a menu of functions to the user, and has been written to be forgiving of user errors. A code for the generalised specification of bases as a series of groups (i.e. A or T, Purine, etc.) has been devised and can be used in search specifications or in sequence files. Versions of the program have been developed to run with special efficiency under DIGITAL's RT11 operating system or to run under systems with a suitable implementation of FORTRAN VI.

Radio paging device including apparatus for preventing undesired device turn-off

Abstract: A radio paging device is provided which includes apparatus for preventing turn off of the paging device until all selective calling message signals which are stored in the pagers memory have been displayed. The pager of the present invention further includes apparatus for automatically initiating interrogation of the memory when the user attempts to turn off the paging device.

A data flow architecture with a paged memory system

Abstract: During the last ten years, data flow has become an exciting research area and several architectures have been proposed and built. They differ mostly in the way they handle data structures and how they provide mechanisms for token labeling or colouring in order to make data flow graphs reentrant. The paper presents a data flow architecture with a paged memory system to hold both data flow programs and data structures. The token labeling mechanism is coupled with the memory management system in order to provide for each token a unique memory location. The instruction format allows instructions with multiple operands and multiple destinations for each result. Data structures are held in memory while pointers to the structures are circulating as tokens. The proposed architecture is able to execute data flow programs at the level of single instructions or at a higher level.

Paging processing system

Abstract: PURPOSE:To obtain a CCW chain easily by entering channel command words in a main storage control table previously. CONSTITUTION:A main storing means 1 is provided with a table 1-1 stored with pages of an external auxiliary storing means 5, loaded in the means 1, and channel command codes required to input and output respective pages, and cotinuous information display codes displaying continuous information on other pages are set in the table 1-1. For paging processing, the channel command codes are used.

Multiprocessing system with variably shared paging storage

Abstract: A shared paging storage manager partitioning storage into sectors private to individual running processes, maintains, for each running process, a list of segment list counts for the ordered unequal segments of a fictional maximum sector, and an ordered page identity stack of an equal page capacity each position the stack uniquely associating its contained page identity, with one segment, the order of page identities representing their relative replacement order, the actual accessing of a page causing the hit count for the segment corresponding to the stack position containing the page identity at the time of the access to be incremented, and effects optimum partitioning by determining the highest totalling hit count for each of the various combinations of segment list lengths of all the lists representing an aggregate segment page capacity not exceeding the available storage page capacity.

Analysis of the PASM control system memory hierarchy.

Abstract: Many proposed large-scale parallel processing systems (e.g., PASM) can operate in multiple-SIMD mode. The multiple control units in such a system share a common secondary storage for programs. The control units use paging to transfer programs to their primary memories. One design problem is determining the optimal service rate for the secondary storage, where the "optimal" is characterized by maximum processor utilization. The problem is approached by developing a queueing network model for the PASM control system memory hierarchy. Based on assumed values for parameters which characterize the expected task environment, an optimal service rate is derived from the model. The values of the parameters in the model can be varied to determine the impact these changes would have on system performance. Simulation results verifying various aspects of the model are presented. The results are shown to apply to the general model for a multipleSIMD machine.

Data processing apparatus including a paging storage subsystem

Abstract: in a paging storage subsystem, a plurality of addressable data storage devices (16-18) are selectively directly accessed using direct addresses (21, 26) or accessed via a cache memory (100), using one of a plurality of logical addresses (23, 25), each of the data storage devices being represented by a plurylity of the logical addresses. Each of the data storage devices can be reserved for direct access; such reservation does not apply to device accesses via the cache. Accesses to the devices are queued on a logical device basis, preferably separately for read and write accesses. Multiple ports (20, 15) from host to subsystem can be employed concurrently.

Memory device having address converting mechanism

Abstract: PURPOSE:To manage with only one virtual address converting mechanism in a system, by providing a memory control part with an address converting mechanism which converts an accessed virtual address into the actual address of a memory part. CONSTITUTION:Memory requests from a processor are all supplied as virtual addresses on a common bus 11 and set in a virtual address register 21; and a conversion table 30 is stored in a memory part 16, and a high-speed buffer (TLB) 22 wherein accessed address information is stored is provided at a control part. The V bit 61 and C bit 62 of the TLB22 indicate the current states of corresponding pages, and when the V bit 61 is a 0, it is shown that the contents of the corresponding page of the TLB22 are insignificant data; when a 1, 1, the paging of the page is in process and when a 1, 0, the page is stored in the memory part 16, showing memory access is possible. When the 1, 1, only access from a file control processor is permitted.

A comparsion of binary paging codes

Abstract: A comparison of two of the major coding formats for binary paging is presented. Performance of the codes is investigated for both Gaussian noise and Rayleigh fading. An analytical analysis of the stationary pager in a fading field is also presented. For the Gaussian and Rayleigh fading cases, the testing uses a common radio and bit detector as the receiver with either frontend noise or a Rayleigh Fading simulator to simulate the rf channel. A minicomputer is interfaced to both the rf generator and the data output of the bit detector and serves as the source, sink and statistics tabulator for the testing. In addition to alert-only paging, this study investigates the performance of both numeric and alphanumeric paging. A discussion of the implications of the various sensitivity differences is included.

The kernel of the EMAS 2900 operating system

Abstract: The role of the kernel of the operating system EMAS 2900 and the implementation of its functions are described in some detail The significance of local scheduling policies and their implications on the design of the kernel are discussed with particular reference to paging management and scheduling control It is shown that the concept of local and global control of resources can lead to a considerable simplification in the structure of an operating system kernel The resulting operating system, EMAS 2900, provides interactive time-sharing services very effectively and efficiently to a large computing community

Radio calling system

Abstract: 1. Method for the operation of a radio paging system, in which a radio paging exchange (fig. 4) is reachable from a telephone subscriber station by way of the telephone network through selection of a special identification number and emits a paging signal (R, Rv) to the radio paging receiver concerned by reason of the call number of the called radio paging subscriber subsequently selected by the telephone subscriber, wherein the paging signal (R, Rv) can also contain a communication (for example a call number), which is put in by the calling subscriber and indicated optically on an indicating equipment of the paging call receiver, wherein the calling subscriber through combined selection of the identification number for a paging signal (R, Rv) and a certain code numeral (06) receives a signal (aS) to signal that a speech connection to the called radio paging receiver is subsequently placed ready, for the duration of which connection a transmission of speech information (S) is possible to the radio paging receiver, characterised thereby, that the paging signal (R, Rv) is emitted within a transmission cycle (Sz), which starts with a preamble (P), which can be followed by several paging signals (R, Rv), that the emission of the associated paging signal (R) is delayed after the selection of the code numeral (06) until all paging signals (Rv) enjoying precedence have been emitted within a transmission cycle (Sz), that the paging signal (R) caused through the selection with code numeral (06) is emitted immediately following on paging signals (R) emitted in the same transmission cycle (Sz) and without preamble lying therebetween and that the placing ready of the speech connection takes place in the same transmission cycle (Sz) following the emission of the paging signal (R), which is caused through the selection with code numeral (06).

Paging system of microcomputer

Abstract: PURPOSE:To increase the designating range of the usable address and to access both a program and the working region with the same address designation scarcely changing the software, by adding a simple page switching device. CONSTITUTION:The hardware of the paging system of a microcomputer comprises a microprocessor, a common hard part 18, a gape switching part 19 and a ROM/ RAM hard register part 20 respectively. A gate switching register 11 is provided to the part 18, and a page decoder 12 provided at the part 19 is connected to the register 11. Furthermore an address decoder 14 is connected to the decoder 12 via a page enable line 13. At the same time, an address bus 16 is connected to the decoder 14, and the address is supplied to the part 20 via a page address line 15. Then the page designation code given from a decoder bus 17 is latched to the register 11, and the deisgnated data is decoded by the decoder 14. Thus the address designating range is increased.

Experimental results on the paging behavior of numerical programs

Abstract: Traces of numerical programs are used to examine their behavior in a paged virtual memory system. The working set policy is used for the replacement algorithm. It is found that the behavior of such programs is different from the behavior of other types of programs like compilers and system programs. These differences are most significant in the lifetime curves and the space-time cost curves. All programs examined showed ill-behavior. Moreover, the space-time costs of executing these programs are very sensitive to the choice of the control parmater, the window size. Our measurements show that approximations based on the common practice of using virtual time instead of real time in generating statistics are often inaccurate. The “primary knee criterion” of optimizing the space-time cost did not hold for some programs. The parameter-real memory and the real memory-fault rate anomalies show significantly in all but one of the seventeen programs examined.

Optimal Font Caching

Abstract: : An efficient algorithm is presented for communicating letter-shape information from a high-speed computer with a large memory to a typesetting device that has limited memory. The encoding is optimum, in the sense that the total time for typesetting is minimized, using a model that generalizes well-known 'demand paging' strategies to the case where changes to the cache are allowed before the associated information is actually needed. Extensive empirical data shows that good results are obtained even when difficult technical material is being typeset on a machine that can store information concerning only 100 characters. The methods of this paper are also applicable to other hardware and software caching applications with restricted lookahead. (Author)

Control system for virtual storage

Abstract: PURPOSE:To enable to transfer information in high speed and to increase through-put, by providing a series of real storage data set area on an external storage device for swap processing. CONSTITUTION:A virtual storage space VS-A is provided with pages A-L corresponding to a page file PF-A of an external storage device EPS and a real storage space RS-A is provided with 1-6 pages continuously, and program processing is made while being replaced with the pages of the space VS-A. In this case, when the working set of a program at a point of time is 6 pages of A,D,F,G,J,K in the RS-A, if the set of the real storage data is in swap control, the storage is expelled to a swap file SWF being the set area of the real storage data provided in the storage EPS, then the program is interrupted and other program can be used for the space RS-A.

Telephone set possible for callout with loud speaker

Abstract: PURPOSE:To inform the permissible time point of the start of paging broadcast, by transmitting continuously a waiting tone to a paging service request personnel until the completion of preparation for start of a paging device CONSTITUTION:When a paging service request subscriber EXT is connected to a paging trunk PGT through a channel switch SW, the PGT is started through the operation of a relay A, the specified timing is taken with time measuring means W and C, and after the channel is connected to a signal tone device TGEN through switching and a waiting tone WT is transmitted to the extension, the channel is connected to the paging device to make possible the paging broadcast Since the subscriber requesting paging can recognize the paging broadcast start time point, no interruption of head of the paging broadcast content or mixture of the chime is expected

Paging system in microcomputer

Abstract: PURPOSE:To simplify sotware constitution with simple hardware by forming interface parts of the same constitution to be controlled including RAMs for control and by switching them by a page changing register. CONSTITUTION:When a microprocessor controls controlled systems of the same kinds, interface parts 1 of the respective controlled systems are composed of the same constitution including RAMs for control, and the same address space is assigned to obtain page constitution. Then, a register 2 for changing control over respective pages and a page interruption register 5 which discriminates which page makes an interruption are provided and when the same address is specified, paging is carried out to control those controlled systems of the same kind in time-division mode.

Control system for page peplacement

Abstract: PURPOSE:To achieve efficient page replacement, by enabling to pick up all the pages or all the blocks where the reference bit required by the machine instruction is at on-state. CONSTITUTION:A timer interrupting processing section 5 of an operating system 4 starts a paging supervisor 6 with a specified period. The supervisor 6 sets mask table 13 so that the bit corresponding to a real page during usage is 1, the mask table 13 is designated at the 1st operand, a PRT14 is designated at the 2nd operand, and a RRBM instruction 3 is issued. A central processor 9 executes the RRBM instruction 3 with an operation circuit 10. When the supervisor 6 obtains information in the PRT14, the PRT14 is referenced with a PRT reference section 7 and makes replacement of CUE of real page during usage and the renewal of required PFTE1 at a PFTE renewal part 8.

Simultaneous paging system

Abstract: PURPOSE:To enable simultaneous paging, by giving audio signals of the same incoming channel to a trunk circuit provided corresponding to a paging zone at the same time. CONSTITUTION:In a time division exchanger making time division exchange through the set of an outgoing channel to an incoming channel, a signal inputted from a telephone set (microphone) 11 to an exchanger main body 13 through a line circuit 12 and a specific incoming channel is given at the same time to a plurality of outgoing channels of a time division multiplex channel from the designation control of memory address, and an audio output is made from speakers 16a, 16b from the drive of an external paging device 15 after zone paging trunk circuits 14a, 14b provided at each outgoing channel, allowing to make simultaneous paging using the zone paging trunk. Thus, no exclusive trunk is required for the simultaneous paging.

Software segmented virtual memory

Abstract: The techniques of paged virtual memory, commonly employed only in large operating systems, can be provided at the software level by a small collection of primitive procedures. This paper defines the primitives and their implementation. The techniques of applying software virtual memory are also discussed, and these techniques are useful for compilers, database systems, and other applications in which large amounts of random access memory are required. Other benefits of using software virtual memory are transportability, modularity in program design, implementation on mini and microcomputers, and improved speed performance over alternative approaches.

Paging system for electronic private branch exchange

Abstract: PURPOSE:To use a paging trunk for call and as an extension circuit, by changing the class of the paging trunk by a program. CONSTITUTION:A class different from that where a paging trunk Pag is used as an extension circuit is set to the trunk Pag connected to a broadcasting device AMP by a program. In case of a call to an extension telephone set from a trunk line, the extension telephone set is hooked off. Then, a central processing device CC is operated by the control of a program to cause the operation based on the class, which is set by the program, in respect to the trunk Pag, and the device AMP is driven by a relay Sd0 and is connected to the extension telephone set to make the service possible. When the class where the trunk Pag is used as an extension circuit is set by the program, the trunk Pag in the extension class is acquired to make terminating and originating to the extension telephone set possible.

Connection system for paging response

Abstract: PURPOSE:To economize the connection system for paging response and simplify the control, by switching connection of terminating trunks by a paging response number dialing in the connection system for paging response to the incoming call from a line wire. CONSTITUTION:Idle subscriber's circuits are used as dummy terminals DT- A and DT-B corresponding to respective terminating trunks as they are. During a paging call, terminating trunks ICT-A and ICT-B related the incoming call of a line wire are connected to corresponding dummy terminals DT-A and DT-B, and terminating trunks ICT-A and ICT-B are switched to be connected to optional extension telephone sets EXT-A and EXT-B by the paging response number dialing due to extension numbers of dummy terminals DT-A and DT-B from optional extension telephone sets EXT-A and EXT-B.