On the public citation graph

Non-Cooperative Scheduling of Multiple Bag-of-Task Applications

0 signed · 30 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-3-540-24693-0_34openalex-snapshot
Bounds on Benefits and Harms of Adding Connections to Noncooperative Networks
inferredcites →https://doi.org/10.1007/978-3-642-23383-8_3openalex-snapshot
Berkeley Open Infrastructure for Network Computing
inferredcites →https://doi.org/10.1007/bf01918335openalex-snapshot
Über ein Paradoxon aus der Verkehrsplanung
inferredcites →https://doi.org/10.1016/j.comnet.2005.12.006openalex-snapshot
Generalized Nash Bargaining Solution for bandwidth allocation
inferredcites →https://doi.org/10.1016/j.cosrev.2009.04.003openalex-snapshot
Worst-case equilibria
inferredcites →https://doi.org/10.1016/j.ejor.2003.10.051openalex-snapshot
Complexity of master–slave tasking on heterogeneous trees
inferredcites →https://doi.org/10.1073/pnas.36.1.48openalex-snapshot
Equilibrium points in n -person games
inferredcites →https://doi.org/10.1109/90.879352openalex-snapshot
A game theoretic framework for bandwidth allocation and pricing in broadband networks
inferredcites →https://doi.org/10.1109/hcw.1999.765117openalex-snapshot
Communication modeling of heterogeneous networks of workstations for performance characterization of collective operations
inferredcites →https://doi.org/10.1109/infcom.2007.57openalex-snapshot
Non-Cooperative Scheduling of Multiple Bag-of-Task Applications
inferredcites →https://doi.org/10.1109/ipdps.2004.1302974openalex-snapshot
Distributed adaptive task allocation in heterogeneous computing environments to maximize throughput
inferredcites →https://doi.org/10.1109/ipdps.2006.1639262openalex-snapshot
Centralized versus distributed schedulers for multiple bag-of-task applications
inferredcites →https://doi.org/10.1109/sfcs.2000.892068openalex-snapshot
On the approximability of trade-offs and optimal access of Web sources
inferredcites →https://doi.org/10.1109/tpds.2004.1271181openalex-snapshot
Scheduling strategies for master-slave tasking on heterogeneous processor platforms
inferredcites →https://doi.org/10.1109/tpds.2007.70747openalex-snapshot
Centralized versus Distributed Schedulers for Bag-of-Tasks Applications
inferredcites →https://doi.org/10.1137/s0097539798347906openalex-snapshot
Message Multicasting in Heterogeneous Networks
inferredcites →https://doi.org/10.2307/1969529openalex-snapshot
Non-Cooperative Games

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-15277-1_17openalex-snapshot
Non-clairvoyant Scheduling of Multiple Bag-of-Tasks Applications
inferred← citeshttps://doi.org/10.1016/j.jpdc.2009.09.003openalex-snapshot
Cooperative power-aware scheduling in grid computing environments
inferred← citeshttps://doi.org/10.1016/j.jpdc.2013.08.011openalex-snapshot
Fair scheduling of bag-of-tasks applications using distributed Lagrangian optimization
inferred← citeshttps://doi.org/10.1109/access.2019.2899926openalex-snapshot
Off-Line Time Aware Scheduling of Bag-of-Tasks on Heterogeneous Distributed System
inferred← citeshttps://doi.org/10.1109/grid.2008.4662790openalex-snapshot
Toward a fully decentralized algorithm for multiple bag-of-tasks application scheduling on grids
inferred← citeshttps://doi.org/10.1109/icpads.2009.42openalex-snapshot
Data-bandwidth-aware Job Scheduling in Grid and Cluster Environments
inferred← citeshttps://doi.org/10.1109/infcom.2009.5062237openalex-snapshot
Fair and Efficient User-Network Association Algorithm for Multi-Technology Wireless Networks
inferred← citeshttps://doi.org/10.1109/ipdps.2009.5161037openalex-snapshot
Multi-users scheduling in parallel systems
inferred← citeshttps://doi.org/10.1109/scc.2017.60openalex-snapshot
A Cognitive Prioritization for Reports Generated in Resource Constrained Applications
inferred← citeshttps://doi.org/10.1109/tc.2008.79openalex-snapshot
A Cooperative Game Framework for QoS Guided Job Allocation Schemes in Grids
inferred← citeshttps://doi.org/10.1109/tc.2012.164openalex-snapshot
Requirement-Aware Scheduling of Bag-of-Tasks Applications on Grids with Dynamic Resilience
inferred← citeshttps://doi.org/10.1109/tpds.2007.70747openalex-snapshot
Centralized versus Distributed Schedulers for Bag-of-Tasks Applications
showing the first 12 of 13 · page through all 13
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.