Sciweavers

2438 search results - page 362 / 488
» Scheduling problems for parallel and distributed systems
Sort
View
PDIS
1993
IEEE
15 years 9 months ago
The Kendall Square Query Decomposer
d Abstract:: ACM SIGMOD Record 22 (4), Dec. 1993) RM93 Rahm, E., Marek, R.: Analysis of Dynamic Load Balancing Strategies for Parallel Shared Nothing Database Systems. Proc 19th VL...
David S. Reiner
WOMPAT
2001
Springer
15 years 9 months ago
CableS : Thread Control and Memory System Extensions for Shared Virtual Memory Clusters
Clusters of high-end workstations and PCs are currently used in many application domains to perform large-scale computations or as scalable servers for I/O bound tasks. Although cl...
Peter Jamieson, Angelos Bilas
IEEEPACT
2005
IEEE
15 years 10 months ago
HUNTing the Overlap
Hiding communication latency is an important optimization for parallel programs. Programmers or compilers achieve this by using non-blocking communication primitives and overlappi...
Costin Iancu, Parry Husbands, Paul Hargrove
IAT
2003
IEEE
15 years 10 months ago
Problem-solving in open environments
With the increasing use of the internet, many problemsolving tasks such as resource allocation, scheduling, planning, and configuration pose themselves in an open setting involvi...
Santiago Macho-Gonzalez, Boi Faltings
138
Voted
PODS
2004
ACM
128views Database» more  PODS 2004»
16 years 5 months ago
Replicated Declustering of Spatial Data
The problem of disk declustering is to distribute data among multiple disks to reduce query response times through parallel I/O. A strictly optimal declustering technique is one t...
Hakan Ferhatosmanoglu, Aravind Ramachandran, Ali S...