摘要:
The invention concerns a self-unpredictable microprocessor or microcomputer, comprising a processor (1), a first working memory (51), a main memory (6) containing an operation system, a main programme (P1) and a secondary programme (P2), characterised in that it further comprises: a second working memory (52); switching means enabling, during the execution of programmes, to switch the working memory function to one of its two working memories (51, 52) while preserving their contents; said switching means comprising at least a block of registers (54) for memorising the context of the programme process flow in the main memory and a switching circuit (53) for validating one of the working memories and access registers (A1-A3), (D1-D3) associated with each memory (51, 52, 6) and controlled by said switching circuit (53).
摘要:
The present invention relates to a processor device, task scheduling method and computer program product, wherein tasks of a program routine are selectively stored in at least two memory stack mechanisms (62, 64) of different priorities based on the allocated priorities. Switching of tasks executed at at least two processor means (20, 30) is controlled by accessing the at least two memory stack mechanisms (62, 64) in response to synchronization instructions inserted to the program routine. Thereby, efficient zero-cycle task switching between prioritized tasks can be achieved.
摘要:
A preprocessor is functionally inserted between a memory and a processor core. The preprocessor fetches virtual machine instructions, like Java instructions, from the memory and from them it generates native instructions which are supplied to the processor core. In response to a special virtual instruction the preprocessor supplies a native jump to subroutine to the processor core, monitors when the processor core returns from that subroutine and then resumes supplying generated native instructions. The invention also provides for a processor which has a special instruction which calls a subroutine and causes the processor to convert a call context for virtual machine instructions to a call context for a high level language subroutine before making the call.
摘要:
Systems and methods for implementing an execution stack which stores frames for functions written in multiple programming languages are provided. The frames for functions written in different programming languages may be interleaved on the same execution stack. A data block on the execution stack may be utilized to traverse the execution stack around a frame by storing a stack pointer and frame pointer to a previous frame. Additionally, exceptions may be propagated, with conversion if necessary, through frames on the execution stack that are written in different programming languages.
摘要:
Embodiments described herein disclose a system for enabling emulation of a MIMD ISA extension which supports user-level sequencer management and control, and a set of privileged code executed by both operating system managed sequencers and application managed sequencers, including different sets of persistent per-CPU and per-thread data. In one embodiment, a lightweight code layer executes beneath the operating system. This code layer is invoked in response to particular monitored events, such as the need for communication between an operating system managed sequencer and an application managed sequencer. Control is transferred to this code layer, for execution of special operations, after which control returns back to originally executing code. The code layer is normally dormant and can be invoked at any time when either a user application or the operating system is executing.
摘要:
Systems and techniques for transferring the flow of control between agents. In one general aspect, a computer program product includes instructions operable to cause data processing apparatus to: store data on a first call stack, the first call stack corresponding to and being used by a first agent; suspend the first agent's use of the first call stack; enable a second agent to access the data by using the first call stack; and resume the first agent's use of the first call stack after the second agent is no longer using the first call stack. According to another aspect, a computer program product includes a first set of instructions that is operable to store and access data on a shared call stack; and a second set of instructions that is operable to alternate execution of the first set of instructions between a first agent and a second, distinct agent.
摘要:
The aim of the invention is to be able to carry out the distribution of software and configuration data in data networks with a plurality of subscribers in a temporally defined manner. To this end, the software or data to be distributed is subdivided into data blocks (A, B, C) and a corresponding list (L) is generated. A first data block (B) and the list (L) are sent from a control centre (O) to a first subscriber (T2). Once a pre-determinable length of time has passed following the reception of the list (L), the subscriber (T2) demands the missing data blocks (C) from the control centre (O). The missing data blocks (C) are then sent from the control centre (O) to the subscriber (T2) such that the subscriber has a complete set of data blocks and can start an installation for example.
摘要:
A divider, comprising: a carry save adder (2014); and a full adder (2103) connected in series with said carry save adder (2014), wherein the series connection of said carry save adder and said full adder performs an addition computation necessary for division computation.
摘要:
A method of pipeline processing that attends to computation by connecting a central processing unit to an additional computation unit, comprising the steps of: storing a computation instruction supplied to the computation unit; executing the stored computation instruction, and checking if completing the execution of the computation instruction requires more than a predetermined time length; shifting the stored computation instruction to a dedicated storage if completing the execution of the computation instruction requires more than the predetermined time length; and executing the computation instruction stored in the dedicated storage until the execution of the computation instruction is completed.