Sciweavers

5448 search results - page 571 / 1090
» Breakpoints and Time in Distributed Computations
Sort
View
ICPP
1992
IEEE
15 years 11 months ago
Adaptive Binary Sorting Schemes and Associated Interconnection Networks
Many routing problems in parallel processing, such as concentration and permutation problems, can be cast as sorting problems. In this paper, we consider the problem of sorting on ...
Minze V. Chien, A. Yavuz Oruç
CONCUR
2007
Springer
15 years 11 months ago
Temporal Antecedent Failure: Refining Vacuity
We re-examine vacuity in temporal logic model checking. We note two disturbing phenomena in recent results in this area. The first indicates that not all vacuities detected in prac...
Shoham Ben-David, Dana Fisman, Sitvanit Ruah
EUROPAR
2007
Springer
15 years 11 months ago
Increasing Parallelism for Workflows in the Grid
Workflow applications executed in Grid environments are not able to take advantage of all the potential parallelism they might have. This limitation in the usage of parallelism com...
Jonathan Martí, Jesus Malo, Toni Cortes
EUROPAR
2004
Springer
15 years 10 months ago
Efficient Parallel Hierarchical Clustering
Hierarchical agglomerative clustering (HAC) is a common clustering method that outputs a dendrogram showing all N levels of agglomerations where N is the number of objects in the d...
Manoranjan Dash, Simona Petrutiu, Peter Scheuerman...
COORDINATION
2000
Springer
15 years 10 months ago
OpenSpaces: An Object-Oriented Framework for Reconfigurable Coordination Spaces
Abstract. Tuple spaces have turned out to be one of the most fundamental abstractions for coordinating communicating agents. At the same time, researchers continue to propose new v...
Stéphane Ducasse, Thomas Hofmann, Oscar Nie...