Sciweavers

156 search results - page 23 / 32
» Experiments in Load Migration and Dynamic Load Balancing in ...
Sort
View
IPPS
2007
IEEE
15 years 3 months ago
A Grid-enabled Branch and Bound Algorithm for Solving Challenging Combinatorial Optimization Problems
Solving optimally large instances of combinatorial optimization problems requires a huge amount of computational resources. In this paper, we propose an adaptation of the parallel...
Mohand-Said Mezmaz, Nouredine Melab, El-Ghazali Ta...
LFP
1990
73views more  LFP 1990»
14 years 10 months ago
Lazy Task Creation: A Technique for Increasing the Granularity of Parallel Programs
Many parallel algorithms are naturally expressed at a ne level of granularity, often ner than a MIMD parallel system can exploit eciently. Most builders of parallel systems have...
Eric Mohr, David A. Kranz, Robert H. Halstead Jr.
SSDBM
2005
IEEE
132views Database» more  SSDBM 2005»
15 years 3 months ago
Co-Scheduling of Computation and Data on Computer Clusters
Scientific investigations have to deal with rapidly growing amounts of data from simulations and experiments. During data analysis, scientists typically want to extract subsets o...
Alexandru Romosan, Doron Rotem, Arie Shoshani, Der...
ISCC
2003
IEEE
138views Communications» more  ISCC 2003»
15 years 2 months ago
Connectivity Aware Routing - a Method for Finding Bandwidth Constrained Paths Over a Variety of Network Topologies
Multimedia traffic and real-time e-commerce applications can experience quality degradation in traditional networks such as the Internet. These difficulties can be overcome in n...
Karol Kowalik, Martin Collier
GRID
2003
Springer
15 years 2 months ago
Enabling the Co-Allocation of Grid Data Transfers
Data-sharing scientific communities use storage systems as distributed data stores by replicating content. In such highly replicated environments, a particular dataset can reside ...
Sudharshan Vazhkudai