4208 search results - page 94 / 842 » Challenges in Evaluating Distributed Algorithms |
149
click to vote
IPPS
2009
IEEE
16 years 28 days ago
2009
IEEE
In this paper we use Dijkstra’s algorithm as a challenging, hard to parallelize paradigm to test the efficacy of several parallelization techniques in a multicore architecture....
177
click to vote
PPSN
2004
Springer
15 years 11 months ago
2004
Springer
This paper introduces a new evaluation function, called δ, for the Bandwidth Minimization Problem for Graphs (BMPG). Compared with the classical β evaluation function used, our ...
167
click to vote
IPPS
2006
IEEE
16 years 9 days ago
2006
IEEE
Efficient multisite job scheduling facilitates the cooperation of multi-domain massively parallel processor systems in a computing grid environment. However, co-allocation, hetero...
176
click to vote
PERCOM
2003
ACM
16 years 5 months ago
2003
ACM
Time information is critical for a variety of applications in distributed environments that facilitate pervasive computing and communication. This work describes and evaluates a no...
190
click to vote
HIPC
2007
Springer
16 years 13 days ago
2007
Springer
Abstract. Large graphs involving millions of vertices are common in many practical applications and are challenging to process. Practical-time implementations using high-end comput...