ACM Home Page
Please provide us with feedback. Feedback
Supporting sets of arbitrary connections on iWarp through communication context switches
Full text PdfPdf (1.27 MB)
Source ACM Symposium on Parallel Algorithms and Architectures archive
Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures table of contents
Velen, Germany
Pages: 203 - 212  
Year of Publication: 1993
ISBN:0-89791-599-2
Authors
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGARCH: ACM Special Interest Group on Computer Architecture
European Comp Soc : European Computer Society
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 0,   Downloads (12 Months): 8,   Citation Count: 3
Additional Information:

references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/165231.165257
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
BAPRS91
 
BCC+88
BCC+90
 
BS87
 
DS87
 
FSW93
A. Feldmann, T.M. Strickerand T.E. Warfel. Supporting sets of arbitrary connections on iWarp through communication context switches. To appear as Tech. Pep. CMU-CS-93-142, School of Computer Science, Carnegie Mellon University, 1992.
Fel88
 
FLM+92
R. Funke, R. Liiling, B. Monien, E Lticking, and H. Blanke- Bohne. An optimized reconfigurable architecture for transputer networks, in Proc. of 25th Hawaii Int. Conf. on System Sciences (HICSS), 1992.
 
GJ79
Gro89
 
Joh87
C. Johnson. Numerical Solutions of PartiaI Differential Equations by the Finite Element Method. Cambridge University Press, 1987.
 
Ka93
R. Karp et al. The log P model: towards a more realistic model for Parallel Computation, Westcoast Video Conference Lecture Series, January 1993.
LAD+92
 
Len90
 
Lil90
S.L Lillevik. Delta: a 30 gigaflop parallel supercomputer for touchstone. In Northcon. Conference Record, pages 294--304, Oct 1990.
 
LM89
 
LS91
 
NRT87
NSS+88
Nug88
 
SBF+92
E.J. Schwabe, G.E. Blelloch, A. Feldmann, O. Ghattas, J.R. Gilbert, G.L. Miller, D.R. O'Hallaron, J.R. Shewchuk, and S.-H. Teng. A separator-based framework for automated partitioning and mapping of parallel algorithms for numerical solution of PDEs. In Proceedings of the 1992 DAGS/PC Symposium, pages 48-62, June 1992.
 
SL89
 
Sny82
L. Snyder. Introduction to the configurable highly parallel computer. Computer Magazine, 15, Jan 1982.
 
Sny84
L. Snyder. Parallel programming and the poker programming environment. Computer Magazine, 17, July 1984.
 
Str91
Stricker, T.M. Message routing on irregular 2D-meshes and tori. In Proceedings of the Sixth Distributed Memory Computing Conference, April 1991.
Str92
 
UFR92
#5. upfna, #. Vclpcnn, and F. Raglaavan. A theory of worm_#ole routing in parallel computers. In Proceedings of the 33st Annual Sympostum on Foundations of Computer Science, Oct 1992.
 
Val90
ECGS92
 
Viz64
V.G. Vizing. On an estimate of the chromatic class of a iograph. Diskret. Anali=, 3:25-30, 1964.


Collaborative Colleagues:
Anja Feldmann: colleagues
Thomas M. Stricker: colleagues
Thomas E. Warfel: colleagues

Peer to Peer - Readers of this Article have also read: