Sciweavers

278 search results - page 41 / 56
» Parallel Load Balancing for Problems with Good Bisectors
Sort
View
PDPTA
2010
13 years 5 months ago
Distributed Mobile Computing: Development of Distributed Applications Using Mobile Agents
There exist distributed scenarios in which the need for dynamism, mobility, and adaptivity, has to be addressed with highly dynamical approaches. These scenarios present different ...
Carlos Bobed, Sergio Ilarri, Eduardo Mena
CONCURRENCY
2000
123views more  CONCURRENCY 2000»
13 years 7 months ago
A mobile agent based push methodology for global parallel computing
The 1990s are seeing the explosive growth of the Internet and Web-based information sharing and dissemination systems. The Internet is also showing a potential of forming of a sup...
Cheng-Zhong Xu, Brian Wims
EPEW
2005
Springer
14 years 1 months ago
Hypergraph Partitioning for Faster Parallel PageRank Computation
The PageRank algorithm is used by search engines such as Google to order web pages. It uses an iterative numerical method to compute the maximal eigenvector of a transition matrix ...
Jeremy T. Bradley, Douglas V. de Jager, William J....
CF
2009
ACM
14 years 2 months ago
Scheduling dynamic parallelism on accelerators
Resource management on accelerator based systems is complicated by the disjoint nature of the main CPU and accelerator, which involves separate memory hierarhcies, different degr...
Filip Blagojevic, Costin Iancu, Katherine A. Yelic...
PPOPP
2009
ACM
14 years 8 months ago
Idempotent work stealing
Load balancing is a technique which allows efficient parallelization of irregular workloads, and a key component of many applications and parallelizing runtimes. Work-stealing is ...
Maged M. Michael, Martin T. Vechev, Vijay A. Saras...