Sciweavers

488 search results - page 48 / 98
» Using shared arrays in message-driven parallel programs
Sort
View
PPL
2007
86views more  PPL 2007»
13 years 8 months ago
Failure-Sensitive Analysis of Parallel Algorithms with Controlled Memory Access Concurrency
ract problem of using P failure-prone processors to cooperatively update all locations of an N-element shared array is called Write-All. Solutions to Write-All can be used iterati...
Chryssis Georgiou, Alexander Russell, Alexander A....
PPOPP
2003
ACM
14 years 1 months ago
Using generative design patterns to generate parallel code for a distributed memory environment
A design pattern is a mechanism for encapsulating the knowledge of experienced designers into a re-usable artifact. Parallel design patterns reflect commonly occurring parallel co...
Kai Tan, Duane Szafron, Jonathan Schaeffer, John A...
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
EUROPAR
1998
Springer
14 years 21 days ago
Analysing an SQL Application with a BSPlib Call-Graph Profiling Tool
This paper illustrates the use of a post-mortem call-graph profiling tool in the analysis of an SQL query processing application written using BSPIib [4]. Unlike other parallel pro...
Jonathan M. D. Hill, Stephen A. Jarvis, Constantin...
ICPADS
2000
IEEE
14 years 1 months ago
A Practical Nonblocking Queue Algorithm Using Compare-and-Swap
Many nonblocking algorithms have been proposed for shared queues. Previous studies indicate that link-based algorithms perform best. However, these algorithms have a memory manage...
Chien-Hua Shann, Ting-Lu Huang, Cheng Chen