Sciweavers

5553 search results - page 314 / 1111
» Parallel Implementation of Sch
Sort
View
IPPS
1999
IEEE
15 years 8 months ago
Application Performance of a Linux Cluster Using Converse
Abstract. Clusters of PCs are an attractive platform for parallel applications because of their cost effectiveness. We have implemented an interoperable runtime system called Conve...
Laxmikant V. Kalé, Robert Brunner, James C....
JPDC
2006
134views more  JPDC 2006»
15 years 4 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong
CONCUR
2012
Springer
13 years 7 months ago
Avoiding Shared Clocks in Networks of Timed Automata
Networks of timed automata (NTA) are widely used to model distributed real-time systems. Quite often in the literature, the automata are allowed to share clocks. This is a problem ...
Sandie Balaguer, Thomas Chatain
DEBS
2010
ACM
15 years 8 months ago
Evaluation of streaming aggregation on parallel hardware architectures
We present a case study parallelizing streaming aggregation on three different parallel hardware architectures. Aggregation is a performance-critical operation for data summarizat...
Scott Schneider, Henrique Andrade, Bugra Gedik, Ku...
CCGRID
2007
IEEE
15 years 11 months ago
Revisit of View-Oriented Parallel Programming
Traditional parallel programming styles have many problems which hinder the development of parallel applications. The message passing style can be too complex for many programmers...
Z. Huang, W. Chen