Allocating application to group of consecutive processors in fault-tolerant deadlock-free routing path defined by routers obeying same rules for path selection
Patent
·
OSTI ID:1012604
- Albuquerque, NM
- East Northport, NY
- Urbana, IL
In a multiple processor computing apparatus, directional routing restrictions and a logical channel construct permit fault tolerant, deadlock-free routing. Processor allocation can be performed by creating a linear ordering of the processors based on routing rules used for routing communications between the processors. The linear ordering can assume a loop configuration, and bin-packing is applied to this loop configuration. The interconnection of the processors can be conceptualized as a generally rectangular 3-dimensional grid, and the MC allocation algorithm is applied with respect to the 3-dimensional grid.
- Research Organization:
- Sandia National Laboratories (SNL), Albuquerque, NM, and Livermore, CA (United States)
- Sponsoring Organization:
- USDOE
- DOE Contract Number:
- AC04-94AL85000
- Assignee:
- Sandia Corporation (Albuquerque, NM)
- Patent Number(s):
- 7,565,657
- Application Number:
- 11/110,206
- OSTI ID:
- 1012604
- Country of Publication:
- United States
- Language:
- English
Similar Records
Deadlock prevention in processor self-scheduling for parallel nested loops
A Model for Deadlock-Free Resource Allocation [Thesis]
A multiple fault-tolerant processor network architecture for pipeline computing
Conference
·
Thu Jan 01 00:00:00 EST 1987
·
OSTI ID:1012604
+1 more
A Model for Deadlock-Free Resource Allocation [Thesis]
Technical Report
·
Thu Jun 01 00:00:00 EDT 1972
·
OSTI ID:1012604
A multiple fault-tolerant processor network architecture for pipeline computing
Journal Article
·
Tue Nov 01 00:00:00 EST 1988
· IEEE Trans. Comput.; (United States)
·
OSTI ID:1012604