Abstract: A system which includes a microprocessor (or microcontroller) and an auxiliary chip which monitors the system power supply voltage and performs related functions for the microprocessor. The microprocessor can access the auxilary chip to ascertain the power history. That is, the microprocessor can direct an interrupt to the auxilary chip, which will cause the auxiliary chip to respond with a signal which indicates to the microprocessor whether the power supply voltage is heading up or down. When the microprocessor is reset at power-up, the present invention permits the microprocessor to determine (by querying the auxiliary chip) whether the supply voltage is marginal, so that the microprocessor does not go into full operation until the supply voltage is high enough.

Abstract: The present invention is a method, system and process for automatically customizing a computer environment based on the current active computer disk directory. Detection of the current active disk directory and any change of disk directory by a user triggers a search for a file that initiates the computer environment. Upon detection of the file, the system reconfigures the operating system to meet the user's requirements based on the disk directory.

Abstract: The disclosed invention is directed to a computer system comprising a log-on device, which at log-off records information defining the user's activity (e.g., the user's view of objects displayed on his display terminal), and, at log-on, automatically restores the system to the situation extant at log-off. The storage device on which the object view data is stored is removable, whereby the user may carry it from one terminal to another.

Abstract: A method is employed for pre-assignment and pre-scheduling of tasks that enables allocation across multiple physical processors arranged in a variety of architectures. The method comprises the steps of: constructing a DFG of tasks to be performed to provide a solution for a problem; determining cost values for each task and the overall problem, such cost values taking into account a target multiprocessor architecture and factors such as elapsed task execution times. The method pre-assigns the tasks to logical processors and assures that inter-dependent tasks are executable by logical processors that are within required communications delay criteria of each other. The assigning action attempts to arrive at a minimal cost value for all tasks comprising the problem. The pre-assigned tasks are then pre-scheduled based upon a performance criteria and are converted to machine code. The machine code is then deployed to physical processors in the target multi-processor architecture.

Abstract: Data may be manipulated directly in an object oriented programming system by providing a slot object which contains data within its frame. In contrast with conventional objects, the frames of which only contain attributes of the associated instances, the slot object contains actual data therein. Since this data is not contained in a separate object, a unique object identified need not be provided, thus simplifying object management. Unique messages also need not be provided so that message overhead is simplified. Memory fragmentation is also reduced because simple and tightly bound data may be encapsulated within a larger slot object. The data area in the slot object may be of fixed or variable size.

Abstract: A method and apparatus for providing asynchronous communication between at least one central processing unit (CPU) and at least one associated memory unit with specially programmed timing signals to latch, select and transmit data between them.

Abstract: A data collection and storage method is disclosed wherein data is stored in a sequence of files in time-serial fashion. Data is first stored in a temporary file, following which the temporary file is redesignated so as to receive the name of one of a series of permanent storage files. This arrangement allows the permanent storage files to be read out while data continues to be collected, eliminating a bottle neck which heretofore existed in the art.

Abstract: A computer system has a processing unit with suspend/resume capability, a memory, and a hard disk drive. In response to a first command from the processor, the hard disk drive sends its status to the processor and the processor stores it in the memory. In response to a second command from the processor, the hard disk accepts from the processor the status retrieved by the processor from the memory, and restores itself to this status. In an alternative embodiment, the hard disk drive response to the first command by storing its status on its own hard disk, and responds to the second command by restoring this status from the hard disk. In each case, an output line from the hard disk used to control a light emitting diode is also selectively used to create an interrupt to the processor which facilitates the systems entry into the suspend mode.

Abstract: A computer which carries its BIOS in a Flash EPROM. A UV-EPROM carries a redundant BIOS, which can be overlaid onto the BIOS address space by selection with a physical switch.The BIOS contains a small core software program, at the BIOS entry point, which checks BIOS integrity, and provides for reloading the Flash EPROM's BIOS if needed (from a floppy disk, or by copying the entire contents of the UV-EPROM).

Abstract: An OS control method for controlling an operating system (OS) running in a computer system on which a plurality of OSs run and which includes an instruction processor, a control program for controlling running of a plurality of OSs, a main storage, an external storage device, and an address translation circuit. In the course of processing performed by the instruction processor, predetermined operation of the instruction processor is monitored to output trace data affixed with an address conforming to the running OS in accordance with predetermined conditions for the predetermined operation. Address for the running OS is translated into a real address on the main storage. A debugging assist unit outputs trace data to one of plural storing areas of the main storage corresponding to the running OS at the translated real address.

