A Shape Matching Approach for Scheduling Fine-Grained Parallelism

doi 10.1109/micro.1992.697029
Full Text
Abstract

Available in full text

Date

Unknown

Authors
Publisher

IEEE Comput. Soc. Press

Related search

Provably Efficient Scheduling for Languages With Fine-Grained Parallelism

1995English

Tasklettes – A Fine Grained Parallelism for Ada on Multicores

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

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

Coarse-To-Fine Combinatorial Matching for Dense Isometric Shape Correspondence

Computer Graphics Forum
Computer NetworksComputer GraphicsComputer-Aided DesignCommunications
2011English

Interaction Part Mining: A Mid-Level Approach for Fine-Grained Action Recognition

2015English

Code Scheduling for Optimizing Parallelism and Data Locality

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Fine-Grained Semantics for Probabilistic Programs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2018English

A Design Approach for Fine-Grained Run-Time Power Gating Using Locally Extracted Sleep Signals

2006 International Conference on Computer Design
2006English

A Task-Level Parallelism Approach for Process Discovery

International Journal of Engineering and Technology(UAE)
ArchitectureHardwareEngineeringChemical EngineeringBiotechnologyEnvironmental EngineeringComputer Science
2018English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy