Sciweavers

432 search results - page 65 / 87
» Internally deterministic parallel algorithms can be fast
Sort
View
SPAA
2009
ACM
15 years 10 months ago
Speed scaling of processes with arbitrary speedup curves on a multiprocessor
We consider the setting of a multiprocessor where the speeds of the m processors can be individually scaled. Jobs arrive over time and have varying degrees of parallelizability. A...
Ho-Leung Chan, Jeff Edmonds, Kirk Pruhs
DEBU
2010
128views more  DEBU 2010»
14 years 6 months ago
Designing Database Operators for Flash-enabled Memory Hierarchies
Flash memory affects not only storage options but also query processing. In this paper, we analyze the use of flash memory for database query processing, including algorithms that...
Goetz Graefe, Stavros Harizopoulos, Harumi A. Kuno...
CCGRID
2010
IEEE
14 years 7 months ago
Dynamic Load-Balanced Multicast for Data-Intensive Applications on Clouds
Data-intensive parallel applications on clouds need to deploy large data sets from the cloud's storage facility to all compute nodes as fast as possible. Many multicast algori...
Tatsuhiro Chiba, Mathijs den Burger, Thilo Kielman...
ICAI
2003
14 years 11 months ago
A Quantitative Model of Capabilities in Multi-Agent Systems
Reasoning about capabilities in multi-agent systems is crucial for many applications. There are two aspects of reasoning about the capabilities of an agent to achieve its goals. O...
Linli He, Thomas R. Ioerger
ICDCS
2003
IEEE
15 years 2 months ago
Optimal Distribution Tree for Internet Streaming Media
Internet radio and television stations require significant bandwidth to support delivery of high quality audio and video streams to a large number of receivers. IP multicast is a...
Min Sik Kim, Simon S. Lam, Dong-Young Lee