Allocating application to group of consecutive processors in fault-tolerant deadlock-free routing path defined by routers obeying same rules for path selection

Leung, Vitus J; Phillips, Cynthia A; Bender, Michael A; Bunde, David P

Allocating application to group of consecutive processors in fault-tolerant deadlock-free routing path defined by routers obeying same rules for path selection

Patent · Tue Jul 21 00:00:00 EDT 2009

OSTI ID:1012604

Leung, Vitus J ^[1]; Phillips, Cynthia A ^[1]; Bender, Michael A ^[2]; Bunde, David P ^[3]

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 Corporation

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

References (6)

Processor allocation on Cplant: achieving general processor locality using one-dimensional allocation strategies Leung, V. J.; Arkin, E. M.; Bender, Ma. 2002 IEEE International Conference on Cluster Computing, Proceedings. IEEE International Conference on Cluster Computing https://doi.org/10.1109/CLUSTR.2002.1137758	conference	January 2002
Algorithmic support for commodity-based parallel computing systems. Leung, Vitusn Joseph; Bender, Michael A.; Bunde, David P. https://doi.org/10.2172/918344	report	October 2003
Deadlock-Free Message Routing in Multiprocessor Interconnection Networks No authors listed IEEE Transactions on Computers, Vol. C-36, Issue 5 https://doi.org/10.1109/TC.1987.1676939	journal	May 1987
Noncontiguous processor allocation algorithms for mesh-connected multicomputers Lo, V.; Windisch, K. J. IEEE Transactions on Parallel and Distributed Systems, Vol. 8, Issue 7 https://doi.org/10.1109/71.598346	journal	July 1997
Contention-free 2D-mesh cluster allocation in hypercubes Turner, S. W.; Ni, L. M.; Cheng, B. H. C. IEEE Transactions on Computers, Vol. 44, Issue 8 https://doi.org/10.1109/12.403722	journal	January 1995
Communication patterns and allocation strategies Bunde, D. P.; Leung, V. J.; Mache, J. 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings. https://doi.org/10.1109/IPDPS.2004.1303307	conference	January 2004

Similar Records

Deadlock prevention in processor self-scheduling for parallel nested loops

Conference · Wed Dec 31 23:00:00 EST 1986 · OSTI ID:5768508

A Model for Deadlock-Free Resource Allocation [Thesis]

Technical Report · Thu Jun 01 00:00:00 EDT 1972 · OSTI ID:4658796

Deadlock-free message routing in multiprocessor interconnection networks

Journal Article · Fri May 01 00:00:00 EDT 1987 · IEEE Trans. Comput.; (United States) · OSTI ID:6778475

Related Subjects

97 MATHEMATICS AND COMPUTING

Allocating application to group of consecutive processors in fault-tolerant deadlock-free routing path defined by routers obeying same rules for path selection

Citation Formats

References (6)

Similar Records

Related Subjects