Sciweavers

432 search results - page 30 / 87
» Internally deterministic parallel algorithms can be fast
Sort
View
131
Voted
IPPS
2010
IEEE
14 years 11 months ago
Inter-block GPU communication via fast barrier synchronization
The graphics processing unit (GPU) has evolved from a fixedfunction processor with programmable stages to a programmable processor with many fixed-function components that deliver...
Shucai Xiao, Wu-chun Feng
IFIP
2004
Springer
15 years 7 months ago
The Inherent Queuing Delay of Parallel Packet Switches
The parallel packet switch (PPS) extends the inverse multiplexing architecture, and is extensively used as the core of contemporary commercial switches. A key factor in the perfor...
Hagit Attiya, David Hay
119
Voted
SC
2003
ACM
15 years 7 months ago
A Million-Fold Speed Improvement in Genomic Repeats Detection
This paper presents a novel, parallel algorithm for generating top alignments. Top alignments are used for finding internal repeats in biological sequences like proteins and gene...
John W. Romein, Jaap Heringa, Henri E. Bal
SIGSOFT
2006
ACM
16 years 2 months ago
Dynamic slicing long running programs through execution fast forwarding
Fixing runtime bugs in long running programs using trace based analyses such as dynamic slicing was believed to be prohibitively expensive. In this paper, we present a novel execu...
Xiangyu Zhang, Sriraman Tallam, Rajiv Gupta
STOC
2003
ACM
126views Algorithms» more  STOC 2003»
16 years 2 months ago
A new approach to dynamic all pairs shortest paths
We study novel combinatorial properties of graphs that allow us to devise a completely new approach to dynamic all pairs shortest paths problems. Our approach yields a fully dynam...
Camil Demetrescu, Giuseppe F. Italiano