Provably Efficient Scheduling for Languages With Fine-Grained Parallelism

doi 10.1145/215399.215403
Full Text
Abstract

Available in full text

Date
Authors
Publisher

ACM Press

Related search

A Shape Matching Approach for Scheduling Fine-Grained Parallelism

English

Tasklettes – A Fine Grained Parallelism for Ada on Multicores

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

Efficient Parallel Data Structures for Fine-Grained Hypercube Multiprocessors.

English

A Low-Overhead Scheduling Methodology for Fine-Grained Acceleration of Signal Processing Systems

Journal of Signal Processing Systems
ControlSystems EngineeringInformation SystemsSignal ProcessingSimulationHardwareArchitectureModelingTheoretical Computer Science
2009English

Efficient Concurrent Search Trees Using Portable Fine-Grained Locality

IEEE Transactions on Parallel and Distributed Systems
HardwareComputational TheorySignal ProcessingArchitectureMathematics
2019English

Language and Virtual Machine Support for Efficient Fine-Grained Futures in Java

Parallel Architectures and Compilation Techniques - Conference Proceedings, PACT
HardwareTheoretical Computer ScienceArchitectureSoftware
2007English

Parallelism in Sequential Functional Languages

1995English

Fine-Grained Concrete With Organomineral Additive

MATEC Web of Conferences
Materials ScienceEngineeringChemistry
2016English

Code Scheduling for Optimizing Parallelism and Data Locality

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy