Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks

Algorithmica- United States

doi 10.1007/s00453-001-0085-8

Full Text

Abstract

Available in

Date

Authors

Unknown

Publisher

Springer Science and Business Media LLC

Related search

Polynomial-Time Approximation Schemes for Scheduling Problems With Time Lags

Journal of Scheduling
Management ScienceEngineeringOperations ResearchArtificial IntelligenceSoftware
2009English

Mixed-Criticality Federated Scheduling for Parallel Real-Time Tasks

2016English

Approximation Schemes for Preemptive Weighted Flow Time

2002English

Polynomial-Time Approximation Schemes for Geometric Intersection Graphs

SIAM Journal on Computing
MathematicsComputer Science
2005English

Real-Time Scheduling for Reducing Jitters of Periodic Tasks

Journal of Information Processing
2015English

Hybrid Scheduling for the Parallel Solution of Linear Systems

Parallel Computing
Computer GraphicsComputer NetworksHardwareCommunicationsComputer-Aided DesignArchitectureTheoretical Computer ScienceArtificial IntelligenceSoftware
2006English

Approximation Schemes for the Min-Max Starting Time Problem

Acta Informatica
Computer NetworksSoftwareInformation SystemsCommunications
2004English

Parallel Simulation of Tasks Scheduling and Scheduling Criteria in High-Performance Computing Systems

Journal of Information and Organizational Sciences
Computer Science ApplicationsInformation SystemsLibraryInformation Sciences
2019English

Baker Game and Polynomial-Time Approximation Schemes

2020English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy