Sciweavers

314 search results - page 14 / 63
» Reducing Parallel Overheads Through Dynamic Serialization
Sort
View
ICDCS
1997
IEEE
13 years 11 months ago
Supporting Dynamic Space-sharing on Clusters of Non-dedicated Workstations
Clusters of workstations are increasingly being viewed as a cost-e ective alternative to parallel supercomputers. However, resource management and scheduling on workstations clust...
Abdur Chowdhury, Lisa D. Nicklas, Sanjeev Setia, E...
PPOPP
2010
ACM
14 years 4 months ago
Using data structure knowledge for efficient lock generation and strong atomicity
To achieve high-performance on multicore systems, sharedmemory parallel languages must efficiently implement atomic operations. The commonly used and studied paradigms for atomici...
Gautam Upadhyaya, Samuel P. Midkiff, Vijay S. Pai
PPOPP
2010
ACM
14 years 4 months ago
Lazy binary-splitting: a run-time adaptive work-stealing scheduler
We present Lazy Binary Splitting (LBS), a user-level scheduler of nested parallelism for shared-memory multiprocessors that builds on existing Eager Binary Splitting work-stealing...
Alexandros Tzannes, George C. Caragea, Rajeev Baru...
ICPADS
2005
IEEE
14 years 1 months ago
Routing through Backbone Structures in Sensor Networks
Virtual infrastructures or backbones in wireless sensor networks reduce the communication overhead and energy consumption. In this paper, we present BackBone Routing (BBR), a nove...
Vamsi Paruchuri, Arjan Durresi, Mimoza Durresi, Le...
GECCO
2007
Springer
178views Optimization» more  GECCO 2007»
14 years 1 months ago
Discussion of parallel model of multi-objective genetic algorithms on heterogeneous computational resources
— In this paper, a parallel model of multi-objective genetic algorithm supposing a grid environment is discussed. In this proposed parallel model, we extended master-slave model ...
Tomoyuki Hiroyasu, Kengo Yoshii, Mitsunori Miki