On the public citation graph
On parallelizing the multiprocessor scheduling problem
0 signed · 80 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/jpdc.1997.1395openalex-snapshot
Efficient Scheduling of Arbitrary Task Graphs to Multiprocessors Using a Parallel Genetic Algorithm
inferredcites →https://doi.org/10.1007/bf02684444openalex-snapshot
An analysis of parallel heuristics for task allocation in multicomputers
inferredcites →https://doi.org/10.1016/0167-8191(94)90121-xopenalex-snapshot
A two-pass scheduling algorithm for parallel programs
inferredcites →https://doi.org/10.1016/0743-7315(90)90014-gopenalex-snapshot
Analysis and evaluation of heuristic methods for static task scheduling
inferredcites →https://doi.org/10.1016/0743-7315(90)90042-nopenalex-snapshot
Scheduling parallel program tasks onto arbitrary target machines
inferredcites →https://doi.org/10.1016/0743-7315(91)90042-8openalex-snapshot
A vertically layered allocation scheme for data flow systems
inferredcites →https://doi.org/10.1109/32.4634openalex-snapshot
A taxonomy of scheduling in general-purpose distributed computing systems
inferredcites →https://doi.org/10.1109/52.1991openalex-snapshot
Grain size determination for parallel processing
inferredcites →https://doi.org/10.1109/71.207593openalex-snapshot
A compile-time scheduling heuristic for interconnection-constrained heterogeneous processor architectures
inferredcites →https://doi.org/10.1109/71.308533openalex-snapshot
DSC: scheduling parallel tasks on an unbounded number of processors
inferredcites →https://doi.org/10.1109/71.473511openalex-snapshot
An inherently parallel method for heuristic problem-solving. I. General framework
inferredcites →https://doi.org/10.1109/71.481597openalex-snapshot
Task clustering and scheduling for distributed memory parallel architectures
inferredcites →https://doi.org/10.1109/71.503776openalex-snapshot
Dynamic critical-path scheduling: an effective technique for allocating task graphs to multiprocessors
inferredcites →https://doi.org/10.1109/71.722221openalex-snapshot
On exploiting task duplication in parallel program scheduling
inferredcites →https://doi.org/10.1109/71.80160openalex-snapshot
Hypertool: a programming aid for message-passing systems
inferredcites →https://doi.org/10.1109/icpp.1994.14openalex-snapshot
A Bottom-Up Approach to Task Scheduling on Distributed Memory Multiprocessors
inferredcites →https://doi.org/10.1109/superc.1992.236653openalex-snapshot
Applications and performance analysis of a compile-time optimization approach for list scheduling algorithms on distributed memory multiprocessors
inferredcites →https://doi.org/10.1109/tc.1972.5008918openalex-snapshot
Optimal Scheduling Strategies in a Multiprocessor System
inferredcites →https://doi.org/10.1137/0218016openalex-snapshot
Scheduling Precedence Graphs in Systems with Interprocessor Communication Times
inferredcites →https://doi.org/10.1137/0219021openalex-snapshot
Towards an Architecture-Independent Analysis of Parallel Algorithms
inferredcites →https://doi.org/10.1142/s0129626493000083openalex-snapshot
THE TIME COMPLEXITY OF SCHEDULING INTERVAL ORDERS WITH COMMUNICATION IS POLYNOMIAL
inferredcites →https://doi.org/10.1145/361604.361619openalex-snapshot
A comparison of list schedules for parallel processing systems
inferredcites →https://doi.org/10.1145/66451.66454openalex-snapshot
Automatic determination of grain size for efficient parallel processing
inferredcites →https://doi.org/10.1287/opre.39.4.680openalex-snapshot
C.P.M. Scheduling with Small Communication Delays and Task Duplication
inferredcites →https://doi.org/10.5555/147877.148081openalex-snapshot
Applications and performance analysis of a compile-time optimization approach for list scheduling algorithms on distributed memory multiprocessors
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jpdc.1999.1578openalex-snapshot
Benchmarking and Comparison of the Task Graph Scheduling Algorithms
inferred← citeshttps://doi.org/10.1007/0-387-28967-4_7openalex-snapshot
Scheduling Parallel Tasks onto Numa Multiprocessors with Inter-Processor Communication Overhead
inferred← citeshttps://doi.org/10.1007/11558958_134openalex-snapshot
A Novel Task Scheduling Algorithm for Distributed Heterogeneous Computing Systems
inferred← citeshttps://doi.org/10.1007/3-540-37619-4_9openalex-snapshot
Scheduling Parallel Tasks onto NUMA Multiprocessors with Inter-processor Communication Overhead
inferred← citeshttps://doi.org/10.1007/978-3-540-71618-1_13openalex-snapshot
An Evolutionary Approach to Task Graph Scheduling
inferred← citeshttps://doi.org/10.1007/978-3-540-76843-2_15openalex-snapshot
A Hybrid Algorithm for Scheduling Workflow Applications in Grid Environments (ICPDP)
inferred← citeshttps://doi.org/10.1007/978-981-19-0475-2_18openalex-snapshot
Load Balancing in Multiprocessor Systems Using Modified Real-Coded Genetic Algorithm
inferred← citeshttps://doi.org/10.1007/978-981-32-9186-7_16openalex-snapshot
Grey Wolf Optimized Task Scheduling Algorithm in Cloud Computing
inferred← citeshttps://doi.org/10.1007/s11432-009-0010-3openalex-snapshot
Communication contention in APN list scheduling algorithm
inferred← citeshttps://doi.org/10.1016/bs.adcom.2022.01.002openalex-snapshot
A runtime job scheduling algorithm for cluster architectures with dataflow accelerators
inferred← citeshttps://doi.org/10.1016/j.jpdc.2004.09.008openalex-snapshot
Toward an analytical solution to task allocation, processor assignment, and performance evaluation of network processors
inferred← citeshttps://doi.org/10.1016/j.jpdc.2005.02.003openalex-snapshot
A dynamic and reliability-driven scheduling algorithm for parallel real-time jobs executing on heterogeneous clusters
inferred← citeshttps://doi.org/10.1016/j.jpdc.2005.05.028openalex-snapshot
On multiprocessor task scheduling using efficient state space search approaches
inferred← citeshttps://doi.org/10.1080/18756891.2016.1237181openalex-snapshot
A Novel ACO-Based Static Task Scheduling Approach for Multiprocessor Environments
inferred← citeshttps://doi.org/10.1109/12.895858openalex-snapshot
Task allocation on a network of processors
inferred← citeshttps://doi.org/10.1109/cca.2005.1507268openalex-snapshot
Decentralized probabilistic scheduling: application to computational grids
inferred← citeshttps://doi.org/10.1109/date.2006.243958openalex-snapshot
Scalable Performance-Energy Trade-off Exploration of Embedded Real-Time Systems on Multiprocessor Platforms
inferred← citeshttps://doi.org/10.1109/eait.2014.20openalex-snapshot
Energy Efficient Task-Pull Scheduling Using Equal Length Cellular Automata in Distributed Computing
inferred← citeshttps://doi.org/10.1109/hcw.2000.843751openalex-snapshot
A framework for mapping with resource co-allocation in heterogeneous computing systems
inferred← citeshttps://doi.org/10.1109/ibcast.2014.6778136openalex-snapshot
Reliable system design using decision diagrams in presence of hard and soft errors
inferred← citeshttps://doi.org/10.1109/icces.2015.7393030openalex-snapshot
A new hardware/software partitioning technique
inferred← citeshttps://doi.org/10.1109/icias.2010.5716203openalex-snapshot
ACO-MTS: A new approach for multiprocessor task scheduling based on ant colony optimization
inferred← citeshttps://doi.org/10.1109/icpp.2005.15openalex-snapshot
A Task Duplication Based Scheduling Algorithm Using Partial Schedules
inferred← citeshttps://doi.org/10.1109/icppw.2000.869147openalex-snapshot
A performance evaluation of list scheduling heuristics for task graphs without communication costs
inferred← citeshttps://doi.org/10.1109/icsai.2014.7009308openalex-snapshot
Task assignments based on shared memory multi-core communication
inferred← citeshttps://doi.org/10.1109/ictta.2006.1684976openalex-snapshot
Scheduling Tasks with Execution and Precedence Constraints using Longest Compatible Paths
inferred← citeshttps://doi.org/10.1109/ipdps.2001.925041openalex-snapshot
Run-time adaptation for grid environments
inferred← citeshttps://doi.org/10.1109/ipdps.2001.925055openalex-snapshot
An integer programming approach for static mapping of paths onto heterogeneous real-time systems
inferred← citeshttps://doi.org/10.1109/iti.2001.937995openalex-snapshot
A comparison of the static task graph scheduling algorithms
inferred← citeshttps://doi.org/10.1109/mcsoc.2016.25openalex-snapshot
Design Space Exploration Problem Formulation for Dataflow Programs on Heterogeneous Architectures
inferred← citeshttps://doi.org/10.1109/syscon.2012.6189481openalex-snapshot
Energy-aware scheduling of distributed systems using cellular automata
inferred← citeshttps://doi.org/10.1109/tase.2014.2308955openalex-snapshot
Energy-Aware Scheduling of Distributed Systems
inferred← citeshttps://doi.org/10.1109/tii.2011.2166769openalex-snapshot
Expressing Coarse-Grain Dependencies Among Tasks in Shared Memory Programs
inferred← citeshttps://doi.org/10.1109/tpds.2002.1041877openalex-snapshot
Sequential and parallel cellular automata-based scheduling algorithms
inferred← citeshttps://doi.org/10.1109/tpds.2014.2312924openalex-snapshot
Performance-Oriented Partitioning for Task Scheduling of Parallel Reconfigurable Architectures
inferred← citeshttps://doi.org/10.1142/s021926590800214xopenalex-snapshot
DIVISIBLE LOAD DISTRIBUTION IN A NETWORK OF PROCESSORS
inferred← citeshttps://doi.org/10.1145/344588.344618openalex-snapshot
Static scheduling algorithms for allocating directed task graphs to multiprocessors
inferred← citeshttps://doi.org/10.11591/ijece.v13i6.pp7099-7107openalex-snapshot
Resource allocation for fog computing based on software-defined networks
inferred← citeshttps://doi.org/10.1177/00375497231208481openalex-snapshot
ACO intelligent task scheduling algorithm based on Q-learning optimization in a multilayer cognitive radio platform
inferred← citeshttps://doi.org/10.1177/1094342003017002007openalex-snapshot
Towards Optimal Static Task Scheduling for Realistic Machine Models: Theory and Practice
inferred← citeshttps://doi.org/10.14257/ijgdc.2015.8.1.05openalex-snapshot
Multiprocessor Task Graph Scheduling Using a Novel Graph-Like Learning Automata
inferred← citeshttps://doi.org/10.2478/v10177-012-0051-1openalex-snapshot
Problem-Independent Approach to Multiprocessor Dependent Task Scheduling
inferred← citeshttps://doi.org/10.3233/mgs-2006-2104openalex-snapshot
A probabilistic scheduling heuristic for computational grids
inferred← citeshttps://doi.org/10.32628/cseit217543openalex-snapshot
A Multithreading Based Enhanced Process Scheduling Technique for Heterogeneous Distributed Environment
inferred← citeshttps://doi.org/10.3745/kipsta.2004.11a.7.499openalex-snapshot
A Heuristic Load Balancing Algorithm by using Iterative Load Transfer
inferred← citeshttps://doi.org/10.4156/jcis.vol1.issue2.4openalex-snapshot
Performance Evaluation of Matrix Multiplication on a Network of Work Stations with Communication Delay
inferred← citeshttps://doi.org/10.48550/arxiv.1106.5309openalex-snapshot
Resource CoAllocation for Scheduling Tasks with Dependencies, in Grid
inferred← citeshttps://doi.org/10.5120/9394-3835openalex-snapshot
Comparative Study of Task Duplication based Scheduling Algorithms for Parallel Systems
inferred← citeshttps://doi.org/10.5120/ijca2015906828openalex-snapshot
A Survey of Static Scheduling Algorithm for Distributed Computing System
inferred← citeshttps://doi.org/10.5120/ijca2019918345openalex-snapshot
Optimized Task Scheduling Algorithms in Distributed Computing: A Review
inferred← citeshttps://doi.org/10.5555/1761566.1761578openalex-snapshot
Scheduling parallel tasks onto NUMA multiprocessors with inter-processor communication overhead
inferred← citeshttps://doi.org/10.5821/dissertation-2117-94549openalex-snapshot
Computing resource management in software-defined and cognitive radios
inferred← citeshttps://doi.org/10.61186/itrc.15.4.41openalex-snapshot
Resource Allocation optimization in fog Architecture Based Software-Defined Networks
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.