Sciweavers

244 search results - page 43 / 49
» Basic Compiler Algorithms for Parallel Programs
Sort
View
PDCN
2007
15 years 1 months ago
Design and evaluation of an auto-memoization processor
This paper describes the design and evaluation of an auto-memoization processor. The major point of this proposal is to detect the multilevel functions and loops with no additiona...
Tomoaki Tsumura, Ikuma Suzuki, Yasuki Ikeuchi, Hir...
POPL
1989
ACM
15 years 3 months ago
How to Make ad-hoc Polymorphism Less ad-hoc
raction that a programming language provides influences the structure and algorithmic complexity of the resulting programs: just imagine creating an artificial intelligence engine ...
Philip Wadler, Stephen Blott
DSN
2005
IEEE
15 years 5 months ago
Effective Testing and Debugging Techniques for a Group Communication System
View-oriented group communication is an important and widely used building block for constructing highlyavailable fault-tolerant systems. Unfortunately, groupcommunication based s...
Eitan Farchi, Gabriel Kliot, Yoel Krasny, Alex Kri...
PPOPP
2006
ACM
15 years 5 months ago
McRT-STM: a high performance software transactional memory system for a multi-core runtime
Applications need to become more concurrent to take advantage of the increased computational power provided by chip level multiprocessing. Programmers have traditionally managed t...
Bratin Saha, Ali-Reza Adl-Tabatabai, Richard L. Hu...
PPOPP
2010
ACM
15 years 9 months ago
Lazy binary-splitting: a run-time adaptive work-stealing scheduler
We present Lazy Binary Splitting (LBS), a user-level scheduler of nested parallelism for shared-memory multiprocessors that builds on existing Eager Binary Splitting work-stealing...
Alexandros Tzannes, George C. Caragea, Rajeev Baru...