Sciweavers

3656 search results - page 263 / 732
» Parallel programming in Split-C
Sort
View
MPC
1995
Springer
150views Mathematics» more  MPC 1995»
15 years 10 months ago
Architecture Independent Massive Parallelization of Divide-and-Conquer Algorithms
Abstract. We present a strategy to develop, in a functional setting, correct, e cient and portable Divide-and-Conquer (DC) programs for massively parallel architectures. Starting f...
Klaus Achatz, Wolfram Schulte
PSLS
1995
15 years 10 months ago
Lazy Remote Procedure Call and its Implementation in a Parallel Variant of C
Abstract. Lazy task creation (LTC) is an e cient approach for executing divide and conquer parallel programs that has been used in the implementation of Multilisp's future con...
Marc Feeley
IPPS
2007
IEEE
16 years 27 days ago
Optimizing Inter-Nest Data Locality Using Loop Splitting and Reordering
With the increasing gap between processor speed and memory latency, the performance of data-dominated programs are becoming more reliant on fast data access, which can be improved...
Sofiane Naci
IPPS
2006
IEEE
16 years 19 days ago
A code motion technique for accelerating general-purpose computation on the GPU
Recently, graphics processing units (GPUs) are providing increasingly higher performance with programmable internal processors, namely vertex processors (VPs) and fragment process...
T. Ikeda, Fumihiko Ino, Kenichi Hagihara
PPOPP
2005
ACM
16 years 5 days ago
Scaling model checking of dataraces using dynamic information
Dataraces in multithreaded programs often indicate severe bugs and can cause unexpected behaviors when different thread interleavings are executed. Because dataraces are a cause f...
Ohad Shacham, Mooly Sagiv, Assaf Schuster