Amanote Research
Register
Sign In
Provably Efficient Scheduling for Languages With Fine-Grained Parallelism
doi 10.1145/215399.215403
Full Text
Open PDF
Abstract
Available in
full text
Date
January 1, 1995
Authors
Guy E. Blelloch
Phillip B. Gibbons
Yossi Matias
Publisher
ACM Press
Related search
A Shape Matching Approach for Scheduling Fine-Grained Parallelism
Tasklettes – A Fine Grained Parallelism for Ada on Multicores
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Efficient Parallel Data Structures for Fine-Grained Hypercube Multiprocessors.
Efficient Concurrent Search Trees Using Portable Fine-Grained Locality
IEEE Transactions on Parallel and Distributed Systems
Hardware
Computational Theory
Signal Processing
Architecture
Mathematics
A Low-Overhead Scheduling Methodology for Fine-Grained Acceleration of Signal Processing Systems
Journal of Signal Processing Systems
Control
Systems Engineering
Information Systems
Signal Processing
Simulation
Hardware
Architecture
Modeling
Theoretical Computer Science
Language and Virtual Machine Support for Efficient Fine-Grained Futures in Java
Parallel Architectures and Compilation Techniques - Conference Proceedings, PACT
Hardware
Theoretical Computer Science
Architecture
Software
Parallelism in Sequential Functional Languages
Fine-Grained Concrete With Organomineral Additive
MATEC Web of Conferences
Materials Science
Engineering
Chemistry
Code Scheduling for Optimizing Parallelism and Data Locality
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
