Sciweavers

105 search results - page 7 / 21
» Communication-Intensive Parallel Applications and Non-dedica...
Sort
View
PDPTA
2003
14 years 11 months ago
Flexible Approximate String Matching Application on a Heterogeneous Distributed Environment
In this paper, we present three parallel flexible approximate string matching methods on a parallel architecture with heterogeneous workstations to gain supercomputer power at lo...
Panagiotis D. Michailidis, Konstantinos G. Margari...
SIGMETRICS
1998
ACM
14 years 9 months ago
Scheduling with Implicit Information in Distributed Systems
Implicitcoscheduling is a distributed algorithm fortime-sharing communicating processes in a cluster of workstations. By observing and reacting to implicit information, local sche...
Andrea C. Arpaci-Dusseau, David E. Culler, Alan M....
HPDC
2006
IEEE
15 years 3 months ago
WOW: Self-Organizing Wide Area Overlay Networks of Virtual Workstations
— This paper describes WOW, a distributed system that combines virtual machine, overlay networking and peerto-peer techniques to create scalable wide-area networks of virtual wor...
Arijit Ganguly, Abhishek Agrawal, P. Oscar Boykin,...
IPPS
1998
IEEE
15 years 1 months ago
Optimizing Parallel Applications for Wide-Area Clusters
Recent developments in networking technology cause a growing interest in connecting local-area clusters of workstations over wide-area links, creating multilevel clusters, or meta...
Henri E. Bal, Aske Plaat, Mirjam G. Bakker, Peter ...
DICS
2006
15 years 1 months ago
Fault-Tolerant Parallel Applications with Dynamic Parallel Schedules: A Programmer's Perspective
Dynamic Parallel Schedules (DPS) is a flow graph based framework for developing parallel applications on clusters of workstations. The DPS flow graph execution model enables automa...
Sebastian Gerlach, Basile Schaeli, Roger D. Hersch