Sciweavers

266 search results - page 15 / 54
» Can Saturation Be Parallelised
Sort
View
ICPP
2003
IEEE
14 years 20 days ago
Scheduling Algorithms with Bus Bandwidth Considerations for SMPs
The bus that connects processors to memory is known to be a major architectural bottleneck in SMPs. However, both software and scheduling policies for these systems generally focu...
Christos D. Antonopoulos, Dimitrios S. Nikolopoulo...
CVPR
2005
IEEE
14 years 9 months ago
Why I Want a Gradient Camera
We propose a camera that measures static gradients instead of static intensities. Quantizing sensed intensity differences between adjacent pixel values permits an ordinary A/D con...
Jack Tumblin, Amit K. Agrawal, Ramesh Raskar
DAC
2008
ACM
14 years 8 months ago
A reconfigurable routing algorithm for a fault-tolerant 2D-Mesh Network-on-Chip
In this paper we present a reconfigurable routing algorithm for a 2D-Mesh Network-on-Chip (NoC) dedicated to faulttolerant, Massively Parallel Multi-Processors Systems on Chip (MP...
Zhen Zhang, Alain Greiner, Sami Taktak
INFOCOM
2007
IEEE
14 years 1 months ago
Service Time Approximation in IEEE 802.11 Single-Hop Ad-hoc Networks
Abstract— This paper investigates the near-memoryless behavior of the service time for IEEE 802.11 saturated single-hop ad hoc networks. We show that the number of packets succes...
Atef Abdrabou, Weihua Zhuang
CP
1997
Springer
13 years 11 months ago
Programming Constraint Inference Engines
Abstract. Existing constraint programming systems offer a fixed set of inference engines implementing search strategies such as single, all, and best solution search. This is unfo...
Christian Schulte