# US 2010/0138839 A1 · Multiprocessing system and method

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2010/0138839 A1
- Document ID: US20100138839A1
- Status: Published application
- Kind: A1
- Application number: 12/531,737
- Filed: 2008-03-26
- Published: 2010-06-03
- Earliest claimed: 2007-03-28
- Assignees: NXP B.V.
- Inventors: Marco J. G. Bekooij; Jan W. Van Den Brand
- Web page: https://patentgrep.com/patent/US20100138839A1

## CPC

- G06F 9/52: Program synchronisation; Mutual exclusion, e.g. by means of semaphores
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A multiprocessing system executes a plurality of processes concurrently. A process execution circuit (10) issues requests to access a shared resource (16) from the processes. A shared access circuit (14) sequences conflicting ones of the requests. A simulating access circuit (12) generates signals to stall at least one of the processes at simulated stall time points selected as a predetermined function of requests from only the at least one of the processes and/or the timing of the requests from only the at least one of the processes, irrespective of whether said stalling is made necessary by sequencing of conflicting ones of the requests. Thus, part from predetermined maximum response times, predetermined average timing can be guaranteed, independent of the combination of processes that is executed.

## Claims

### Claim 1

A multiprocessing system, comprising:
a process execution circuit configured to execute a plurality of processes concurrently, the process execution circuit being configured to issue requests to access a shared resource from the processes;
an interface to the shared resource;
an shared access circuit coupled between the execution arrangement and the interface to the shared resource, configured to sequence conflicting ones of the requests,
a simulating access circuit configured to generate signals to stall at least one of the processes at simulated stall time points selected as a predetermined function of requests from only the at least one of the processes and/or the timing of the requests from only the at least one of the processes, irrespective of whether said stalling is made necessary by sequencing of conflicting ones of the requests.

### Claim 2 (depends on 1)

A multiprocessing system according to claim 1, wherein the simulating access circuit comprises at least one buffer for the requests or indications of the requests from the at least one of the processes only, the simulating access circuit being configured to select the stall time point as a function of a simulated response to requests indicated in the at least one buffer.

### Claim 3 (depends on 2)

A multiprocessing system according to claim 2, wherein the simulating access circuit comprises one or more further buffers for said requests or indications only, the simulating access circuit being configured to direct indications for requests to the at least one buffer or the one or more further buffers dependent on priority of the requests, and to select the stall time point as a function of a simulated response to the indications that are concurrently in the at least one buffer and the one or more further buffers.

### Claim 4 (depends on 1)

A multiprocessing system according to claim 1, wherein the simulating access circuit comprises a response buffer configured to buffer at least one response to the request from the shared access circuit at a time, until a delivery time point selected by the simulating access circuit as a further predetermined function of requests and/or their timing from only the at least one of the processes.

### Claim 5 (depends on 1)

A multiprocessing system according to claim 1, comprising a plurality of simulating access circuits, each configured to generate signals to stall a respective one of the processes at stall time points selected as a predetermined function of requests and/or their timing from only the respective one of the processes, irrespective of whether said stalling is made necessary by sequencing of conflicting ones of the requests.

### Claim 6 (depends on 4)

A multiprocessing system according to claim 4, wherein mutually different predetermined functions are used by at least two of the respective simulating access circuits.

### Claim 7 (depends on 1)

A multiprocessing system according to claim 1, wherein the shared access circuit is configured to guarantee handling of oldest pending requests or highest priority pending requests from respective ones of the processes each within a predetermined time interval from receiving the relevant request.

### Claim 8 (depends on 1)

A multiprocessing system according to claim 1, comprising the shared resource.

### Claim 9 (depends on 1)

A multiprocessing system according to claim 1, wherein the shared resource is a memory shared by the processes.

### Claim 10

A method of executing a plurality of data handling processes concurrently, the method comprising:
issuing requests to access a shared resource from the processes;
sequencing conflicting ones of the requests from different ones of the processes;
selecting simulated stall time points as a predetermined function of requests from only the at least one of the processes and/or their timing, irrespective of whether said stalling is made necessary by sequencing of conflicting ones of the requests;
causing the at least one of the processes to stall at the selected stall time points.

### Claim 11 (depends on 10)

A method according to claim 10, comprising generating the requests dependent on the value of input data of the at least one of the processes, so that the number of the requests to the input data depends on the input data.
