Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
2
search results - page 1 / 1
»
Application-aware deadlock-free oblivious routing
Sort
relevance
views
votes
recent
update
View
thumb
title
28
click to vote
IPPS
1999
IEEE
129
views
Distributed And Parallel Com...
»
more
IPPS 1999
»
Oblivious Deadlock-Free Routing in a Faulty Hypercube
14 years 1 months ago
Download
ipdps.cc.gatech.edu
A central problem in massively parallel computing is efficiently routing data between processors. This problem is complicated by two considerations. First, in any massively parall...
Jin Suk Kim, Eric Lehman, Frank Thomson Leighton
claim paper
Read More »
24
click to vote
SPAA
1997
ACM
130
views
Distributed And Parallel Com...
»
more
SPAA 1997
»
Deadlock-Free Oblivious Wormhole Routing with Cyclic Dependencies
14 years 1 months ago
Download
www.cs.wayne.edu
Loren Schwiebert
claim paper
Read More »
« Prev
« First
page 1 / 1
Last »
Next »