On the public citation graph

UMR: a multi-round algorithm for scheduling divisible workloads

0 signed · 82 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.1002/0470867167.ch33openalex-snapshot
Parameter Sweeps on the Grid with APST
inferredcites →https://doi.org/10.1006/jpdc.1997.1411openalex-snapshot
Allocating Independent Tasks to Parallel Processors: An Experimental Study
inferredcites →https://doi.org/10.1006/jpdc.2000.1714openalex-snapshot
A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing Systems
inferredcites →https://doi.org/10.1007/3-540-44520-x_40openalex-snapshot
Experiments with Scheduling Divisible Tasks in Clusters of Workstations
inferredcites →https://doi.org/10.1007/3-540-45706-2_25openalex-snapshot
Optimal Scheduling Algorithms for Communication Constrained Parallel Processing
inferredcites →https://doi.org/10.1016/0167-8191(94)00068-lopenalex-snapshot
Parallel image processing applications on a network of workstations
inferredcites →https://doi.org/10.1016/c2013-0-10366-2openalex-snapshot
Constrained Optimization and Lagrange Multiplier Methods
inferredcites →https://doi.org/10.1016/s0167-8191(98)00104-5openalex-snapshot
Divisible task scheduling – Concept and verification
inferredcites →https://doi.org/10.1109/12.895858openalex-snapshot
Task allocation on a network of processors
inferredcites →https://doi.org/10.1109/ccgrid.2003.1199362openalex-snapshot
Scheduling distributed applications: the SimGrid simulation framework
inferredcites →https://doi.org/10.1109/clustr.2001.959961openalex-snapshot
Sharing partitionable workloads in heterogeneous NOWs: greedier is not better
inferredcites →https://doi.org/10.1109/clustr.2001.960008openalex-snapshot
The master-slave paradigm with heterogeneous processors
inferredcites →https://doi.org/10.1109/ipdps.2002.1015568openalex-snapshot
Bandwidth-centric allocation of independent tasks on heterogeneous platforms
inferredcites →https://doi.org/10.1109/mmcs.1998.693650openalex-snapshot
An optimal scheduling algorithm for parallel video processing
inferredcites →https://doi.org/10.1145/135226.135232openalex-snapshot
Factoring: a method for scheduling parallel loops

What points at this work

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

