Sciweavers

2438 search results - page 151 / 488
» Scheduling problems for parallel and distributed systems
Sort
View
IPPS
1999
IEEE
15 years 9 months ago
Oblivious Deadlock-Free Routing in a Faulty Hypercube
A central problem in massively parallel computing is efficiently routing data between processors. This problem is complicated by two considerations. First, in any massively parall...
Jin Suk Kim, Eric Lehman, Frank Thomson Leighton
DMSN
2009
ACM
15 years 11 months ago
Quality aware query scheduling in wireless sensor networks
We study query scheduling in Wireless Sensor Networks (WSNs) with a focus on two important metrics: Quality of Service (QoS) and Quality of Data (QoD). The motivation comes from o...
Hejun Wu, Qiong Luo, Jianjun Li, Alexandros Labrin...
HPDC
2003
IEEE
15 years 10 months ago
Trace-Based Simulations of Processor Co-Allocation Policies in Multiclusters
In systems consisting of multiple clusters of processors which employ space sharing for scheduling jobs, such as our Distributed ASCI1 Supercomputer (DAS), coallocation, i.e., the...
Anca I. D. Bucur, Dick H. J. Epema
IPPS
2007
IEEE
15 years 11 months ago
A WSRF-Compliant Debugger for Grid Applications
Grid computing allows the utilization of vast computational resources for solving complex scientific and engineering problems. However, development tools for Grid applications are...
Donny Kurniawan, David Abramson
NPC
2010
Springer
15 years 3 months ago
Distributed Stream Processing with DUP
This paper introduces the DUP System, a simple framework for parallel stream processing. The DUP System enables developers to compose applications from stages written in almost any...
Kai Christian Bader, Tilo Eißler, Nathan S. ...