Sciweavers

405 search results - page 40 / 81
» A Parallel Priority Data Structure with Applications
Sort
View
SC
2005
ACM
15 years 8 months ago
A Scalable Distributed Parallel Breadth-First Search Algorithm on BlueGene/L
Many emerging large-scale data science applications require searching large graphs distributed across multiple memories and processors. This paper presents a distributed breadth...
Andy Yoo, Edmond Chow, Keith W. Henderson, Will Mc...
SKG
2006
IEEE
15 years 9 months ago
Using Ontologies to Support Customisation and Maintain Interoperability in Distributed Information Systems with Application to t
Abstract. Global distributed systems must be standards-based to allow interoperability between all of their components. While this guarantees interoperability, it often causes loca...
Nickolas J. G. Falkner, Paul D. Coddington, Andrew...
SPAA
2010
ACM
15 years 8 months ago
Implementing and evaluating nested parallel transactions in software transactional memory
Transactional Memory (TM) is a promising technique that simplifies parallel programming for shared-memory applications. To date, most TM systems have been designed to efficientl...
Woongki Baek, Nathan Grasso Bronson, Christos Kozy...
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
15 years 7 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
ICCS
2007
Springer
15 years 9 months ago
Automatic Memory Access Analysis with Periscope
Periscope is a distributed automatic online performance analysis system for large scale parallel systems. It consists of a set of analysis agents distributed on the parallel machin...
Michael Gerndt, Edmond Kereku