Sciweavers

461 search results - page 66 / 93
» Verifying parallel programs with dynamic communication struc...
Sort
View
ESA
1998
Springer
162views Algorithms» more  ESA 1998»
13 years 11 months ago
External Memory Algorithms
Abstract. Data sets in large applications are often too massive to t completely inside the computer's internal memory. The resulting input output communication or I O between ...
Jeffrey Scott Vitter
TIP
2008
175views more  TIP 2008»
13 years 7 months ago
Algorithmic and Architectural Optimizations for Computationally Efficient Particle Filtering
Abstract--In this paper, we analyze the computational challenges in implementing particle filtering, especially to video sequences. Particle filtering is a technique used for filte...
Aswin C. Sankaranarayanan, Ankur Srivastava, Rama ...
ECOOPW
1994
Springer
13 years 11 months ago
Abstracting Interactions Based on Message Sets
ing Interactions Based on Message Sets Svend Frr 1 and Gul Agha2. 1 Hewlett-Packard Laboratories, 1501 Page Mill Road, Palo Alto, CA 94303 2 University of Illinois, 1304 W. Springf...
Svend Frølund, Gul Agha
CONCUR
2004
Springer
14 years 23 days ago
Session Types for Functional Multithreading
We define a language whose type system, incorporating session types, allows complex protocols to be specified by types and verified by static typechecking. A session type, asso...
Vasco Thudichum Vasconcelos, António Ravara...
ASPLOS
2008
ACM
13 years 9 months ago
Concurrency control with data coloring
Concurrency control is one of the main sources of error and complexity in shared memory parallel programming. While there are several techniques to handle concurrency control such...
Luis Ceze, Christoph von Praun, Calin Cascaval, Pa...