Sciweavers

32 search results - page 3 / 7
» Efficient System-Enforced Deterministic Parallelism
Sort
View
IPPS
1999
IEEE
13 years 10 months ago
Reducing I/O Complexity by Simulating Coarse Grained Parallel Algorithms
Block-wise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is fully par...
Frank K. H. A. Dehne, David A. Hutchinson, Anil Ma...
LICS
1994
IEEE
13 years 10 months ago
On the Parallel Complexity of Model Checking in the Modal Mu-Calculus
The modal mu-calculus is an expressive logic that can be used to specify safety and liveness properties of concurrent systems represented as labeled transition systems (LTSs). We ...
Shipei Zhang, Oleg Sokolsky, Scott A. Smolka
SIPS
2008
IEEE
14 years 20 days ago
Efficient mapping of advanced signal processing algorithms on multi-processor architectures
Modern microprocessor technology is migrating from simply increasing clock speeds on a single processor to placing multiple processors on a die to increase throughput and power pe...
Bhavana B. Manjunath, Aaron S. Williams, Chaitali ...
IPPS
1998
IEEE
13 years 10 months ago
An Efficient Counting Network
Counting networks were introduced as a new class of concurrent, distributed, low contention data structures suitable for implementing shared counters. Their structure is similar t...
Costas Busch, Marios Mavronicolas
DCOSS
2007
Springer
13 years 10 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