Abstract: A process for scheduling a processor, in a stored program digital switch of a telecommunications network having heterogeneous types of task, utilizes preassigned probability parameters to schedule the tasks for the processor to serve to meet a system objective. For n types of tasks, each having one of n probability parameters P.sub.i where 0<P.sub.i <1, the system first serves a type i task, then if queue i is empty, it serves a type i+1 modulus (n) task. If queue i is not empty, with a probability P.sub.i it serves another type i task and with a probability 1-p.sub.i it serves a type i+1 task modulus (n) until a type i+1 task modulus (n) until a type i+1 task is served. Thus the processor continually cycles through all types of tasks.

Abstract: In an information processing apparatus which operates according to an OS (operating system) stored in a ROM or an OS read from the outside, when using the OS read from the outside, an area of an address space occupied by the OS in the ROM is released so that the released area is utilized by another memory.

Abstract: An information life cycle management system and an information organizing method using the computer system stores information objects composed of a database and program, and a data processing device for processing an information object which is a block of the information in the storage device. Processing and execution of an information object is managed based on information life cycle states, starting with generation of the information object and ending with aborting the information object. An information accessor manager governs the available operation type and area of use of manager information based on the information life cycle state. As information object definition language defines attributes of the information structure and information life cycle state and the managed information object. The information objection is managed in accordance with contents defined by the language.

Abstract: A method for transmitting commands from an originating program to a receiving program uses the data area of instructions. A first set of commands are predefined for use in the command area of the instructions. A second set of commands, excluded from the first set of commands, can pass through operating system modules, including driver software, by inserting them in the data area of an instruction. The second set of commands are identified by including identification codes in the data area, such as a predefined random number key. In addition, the command area can be used to eliminate the majority of normal commands quickly by always using a specific address and command in the first set of commands to transmit the second set of commands.

Abstract: A distributed database management system includes a plurality of computers, each including a database for storing data files to be processed. The plurality of computers are interconnected by communication lines. Each computer has stored data file names, and corresponding address area and location information for all databases, and measures data file retrieval time from the databases. A retrieval time memory section stores data file retrieval times corresponding to the address areas of data stored in the databases. A retrieval time prediction section retrieves the data file retrieval times for data files corresponding to a data file name requested by a user when the requested data file is stored in at least two databases, utilizing stored data file retrieval times and corresponding address areas and location information on where the data file is stored.

Abstract: A system and method for managing common data including a computer on which at least one program runs, and a memory storing pairs of common data. Each of the pairs of common data corresponds to a common information item. When a program on the computer updates a common information item, it judges which one of the pair of common data is older, and updates the older common data by replacing the older one with new common data. When a program accesses a common information item, it judges which one of the pair of common data is newer, and accesses the newer one.

Abstract: A database processor in a distributed database system has a decision making section for use in detecting whether a distributed deadlock has occurred if a contention is detected by a contention detector. If a distributed deadlock occurs, the decision making section posts or provides a concurrency controller with information regarding the detection of the distributed deadlock, whose occurrence has been detected by a global deadlock detector on a network to which the database processor is connected. The concurrency controller instructs a transaction controller to cancel the queuing of the transaction forming the distributed deadlock. The transaction controller can then take prescribed controlling actions to swiftly resolve the distributed deadlock.

Abstract: A computer system including a plurality of shared resources to be used exclusively by a plurality of tasks. Upon occurrence of an interrupt, execution of the task running at that time is suspended to allow the interrupt task to be executed. After execution of the interrupt task, one of the tasks remaining in the execution waiting state is selected for execution.

Abstract: A method and apparatus for prioritizing a plurality of incoming electronic mail messages for a user uses a user created and modified rules-control (12) which is stored in a rules-store (12). Incoming messages are stored in a message store (11) and are screened individually by a rules test unit (13). The rules-test unit has a comparator (52) which matches keywords which are chosen by the user while creating the rules, add supplies signals to an action list unit (54). By applying the user created rules for deciding which messages constitute the priority messages for the user, a priority assigning unit (45) within an action portion (35B) of the rules-store (12) assigns a priority number (say from 1 to 5, 1 being the highest priority for example) to each screened message. Responsive to the assigned priority number of the screened message, the message is sent to a main folder store or forwarded or put away as appropriate. The user created rules can be modified by the user using a conventional keyboard.

Abstract: A dynamic-link library method and system for providing services to one or more application programs. The system includes a code resource that includes a plurality of service routines to allow any of the programs to use the service routines. The code resource is physically distinct from the application programs and does not have to be copied into the application programs, which allow the code resource and the application programs to be updated, compiled, and tested separately from each other. A selector routine receives the selection information from the stub routine, and in response thereto accesses the associated service routine and causes the associated service routine to perform its intended service. Preferably, the stub routine allocates parameters to be used by the associated service routine and passes the parameters to the selector routine along with the selection information.