Sciweavers

6437 search results - page 530 / 1288
» Parallel Algorithms for Arrangements
Sort
View
EUROPAR
2009
Springer
16 years 1 months ago
A Lower Bound for Oblivious Dimensional Routing
In this work we consider deterministic oblivious dimensional routing algorithms on d-dimensional meshes. In oblivious dimensional routing algorithms the path of a packet depends o...
Andre Osterloh
172
Voted
EUROPAR
2007
Springer
16 years 26 days ago
A Scheduling Toolkit for Multiprocessor-Task Programming with Dependencies
The performance of many scientific applications for distributed memory platforms can be increased by utilizing multiprocessor-task programming. To obtain the minimum parallel runt...
Jörg Dümmler, Raphael Kunis, Gudula R&uu...
FPL
2007
Springer
94views Hardware» more  FPL 2007»
16 years 26 days ago
A Many-core Implementation based on the Reconfigurable Mesh Model
The reconfigurable mesh is a model for massively parallel computing for which many algorithms with very low complexity have been developed. These algorithms execute cycles of bus...
Heiner Giefers, Marco Platzner
IPPS
2006
IEEE
16 years 22 days ago
Analytical performance modelling of partially adaptive routing in wormhole hypercubes
Although several analytical models have been proposed in the literature for different interconnection networks with different routing algorithms, there is only one work dealing wi...
Ahmad Patooghy, Hamid Sarbazi-Azad
PODC
2006
ACM
16 years 20 days ago
Timeliness, failure-detectors, and consensus performance
We study the implication that various timeliness and failure detector assumptions have on the performance of consensus algorithms that exploit them. We present a general framework...
Idit Keidar, Alexander Shraer