Priority arbitration based on current task and MMU

Details Priority arbitration based on current task and MMU Priority arbitration based on current task and MMU

2006-10-10

2006-10-10

Kim, Hong (Department: 2185)

Electrical computers and digital data processing systems: input/

Access arbitrating

Access prioritizing

C710S243000, C710S041000, C710S042000, C711S158000

Reexamination Certificate

active

07120715

ABSTRACT:
A digital system and method of operation is provided in which several processors (740(0)–740(n)) are connected to a shared resource (750). Each processor has an access priority register (1410) that is loaded with an access priority value by software executing on the processor. A memory management unit (MMU) (700) is connected to receive a request address (742) from each respective processor. The MMU has a set of entries that correspond to pages of address space. Each entry provides a set of attributes for the associated page of address space, including an address space priority value309a. For each request, the MMU accesses an entry corresponding to the request address and provides an address space priority value associated with that requested address space page. Arbitration circuitry (1430) is connected to receive a request signal from each processor along with the access priority value from each access priority register and the address space priority value from each MMU. The arbitration circuitry is operable to schedule access to the shared resource according to higher of the pair of priority values provided by each processor.

REFERENCES:
patent: 4009470 (1977-02-01), Danilenko et al.
patent: 4400771 (1983-08-01), Suzuki et al.
patent: 4403285 (1983-09-01), Kikuchi
patent: 4633394 (1986-12-01), Georgiou et al.
patent: 4638426 (1987-01-01), Chang et al.
patent: 4642756 (1987-02-01), Sherrod
patent: 4926313 (1990-05-01), Byers et al.
patent: 5157654 (1992-10-01), Cisneros
patent: 5226133 (1993-07-01), Taylor et al.
patent: 5263163 (1993-11-01), Holt et al.
patent: 5333319 (1994-07-01), Silen
patent: 5339443 (1994-08-01), Lockwood
patent: 5379434 (1995-01-01), DiBrino
patent: 5564052 (1996-10-01), Nguyen et al.
patent: 5588111 (1996-12-01), Cutts et al.
patent: 5636363 (1997-06-01), Bourekas et al.
patent: 5636364 (1997-06-01), Emma et al.
patent: 5699551 (1997-12-01), Taylor et al.
patent: 5809522 (1998-09-01), Novak et al.
patent: 5818464 (1998-10-01), Wade
patent: 5884051 (1999-03-01), Schaffer et al.
patent: 5940872 (1999-08-01), Hammond et al.
patent: 6006303 (1999-12-01), Barnaby et al.
patent: 6029000 (2000-02-01), Woolsey et al.
patent: 6092137 (2000-07-01), Huang et al.
patent: 6199124 (2001-03-01), Ramakrishnan et al.
patent: 6266539 (2001-07-01), Pardo
patent: 6272580 (2001-08-01), Stevens et al.
patent: 6374341 (2002-04-01), Nijhawan et al.
patent: 6430640 (2002-08-01), Lim
patent: 6510479 (2003-01-01), Hao
patent: 6564311 (2003-05-01), Kakeda et al.
patent: 6684280 (2004-01-01), Lasserra et al.
patent: 6721325 (2004-04-01), Duckering et al.
patent: 2002/0065867 (2002-05-01), Chauvel
patent: 2002/0073282 (2002-06-01), Chauvel et al.
patent: 2002/0112106 (2002-08-01), Henehan et al.
patent: 1182538 (2002-02-01), None
patent: 1182551 (2002-02-01), None
patent: 1182559 (2002-02-01), None
patent: 1213650 (2002-06-01), None

Affiliated with

Also associated with

Rating

Priority arbitration based on current task and MMU does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Priority arbitration based on current task and MMU, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Priority arbitration based on current task and MMU will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3653829