Sciweavers

1156 search results - page 146 / 232
» Efficient Barriers for Distributed Shared Memory Computers
Sort
View
PPOPP
2006
ACM
14 years 3 months ago
Fast and transparent recovery for continuous availability of cluster-based servers
Recently there has been renewed interest in building reliable servers that support continuous application operation. Besides maintaining system state consistent after a failure, o...
Rosalia Christodoulopoulou, Kaloian Manassiev, Ang...
IPPS
2003
IEEE
14 years 2 months ago
Accurate Method for Fast Design of Diagnostic Oligonucleotide Probe Sets for DNA Microarrays
We present a method for the automatic generation of oligonucleotide probe sets for DNA microarrays. This approach is well suited particularly for specificity evaluation of design...
Andreas Krause, Markus Kräutner, Harald Meier
HPCA
1998
IEEE
14 years 1 months ago
Using Multicast and Multithreading to Reduce Communication in Software DSM Systems
This paper examines the performance benefits of employing multicast communication and application-level multithreading in the Brazos software distributed shared memory (DSM) syste...
Evan Speight, John K. Bennett
TPDS
1998
98views more  TPDS 1998»
13 years 8 months ago
A Basic-Cycle Calculation Technique for Efficient Dynamic Data Redistribution
—Array redistribution is usually required to enhance algorithm performance in many parallel programs on distributed memory multicomputers. Since it is performed at run-time, ther...
Yeh-Ching Chung, Ching-Hsien Hsu, Sheng-Wen Bai
VLDB
2007
ACM
130views Database» more  VLDB 2007»
14 years 9 months ago
A Simple and Efficient Estimation Method for Stream Expression Cardinalities
Estimating the cardinality (i.e. number of distinct elements) of an arbitrary set expression defined over multiple distributed streams is one of the most fundamental queries of in...
Aiyou Chen, Jin Cao, Tian Bu