On the public citation graph

A Strategyproof Mechanism for Scheduling Divisible Loads in Distributed Systems

0 signed · 34 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.1006/game.1999.0790openalex-snapshot
Algorithmic Mechanism Design
inferredcites →https://doi.org/10.1006/jcss.2001.1754openalex-snapshot
Sharing the Cost of Multicast Transmissions
inferredcites →https://doi.org/10.1007/s00446-005-0122-yopenalex-snapshot
A BGP-based mechanism for lowest-cost routing
inferredcites →https://doi.org/10.1016/s0167-8191(98)00104-5openalex-snapshot
Divisible task scheduling – Concept and verification
inferredcites →https://doi.org/10.1016/s0378-4754(01)00329-9openalex-snapshot
Large matrix–vector products on distributed bus networks with communication delays using the divisible load paradigm: performance analysis and simulation
inferredcites →https://doi.org/10.1023/a:1009623825393openalex-snapshot
Access Time Minimization for Distributed Multimedia Applications
inferredcites →https://doi.org/10.1023/a:1020958815308openalex-snapshot
Divisible Load Theory: A New Paradigm for Load Scheduling in Distributed Systems
inferredcites →https://doi.org/10.1080/1206212x.2003.11441695openalex-snapshot
Distributed Image Processing On A Network Of Workstations
inferredcites →https://doi.org/10.1109/icdcs.1998.679836openalex-snapshot
Globally distributed computation over the Internet-the POPCORN project
inferredcites →https://doi.org/10.1109/icdcs.1998.679848openalex-snapshot
Some economics of market-based distributed scheduling
inferredcites →https://doi.org/10.1109/ipdps.2001.924985openalex-snapshot
G-commerce: market formulations controlling resource allocation on the computational grid
inferredcites →https://doi.org/10.1109/mc.2003.1198238openalex-snapshot
Research feature - Ten reasons to use divisible load theory
inferredcites →https://doi.org/10.1109/sfcs.2001.959924openalex-snapshot
Truthful mechanisms for one-parameter agents
inferredcites →https://doi.org/10.1109/tpds.2005.35openalex-snapshot
Scheduling divisible loads on star and tree networks: results and open problems
inferredcites →https://doi.org/10.1109/tsmcb.2002.805812openalex-snapshot
Algorithmic Mechanism Design for Load Balancing in Distributed Systems
inferredcites →https://doi.org/10.1145/570810.570812openalex-snapshot
Distributed algorithmic mechanism design
inferredcites →https://doi.org/10.1145/571855.571856openalex-snapshot
A BGP-based mechanism for lowest-cost routing
inferredcites →https://doi.org/10.1145/779928.779977openalex-snapshot
Virtual worlds

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-642-02029-2_5openalex-snapshot
Asynchronous Congestion Games
inferred← citeshttps://doi.org/10.1016/j.jpdc.2011.11.008openalex-snapshot
An incentive-based distributed mechanism for scheduling divisible loads in tree networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.01.001openalex-snapshot
Combinatorial auctions with verification are tractable
inferred← citeshttps://doi.org/10.1109/icppw.2014.18openalex-snapshot
Scalability Analysis and Evaluation of Divisible Load Scheduling
inferred← citeshttps://doi.org/10.1109/ipdps.2006.1639262openalex-snapshot
Centralized versus distributed schedulers for multiple bag-of-task applications
inferred← citeshttps://doi.org/10.1109/ipdps.2006.1639548openalex-snapshot
A Strategyproof Mechanism for Scheduling Divisible Loads in Bus Networks without Control Processors
inferred← citeshttps://doi.org/10.1109/ipdps.2007.370228openalex-snapshot
A Strategyproof Mechanism for Scheduling Divisible Loads in Linear Networks
inferred← citeshttps://doi.org/10.1109/ispdc.2006.44openalex-snapshot
Selfish Multi-User Task Scheduling
inferred← citeshttps://doi.org/10.1109/ispdc.2007.16openalex-snapshot
Divisible Load Scheduling: An Approach Using Coalitional Games
inferred← citeshttps://doi.org/10.1109/ispdc.2013.15openalex-snapshot
Analyzing the Robustness of Scheduling Algorithms Using Divisible Load Theory on Heterogeneous Systems
inferred← citeshttps://doi.org/10.1109/tpds.2007.70818openalex-snapshot
Strategyproof Mechanisms for Scheduling Divisible Loads in Bus-Networked Distributed Systems
inferred← citeshttps://doi.org/10.1145/1383422.1383435openalex-snapshot
The performance of bags-of-tasks in large-scale distributed systems
inferred← citeshttps://doi.org/10.1155/2014/460354openalex-snapshot
Comprehensive Review on Divisible Load Theory: Concepts, Strategies, and Approaches
inferred← citeshttps://doi.org/10.1287/moor.1090.0394openalex-snapshot
Random Order Congestion Games
inferred← citeshttps://doi.org/10.32657/10356/68812openalex-snapshot
Divisible load scheduling algorithm in a virtual distributed computing system
inferred← citeshttps://doi.org/10.5555/1402821.1402936openalex-snapshot
Asynchronous congestion games
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.