Abstract: A host computer system (host) develops an execution load module for a target computer system (target) having no software development environment, using a high-level language. The host and the target are connected to each other via an exclusive communication line through which the host sends the created execution load module to the target. The target has a disk controller CPU as well as a main CPU, the disk controller CPU receiving the execution load module from the host independent of the main CPU, and storing it in a disk device. When the execution module requires correction, this is performed in the host, by use of the high-level language, after which the corrected module is sent to the target.

Abstract: A method and apparatus for client programs adapted for use in an object oriented, distributed computing system, to have the ability to communicate and use references to objects in a way which improves the benefits of software caching are disclosed. A mechanism is described whereby a network object handle (an augmented object handle) can be used to reference both a server and a local cache manager. When the augmented object handle is transmitted it is automatically updated to use a local cache manager in its target environment (i.e. on the same machine on which the receiving client program resides) if possible.

Abstract: Architectures and methods are provided for efficiently dividing a processing task into tasks for a programmable real time signal processor (SPROC) and tasks for a decision-making microprocessor. The SPROC is provided with a non-interrupt structure where data flow is through a multiported central memory. The SPROC is also programmed in an environment which requires nothing more than graphic entry of a block diagram of the user's design. In automatically implementing the block diagram into silicon, the SPROC programming/development environment accounts for and provides software connection and interfaces with a host microprocessor.

Abstract: A data processing apparatus comprises input, file update, display and print processing units which are independently operated and linked to each other. Arbitrary word labels can independently be set in each processing unit. Each processing unit performs only an operation defined by the word labels. The data processed by one processing unit can be used as a source data based on which the succeeding linked processing unit performs another processing operation.

Abstract: A way and a system for invoking a method in an object-oriented language which is so arranged that when a predetermined method for a first whole object is invoked, two instance variables of the first whole object maintain an exclusive relationship while the exclusive relationship is also satisfied between first and second part objects. In such an arrangement, when a message is sent from a second whole object to the first part object and the exclusive relationship cannot be satisfied between the first and second part objects, a daemon method for the first whole object is invoked to send a message from the first whole object to the second part object, thereby maintaining the exclusive relationship between the first and second part objects.

Abstract: A method and apparatus for file operation comprise a file operation method which enters, prior to the file operation, processing methods for exceptional events which are expected to occur during the file operation, a file operation method which, at the occurrence of an exceptional event during a file operation, holds the file operation, saves information pertinent to the held file into a memory, and inquires the user of the processing method of the held file for the exceptional event, and a file operation method which displays a list of hierarchically organized files at multiple levels so that multiple files can be designated as objects of operations.

Abstract: In an object-based computer system, each object is contained in, and each task executes in, a protection domain. Domains exist at several hierarchical domain levels, some levels having multiple discrete domains, while others have one common domain. A task may access an object if the domain in which the task is executing is the same as the domain containing the object, or if the domain in which it is executing occupies a higher hierarchical domain level than the domain containing the object. Each object includes a domain attribute, which is a numerical value defining the domain in which it is contained. The domain attribute of the currently executing task is stored in a domain register. When an attempt is made to access data within an object, the domain attribute of the object is compared with the domain attribute stored in the domain register. If the access conditions are met, access is permitted.

Abstract: A plurality of work stations each imparted with a multi-window control function are interconnected through an integrated service digital network (ISDN), wherein control communication route is established among a plurality of stations between which interlocutory communication are to be performed. The work stations transfer control commands by way of the control communication route in accordance with operation by users under the control of an interlocution control program to thereby establish or disconnect a logical communication route between designated application programs of the work stations. So long as the logical communication route is established, the application programs can execute data processing in cooperation with each other. In that case, identical change of display in the windows corresponding to the application programs, respectively, takes place in the work stations.

Abstract: An interrupt test circuit is provided on the same chip with a microprocessor system having a central processing unit, and an interrupt controller controlling execution of an interrupt operation of the central processing unit in response to an interrupt request signal from peripheral units. The interrupt test circuit is connected between the peripheral units and the interrupt controller and includes a test signal output connected to the interrupt controller, and storage means for storing an interrupt request test signal when receiving a predetermined signal and for supplying the test signal through the test signal output to the interrupt controller for interrupt performance test.

Abstract: A ring purging station for a token-ring network is disclosed. The station performs purging operations to remove no-owner frames and frame remnants from the network. The station begins a purging operation by detecting the token on the network and removing it. The station then begins stripping all frames and remnants of frames that it receives from the network, and transits one or more purge marker frames. When the station detects one of the one or more purge marker frames it transmitted, it ends the purging operation, and releases the token back onto the ring. In this way no-owner frames and frame fragments are removed from the network, while the ring is otherwise normally operating. In an embodiment of the invention, a sequence number is associated with each purging operation, included in the purge marker frame(s), and verified upon receipt of the purge marker frame(s). The station also corrects multiple token conditions when a multiple token condition is detected during a purging operation.

Abstract: A system and method of down loading, over a network, operating systems or other executable programs to a computer which does not have a boot device or other device containing the executable program. Down loading is accomplished without modification of the loadable image. The computer has a network interface which requests a minimum-boot program be transferred from a host computer on the network. The minimum-boot program, when executed, establishes a logical connection to a disk server on the network and allows the requesting computer to treat the disk server as a local boot device.

