Sciweavers

1007 search results - page 4 / 202
» Worst-Case Optimal Algorithms for Parallel Query Processing
Sort
View
JPDC
2006
85views more  JPDC 2006»
13 years 6 months ago
Provable algorithms for parallel generalized sweep scheduling
We present provably efficient parallel algorithms for sweep scheduling, which is a commonly used technique in Radiation Transport problems, and involves inverting an operator by i...
V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Pa...
IPPS
2000
IEEE
13 years 10 months ago
Optimal on Demand Packet Scheduling in Single-Hop Multichannel Communication Systems
In this paper, we study the problem of on demand minimum length packet scheduling in single-hop multichannel systems. Examples of these systems are those centered around switching...
Maurizio A. Bonuccelli, Susanna Pelagatti
PARELEC
2002
IEEE
13 years 11 months ago
Real-Time Scheduling in Distributed Systems
In this paper, we investigate the worst case performance of Earliest Due Date algorithm when applied to packet scheduling in distributed systems. We assume that the processing ele...
Nguyen Duc Thai
ICDE
2008
IEEE
147views Database» more  ICDE 2008»
14 years 7 months ago
Flow Algorithms for Parallel Query Optimization
In this paper we address the problem of minimizing the response time of a multi-way join query using pipelined (inter-operator) parallelism, in a parallel or a distributed environ...
Amol Deshpande, Lisa Hellerstein
ISQED
2007
IEEE
152views Hardware» more  ISQED 2007»
14 years 9 days ago
Variation Aware Timing Based Placement Using Fuzzy Programming
In nanometer regime, the effects of variations are having an increasing impact on the delay and power characteristics of devices as well as the yield of the circuit. Statistical t...
Venkataraman Mahalingam, N. Ranganathan