inferred← citeshttps://doi.org/10.1007/0-387-27705-6_1openalex-snapshot
Changing Challenges for Collaborative Algorithmics
inferred← citeshttps://doi.org/10.1007/11557654_92openalex-snapshot
Parallel Transferable Uniform Multi-round Algorithm for Achieving Minimum Application Turnaround Times for Divisible Workload
inferred← citeshttps://doi.org/10.1007/11823285_20openalex-snapshot
An Adaptive Scheduling Method for Grid Computing
inferred← citeshttps://doi.org/10.1007/11847366_6openalex-snapshot
A Parallel Transferable Uniform Multi-Round Algorithm in Heterogeneous Distributed Computing Environment
inferred← citeshttps://doi.org/10.1007/11847366_79openalex-snapshot
Dynamically Scheduling Divisible Load for Grid Computing
inferred← citeshttps://doi.org/10.1007/978-3-540-24663-3_16openalex-snapshot
Scheduling in Distributed Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-89894-8_20openalex-snapshot
Multi-round Real-Time Divisible Load Scheduling for Clusters
inferred← citeshttps://doi.org/10.1007/978-3-642-20042-7_4openalex-snapshot
A Method for Scheduling Heterogeneous Multi-Installment Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-21498-1_39openalex-snapshot
A Preliminary Analysis and Simulation of Load Balancing Techniques Applied to Parallel Genetic Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-40047-6_29openalex-snapshot
Application-Centric Resource Provisioning for Amazon EC2 Spot Instances
inferred← citeshttps://doi.org/10.1007/s00224-007-9001-1openalex-snapshot
On “Exploiting” Node-Heterogeneous Clusters Optimally
inferred← citeshttps://doi.org/10.1007/s11227-011-0677-2openalex-snapshot
Scheduling nonlinear divisible loads in a single level tree network
inferred← citeshttps://doi.org/10.1016/j.asoc.2014.07.021openalex-snapshot
Hybrid real-coded genetic algorithm for data partitioning in multi-round load distribution and scheduling in heterogeneous systems
inferred← citeshttps://doi.org/10.1016/j.camwa.2006.05.016openalex-snapshot
Divisible Load Scheduling and Markov Chain Models
inferred← citeshttps://doi.org/10.1016/j.camwa.2009.07.046openalex-snapshot
Grid scheduling divisible loads from two sources
inferred← citeshttps://doi.org/10.1016/j.egypro.2011.12.523openalex-snapshot
A GPU Oriented Data Partitioning Method to Overlap Communication and Computation
inferred← citeshttps://doi.org/10.1016/j.entcs.2014.12.013openalex-snapshot
Energy-efficient Checkpointing in High-throughput Cycle-stealing Distributed Systems
inferred← citeshttps://doi.org/10.1016/j.future.2012.03.008openalex-snapshot
New method for scheduling heterogeneous multi-installment systems
inferred← citeshttps://doi.org/10.1016/s0927-5452(05)80006-1openalex-snapshot
Operations research methods for resource management and scheduling in a computational grid: a survey
inferred← citeshttps://doi.org/10.1080/1206212x.2004.11441736openalex-snapshot
Scalable Scheduling for Clusters and Grids Using Cut Through Switching
inferred← citeshttps://doi.org/10.1109/ccgrid.2003.1199362openalex-snapshot
Scheduling distributed applications: the SimGrid simulation framework
inferred← citeshttps://doi.org/10.1109/clustr.2003.1253334openalex-snapshot
A general self-adaptive task scheduling system for non-dedicated heterogeneous computing
inferred← citeshttps://doi.org/10.1109/clustr.2005.347073openalex-snapshot
Harnessing Shared Wide-area Clusters for Dynamic High End Services
inferred← citeshttps://doi.org/10.1109/hpcasia.2005.61openalex-snapshot
Optimal multi-installments algorithm for divisible load scheduling
inferred← citeshttps://doi.org/10.1109/hpdc.2003.1210021openalex-snapshot
RUMR: robust scheduling for divisible workloads
inferred← citeshttps://doi.org/10.1109/iacsit-sc.2009.54openalex-snapshot
Categorizing Researches about DLT in Ten Groups
inferred← citeshttps://doi.org/10.1109/icpads.2008.23openalex-snapshot
Contention-Free Scheduling in a Dynamic Context
inferred← citeshttps://doi.org/10.1109/icpp.2005.70openalex-snapshot
Scheduling Data Flow Applications Using Linear Programming
inferred← citeshttps://doi.org/10.1109/icppw.2006.15openalex-snapshot
A runtime scheduling method for dynamic and heterogeneous platforms
inferred← citeshttps://doi.org/10.1109/icppw.2009.29openalex-snapshot
Real-Time Divisible Load Theory: A Perspective
inferred← citeshttps://doi.org/10.1109/ipdps.2003.1213104openalex-snapshot
Autonomous protocols for bandwidth-centric scheduling of independent-task applications
inferred← citeshttps://doi.org/10.1109/ipdps.2004.1303169openalex-snapshot
Modeling large-scale platforms for the analysis and the simulation of scheduling strategies
inferred← citeshttps://doi.org/10.1109/ipdps.2005.351openalex-snapshot
Practical Divisible Load Scheduling on Grid Platforms with APST-DV
inferred← citeshttps://doi.org/10.1109/ipdps.2006.1639588openalex-snapshot
The GHS grid scheduling system: implementation and performance comparison
inferred← citeshttps://doi.org/10.1109/ipdps.2009.5161044openalex-snapshot
Static strategies forworksharing with unrecoverable interruptions
inferred← citeshttps://doi.org/10.1109/ipdps.2011.126openalex-snapshot
Scheduling on Unspecified Heterogeneous Distributed Resources
inferred← citeshttps://doi.org/10.1109/mascots.2010.34openalex-snapshot
Decision Model for Cloud Computing under SLA Constraints
inferred← citeshttps://doi.org/10.1109/pdcat.2005.46openalex-snapshot
A Scheduling Method for Divisible Workload Problem in Grid Environments
inferred← citeshttps://doi.org/10.1109/scis.2009.4927015openalex-snapshot
New heuristics and integer programming formulations for scheduling divisible load tasks
inferred← citeshttps://doi.org/10.1109/taes.2004.1310014openalex-snapshot
Equal allocation scheduling for data intensive applications
inferred← citeshttps://doi.org/10.1109/taes.2004.1337468openalex-snapshot
Divisible load cut through switching in sequential tree networks
inferred← citeshttps://doi.org/10.1109/taes.2006.1603426openalex-snapshot
Wireless sensor networks: scheduling for measurement and data reporting
inferred← citeshttps://doi.org/10.1109/taes.2008.4655372openalex-snapshot
Scheduling nonlinear computational loads
inferred← citeshttps://doi.org/10.1109/taes.2012.6129670openalex-snapshot
Scheduling Second-Order Computational Load in Master-Slave Paradigm
inferred← citeshttps://doi.org/10.1109/taes.2015.130677openalex-snapshot
Scheduling divisible loads with nonlinear communication time
inferred← citeshttps://doi.org/10.1109/tpds.2005.139openalex-snapshot
Multiround algorithms for scheduling divisible loads
inferred← citeshttps://doi.org/10.1109/tpds.2005.35openalex-snapshot
Scheduling divisible loads on star and tree networks: results and open problems
inferred← citeshttps://doi.org/10.1109/tpds.2005.76openalex-snapshot
Agent-based load balancing on homogeneous minigrids: macroscopic modeling and characterization
inferred← citeshttps://doi.org/10.1109/tpds.2015.2447515openalex-snapshot
Optimization of the Processing of Data Streams on Roughly Characterized Distributed Resources
inferred← citeshttps://doi.org/10.1109/tsc.2011.44openalex-snapshot
Monetary Cost-Aware Checkpointing and Migration on Amazon Cloud Spot Instances
inferred← citeshttps://doi.org/10.1111/itor.12178openalex-snapshot
A biased random‐key genetic algorithm for single‐round divisible load scheduling
inferred← citeshttps://doi.org/10.1111/itor.12429openalex-snapshot
A biased random‐key genetic algorithm for scheduling heterogeneous multi‐round systems
inferred← citeshttps://doi.org/10.1142/s0129054105002929openalex-snapshot
NETWORK MODELING ISSUES FOR GRID APPLICATION SCHEDULING
inferred← citeshttps://doi.org/10.1142/s0129054105002954openalex-snapshot
SCHEDULING ON LARGE SCALE DISTRIBUTED PLATFORMS: FROM MODELS TO IMPLEMENTATIONS
inferred← citeshttps://doi.org/10.1142/s012962641100031xopenalex-snapshot
SIMPLE PERFORMANCE BOUNDS FOR MULTICORE AND PARALLEL CHANNEL SYSTEMS
inferred← citeshttps://doi.org/10.1145/1048935.1050182openalex-snapshot
Conservative Scheduling
inferred← citeshttps://doi.org/10.1145/1655925.1656079openalex-snapshot
Multi-round scheduling for divisible loads on the heterogeneous cluster systems of multi-core computers
inferred← citeshttps://doi.org/10.1177/1548512910394608openalex-snapshot
Sim-PETEK: A Parallel Simulation Execution Framework for Grid Environments
inferred← citeshttps://doi.org/10.1504/ijcse.2014.058701openalex-snapshot
Multi-source task scheduling in grid computing environment using linear programming
inferred← citeshttps://doi.org/10.1504/ijhpcn.2004.008903openalex-snapshot
Self-adaptive task allocation and scheduling of meta-tasks in non-dedicated heterogeneous computing
inferred← citeshttps://doi.org/10.1587/transcom.e95.b.1669openalex-snapshot
Parallel Transferable Uniform Multi-Round Algorithm for Minimizing Makespan
inferred← citeshttps://doi.org/10.2316/journal.202.2004.3.202-1461openalex-snapshot
Scalable Schesuling for Cluster and Grids using Cut Through Switching
inferred← citeshttps://doi.org/10.32657/10356/68812openalex-snapshot
Divisible load scheduling algorithm in a virtual distributed computing system
inferred← citeshttps://doi.org/10.4156/jcit.vol5.issue7.21openalex-snapshot
A Flexible Grid Task Scheduling Algorithm Based on QoS Similarity
inferred← citeshttps://doi.org/10.48550/arxiv.1211.1279openalex-snapshot
Application-centric Resource Provisioning for Amazon EC2 Spot Instances
inferred← citeshttps://doi.org/10.5555/1791889.1791913openalex-snapshot
Multi-round real-time divisible load scheduling for clusters
inferred← citeshttps://doi.org/10.5555/1898699.1898815openalex-snapshot
The GHS grid scheduling system: implementation and performance comparison
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.