Sciweavers

1263 search results - page 172 / 253
» An Object-Passing Model for Parallel Programming
Sort
View
116
Voted
CONCUR
2006
Springer
15 years 7 months ago
Proving Liveness by Backwards Reachability
Abstract. We present a new method for proving liveness and termination properties for fair concurrent programs, which does not rely on finding a ranking function or on computing th...
Parosh Aziz Abdulla, Bengt Jonsson, Ahmed Rezine, ...
CP
2006
Springer
15 years 7 months ago
Distributed Constraint-Based Local Search
Distributed computing is increasingly important at a time when the doubling of the number of transistors on a processor every 18 months no longer translates in a doubling of speed ...
Laurent Michel, Andrew See, Pascal Van Hentenryck
GRID
2006
Springer
15 years 3 months ago
Simultaneous Scheduling of Replication and Computation for Data-Intensive Applications on the Grid
One of the first motivations of using grids comes from applications managing large data sets in field such as high energy physics or life sciences. To improve the global throughput...
Frederic Desprez, Antoine Vernois
SIGMOD
2007
ACM
190views Database» more  SIGMOD 2007»
16 years 3 months ago
Map-reduce-merge: simplified relational data processing on large clusters
Map-Reduce is a programming model that enables easy development of scalable parallel applications to process vast amounts of data on large clusters of commodity machines. Through ...
Hung-chih Yang, Ali Dasdan, Ruey-Lung Hsiao, Dougl...
159
Voted
APPT
2003
Springer
15 years 8 months ago
Optimal Broadcast Channel for Data Dissemination in Mobile Database Environment
The increase number of mobile users in wireless environment affects query access time substantially. To minimise the query access time, one possible way is to employ data broadcast...
Agustinus Borgy Waluyo, Bala Srinivasan, David Tan...