Abstract: A mainframe computing system is adapted to be loaded with one of a plurality of different operating systems and different associated microcode to provide a computing system which is capable of running user programs adapted to be executed by the loaded operated system comprises a main memory for receiving the desired operating system coupled to a system bus. An instruction processor and an input/output control processor are coupled to the system bus and are provided with an instruction register for presenting user program instructions to the processors. The processor means have associated therewith microcode storage memory which receive and store a set of microcode instructions to be performed by the processors according to the program instruction stored in the instruction register. The stored microcode comprises primary microcode instructions to carry out each of the instructions in the instruction register means.

Abstract: The present invention sorts very large volumes of data records by forming successive lists of sorted record start address by character rank from a LSD (least significant digit) of a sort field to a MSD (most significant digit) of such field with each list being formed in the order of the preceeding list. The present invention forms the lists by placing record start addresses in a collated list of virtual pockets wherein successive occurrences of like characters are linked to the next pocket memory position of such character so as to form the list in a memory requiring only the same number of addresses as there are records being sorted. The invention thus very materially reduces the size of pocket memory required for this type of data sorting.

Abstract: A method for operating a digital computer in response to the occurrence of an exception is disclosed. The method provides for the examination both of the contents of a predetermined computer location and of the instruction code for the instruction causing the exception. The computer then utilizes the result of those examinations to determine the dismissibility of the exception. The computer transfers control to the next instruction after the instruction which caused the exception if that instruction is dismissible.

Abstract: A method for implementing transaction-consistent resource recovery from catastrophic media failures in a single pass over a recovery log archive while permitting most UNDO log records to be discarded during log archiving. The media recovery procedure is based on a pseudo-crash recovery technique that simulates a system crash at a selected time by writing PSEUDO-RECOVERY records to the recovery log. Resource recovery is then performed by normal execution of the log archive records up to the most recent pseudo-crash followed by execution of the subsequent PSEUDO-RECOVERY records. The recovery log record execution procedures are compatible with the ARIES recovery method. One embodiment of this invention assumes that the recovery log records can be selected for archiving on the basis of a combination of record type and transaction identifier.

Abstract: Disclosed is a resource sharing system having a host computer and a plurality of a client computers connected by a Local Area Network (LAN). Resource sharing software, located in the host, is comprised of a supervisor process, a spooler process, and a plurality of session worker processes. This supervisor receives an initial call request from a client, and creates a session worker to handle all subsequent requests from that particular client. Each session worker creates a plurality of co-routines, one for each concurrent request, which operate to provide a high-performance response to the network. Co-routines share the session worker stack, as well as all other areas in the session worker. Because co-routines never interrupt each other, there is no competition for resources, and no need for critical sections of software.

Abstract: A method and system are disclosed for efficiently managing task memory in a multi-tasking data processing system having a processor for processing multiple tasks, task memory associated with each task, main system memory and multiple data records stored within direct access storage. A data record is copied from direct access storage into a buffer in main system memory in response to an access of that data record by a particular task. A buffer within that task's virtual memory is then mapped to the data record and a write protect bit is associated with the task memory buffer. Thereafter, any attempt to store data into the buffer will temporarily halt processing of the task until a copy of the data record is written to a second buffer. Task processing is then resumed, after modifying the task's page table to reference the second buffer, and the task is then permitted to store data within the second buffer.

Abstract: A computer system provides registration of resource for synchronization point processing. Resources include file systems, data bases, and protected conversations. A resource becomes protected by the system when it is registered in the application's execution environment. The execution environment includes but is not exclusive to the interactive environment. Accordingly the invention provides an efficient and uniform method for identification of protected resources. The registration facility is separate from the application. Thus, the users of applications, application program developers, system administrators and operators need not have to consider or design a registration facility but only involve the one provided. A protected resource manager, through its adapter, can modify, at any time, the registration information, either by adding missing information or by changing the existing information. A resource registers only for the work unit in which it wishes to participate.

Abstract: Method and apparatus for correctly predicting an outcome of a branch instruction in a system of the type that includes a Branch History Table (BHT) and branch instructions that implement non-explicit subroutine calls and returns. Entries in the BHT have two additional stage fields including a CALL field to indicate that the branch entry corresponds to a branch that may implement a subroutine call and a PSEUDO field. The PSEUDO field represents linkage information and creates a link between a subroutine entry and a subroutine return. A target address of a successful branch instruction is used to search the BHT. The branch is known to be a subroutine return if a target quadword contains an entry prior to a target halfword that has the CALL field set. The entry with the CALL bit set is thus known to be the corresponding subroutine call, and the entry point to the subroutine is given by the target address stored within the entry.

Abstract: A state control system designed to work in a sequence of processing operations divided into a plurality of states, with jobs specified for performance in each of the states, and to make a transition to the next state on condition that all the jobs have been completed in each state. The state control system comprises a state control section for rewriting a current state on condition that the jobs in the current state have been completed. According to the state control system, the corpulence of only modules which perform control over the jobs and give instructions to the remote units can be prevented. Further, the state control system can make it relatively easy to equalize the sizes of the individual modules, with a reduction in the concentration of the processing operations in some particular modules and also an increase in the independence of the individual modules through establishment of clearly defined roles for the individual modules.