Allocating application to group of consecutive processors in fault-tolerant deadlock-free routing path defined by routers obeying same rules for path selection
Abstract
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.
- Inventors:
-
- Albuquerque, NM
- East Northport, NY
- Urbana, IL
- Issue Date:
- Research Org.:
- Sandia National Laboratories (SNL), Albuquerque, NM, and Livermore, CA (United States)
- Sponsoring Org.:
- USDOE
- OSTI Identifier:
- 1012604
- Patent Number(s):
- 7565657
- Application Number:
- 11/110,206
- Assignee:
- Sandia Corporation (Albuquerque, NM)
- Patent Classifications (CPCs):
-
G - PHYSICS G06 - COMPUTING G06F - ELECTRIC DIGITAL DATA PROCESSING
- DOE Contract Number:
- AC04-94AL85000
- Resource Type:
- Patent
- Country of Publication:
- United States
- Language:
- English
- Subject:
- 97 MATHEMATICS AND COMPUTING
Citation Formats
Leung, Vitus J, Phillips, Cynthia A, Bender, Michael A, and 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. United States: N. p., 2009.
Web.
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. United States.
Leung, Vitus J, Phillips, Cynthia A, Bender, Michael A, and Bunde, David P. Tue .
"Allocating application to group of consecutive processors in fault-tolerant deadlock-free routing path defined by routers obeying same rules for path selection". United States. https://www.osti.gov/servlets/purl/1012604.
@article{osti_1012604,
title = {Allocating application to group of consecutive processors in fault-tolerant deadlock-free routing path defined by routers obeying same rules for path selection},
author = {Leung, Vitus J and Phillips, Cynthia A and Bender, Michael A and Bunde, David P},
abstractNote = {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.},
doi = {},
journal = {},
number = ,
volume = ,
place = {United States},
year = {Tue Jul 21 00:00:00 EDT 2009},
month = {Tue Jul 21 00:00:00 EDT 2009}
}
Save to My Library
You must Sign In or Create an Account in order to save documents to your library.
Works referenced in this record:
Noncontiguous processor allocation algorithms for mesh-connected multicomputers
journal, July 1997
- Lo, V.; Windisch, K. J.
- IEEE Transactions on Parallel and Distributed Systems, Vol. 8, Issue 7
Algorithmic support for commodity-based parallel computing systems.
report, October 2003
- Leung, Vitusn Joseph; Bender, Michael A.; Bunde, David P.
Communication patterns and allocation strategies
conference, January 2004
- Bunde, D. P.; Leung, V. J.; Mache, J.
- 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings.
Processor allocation on Cplant: achieving general processor locality using one-dimensional allocation strategies
conference, January 2002
- Leung, V. J.; Arkin, E. M.; Bender, Ma.
- 2002 IEEE International Conference on Cluster Computing, Proceedings. IEEE International Conference on Cluster Computing
Contention-free 2D-mesh cluster allocation in hypercubes
journal, January 1995
- Turner, S. W.; Ni, L. M.; Cheng, B. H. C.
- IEEE Transactions on Computers, Vol. 44, Issue 8
Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
journal, May 1987
- Dally,
- IEEE Transactions on Computers, Vol. C-36, Issue 5