Sciweavers

1016 search results - page 138 / 204
» Parallelism Constraints
Sort
View
ICS
1994
Tsinghua U.
15 years 6 months ago
Fault-tolerant wormhole routing in tori
Abstract. We present a method to enhance wormhole routing algorithms for deadlock-free fault-tolerant routing in tori. We consider arbitrarily-located faulty blocks and assume only...
Suresh Chalasani, Rajendra V. Boppana
138
Voted
ICDCS
1992
IEEE
15 years 6 months ago
End-to-End Scheduling to Meet Deadlines in Distributed Systems
In a distributed system or communication network tasks may need to be executed on more than one processor. For time-critical tasks, the timing constraints are typically given as e...
Riccardo Bettati, Jane W.-S. Liu
142
Voted
CASES
2007
ACM
15 years 6 months ago
Application driven embedded system design: a face recognition case study
The key to increasing performance without a commensurate increase in power consumption in modern processors lies in increasing both parallelism and core specialization. Core speci...
Karthik Ramani, Al Davis
CCGRID
2007
IEEE
15 years 6 months ago
STORM: An Approach to Database Storage Management in Clustered Storage Environments
Database storage management in clustered storage environments is a manual, time-consuming, and error-prone task. Such management involves regular movement of database objects acro...
Kaushik Dutta, Raju Rangaswami
136
Voted
DCOSS
2007
Springer
15 years 6 months ago
Energy Efficient Intrusion Detection in Camera Sensor Networks
The problem we address in this paper is how to detect an intruder moving through a polygonal space that is equipped with a camera sensor network. We propose a probabilistic sensor ...
Primoz Skraba, Leonidas J. Guibas