4208 search results - page 94 / 842 » Challenges in Evaluating Distributed Algorithms |
IPPS
2009
IEEE
15 years 4 months 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....
PPSN
2004
Springer
15 years 3 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 ...
IPPS
2006
IEEE
15 years 4 months 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...
PERCOM
2003
ACM
15 years 9 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...
HIPC
2007
Springer
15 years 4 months 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...