On the public citation graph

A PTAS for Assigning Sporadic Tasks on Two-type Heterogeneous Multiprocessors

0 signed · 27 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-0-230-37405-8_1openalex-snapshot
Introduction to algorithms
inferredcites →https://doi.org/10.1007/bf01585745openalex-snapshot
Approximation algorithms for scheduling unrelated parallel machines
inferredcites →https://doi.org/10.1007/s11241-012-9164-yopenalex-snapshot
Partitioned EDF scheduling on a few types of unrelated multiprocessors
inferredcites →https://doi.org/10.1016/b978-155860702-6/50016-8openalex-snapshot
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
inferredcites →https://doi.org/10.1016/s0898-1221(01)90023-9openalex-snapshot
Combinatorial optimization: Theory and algorithms
inferredcites →https://doi.org/10.1109/icpp.2004.1327956openalex-snapshot
Partitioning real-time tasks among heterogeneous multiprocessors
inferredcites →https://doi.org/10.1109/icpp.2004.56openalex-snapshot
Partitioning real-time tasks among heterogeneous multiprocessors
inferredcites →https://doi.org/10.1109/rtss.2010.32openalex-snapshot
Assigning Real-Time Tasks on Heterogeneous Multiprocessors with Two Unrelated Types of Processors
inferredcites →https://doi.org/10.1109/rtss.2012.64openalex-snapshot
A PTAS for Assigning Sporadic Tasks on Two-type Heterogeneous Multiprocessors
inferredcites →https://doi.org/10.1109/rttas.2004.1317301openalex-snapshot
Task partitioning upon heterogeneous multiprocessor platforms
inferredcites →https://doi.org/10.1145/321738.321743openalex-snapshot
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/cpe.3359openalex-snapshot
Scheduling independent tasks on multi‐cores with GPU accelerators
inferred← citeshttps://doi.org/10.1007/978-3-319-62127-2_42openalex-snapshot
An EPTAS for Scheduling on Unrelated Machines of Few Different Types
inferred← citeshttps://doi.org/10.1007/978-3-662-49192-8_24openalex-snapshot
A PTAS for Scheduling Unrelated Machines of Few Different Types
inferred← citeshttps://doi.org/10.1007/s00453-019-00581-wopenalex-snapshot
An EPTAS for Scheduling on Unrelated Machines of Few Different Types
inferred← citeshttps://doi.org/10.1007/s10107-014-0786-9openalex-snapshot
Assigning sporadic tasks to unrelated machines
inferred← citeshttps://doi.org/10.1007/s10878-024-01118-wopenalex-snapshot
Randomized approximation schemes for minimizing the weighted makespan on identical parallel machines
inferred← citeshttps://doi.org/10.1007/s10951-018-0593-xopenalex-snapshot
ILP models for the allocation of recurrent workloads upon heterogeneous multiprocessors
inferred← citeshttps://doi.org/10.1007/s11241-013-9195-zopenalex-snapshot
Real-time scheduling with resource sharing on heterogeneous multiprocessors
inferred← citeshttps://doi.org/10.1109/ecrts.2016.10openalex-snapshot
ILP-Based Approaches to Partitioning Recurrent Workloads Upon Heterogeneous Multiprocessors
inferred← citeshttps://doi.org/10.1109/ipdpsw.2015.119openalex-snapshot
Scheduling Tasks with Precedence Constraints on Hybrid Multi-core Machines
inferred← citeshttps://doi.org/10.1109/rtss.2015.19openalex-snapshot
Optimal Real-Time Scheduling on Two-Type Heterogeneous Multicore Platforms
inferred← citeshttps://doi.org/10.1109/rtss52674.2021.00033openalex-snapshot
Heterogeneous Quasi-Partitioned Scheduling
inferred← citeshttps://doi.org/10.1145/2660494openalex-snapshot
Task Assignment Algorithms for Heterogeneous Multiprocessors
inferred← citeshttps://doi.org/10.1145/2660495openalex-snapshot
Provably Good Task Assignment for Two-Type Heterogeneous Multiprocessors Using Cutting Planes
inferred← citeshttps://doi.org/10.1145/2997465.2997482openalex-snapshot
Scheduling Constrained-Deadline Parallel Tasks on Two-type Heterogeneous Multiprocessors
showing the first 15 of 16 · page through all 16
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.