On the public citation graph
RUSH: A RobUst ScHeduler to Manage Uncertain Completion-Times in Shared Clouds
0 signed · 35 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.1007/978-3-642-25821-3_9openalex-snapshot
Resource Provisioning Framework for MapReduce Jobs with Performance Goals
inferredcites →https://doi.org/10.1007/s10696-012-9147-2openalex-snapshot
Robust optimization for resource-constrained project scheduling with uncertain activity durations
inferredcites →https://doi.org/10.1080/00207540310001638055openalex-snapshot
Robust and reactive project scheduling: a review and classification of procedures
inferredcites →https://doi.org/10.1109/ccgrid.2014.101openalex-snapshot
MIMP: Deadline and Interference Aware Scheduling of Hadoop Virtual Machines
inferredcites →https://doi.org/10.1109/csc.2011.6138527openalex-snapshot
An effective data locality aware task scheduling method for MapReduce framework in heterogeneous environments
inferredcites →https://doi.org/10.1109/cts.2013.6567252openalex-snapshot
LaSA: A locality-aware scheduling algorithm for Hadoop-MapReduce resource assignment
inferredcites →https://doi.org/10.1109/datacloud.2014.10openalex-snapshot
Locality and Network-Aware Reduce Task Scheduling for Data-Intensive Applications
inferredcites →https://doi.org/10.1109/hpdc.2004.1323519openalex-snapshot
Balancing risk and reward in a market-based task service
inferredcites →https://doi.org/10.1109/hpdc.2004.5openalex-snapshot
Balancing risk and reward in a market-based task service
inferredcites →https://doi.org/10.1109/hpdc.2006.1652143openalex-snapshot
Service contracts and aggregate utility functions
inferredcites →https://doi.org/10.1109/infcom.2013.6566957openalex-snapshot
Map task scheduling in MapReduce with data locality: Throughput and heavy-traffic optimality
inferredcites →https://doi.org/10.1109/infocom.2015.7218460openalex-snapshot
Need for speed: CORA scheduler for optimizing completion-times in the cloud
inferredcites →https://doi.org/10.1109/ipdps.2011.123openalex-snapshot
Time Utility Functions for Modeling and Evaluating Resource Allocations in a Heterogeneous Computing System
inferredcites →https://doi.org/10.1109/isorc.2005.39openalex-snapshot
On Recent Advances in Time/Utility Function Real-Time Scheduling and Resource Management
inferredcites →https://doi.org/10.1109/tpds.2015.2405552openalex-snapshot
Hadoop Performance Modeling for Job Estimation and Resource Provisioning
inferredcites →https://doi.org/10.1145/2479942.2479947openalex-snapshot
A throughput optimal algorithm for map task scheduling in mapreduce with data locality
inferredcites →https://doi.org/10.48550/arxiv.1207.0780openalex-snapshot
Survey on Improved Scheduling in Hadoop MapReduce in Cloud Environments
inferredcites →https://doi.org/10.5555/1855741.1855744openalex-snapshot
Improving MapReduce performance in heterogeneous environments
inferredcites →https://doi.org/10.5555/1924943.1924962openalex-snapshot
Reining in the outliers in map-reduce clusters using Mantri
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1016/j.future.2020.08.013openalex-snapshot
Optimizing job completion time with fairness in large-scale data centers
inferred← citeshttps://doi.org/10.1109/cloud.2017.69openalex-snapshot
PYTHIA: Admission Control for Multi-Framework, Deadline- Driven, Big Data Workloads
inferred← citeshttps://doi.org/10.1109/cluster.2017.52openalex-snapshot
Justice: A Deadline-Aware, Fair-Share Resource Allocator for Implementing Multi-Analytics
inferred← citeshttps://doi.org/10.1109/icnc47757.2020.9049802openalex-snapshot
Fair Scheduling for Deadline-Driven, Resource-Constrained, Multi-Analytics Workloads
inferred← citeshttps://doi.org/10.1109/infocom.2017.8056975openalex-snapshot
Discovering valuations and enforcing truthfulness in a deadline-aware scheduler
inferred← citeshttps://doi.org/10.1109/pccc.2016.7820629openalex-snapshot
Selecting resources for distributed dataflow systems according to runtime targets
inferred← citeshttps://doi.org/10.1109/tpds.2022.3218649openalex-snapshot
Robustness Analysis and Enhancement of Deep Reinforcement Learning-Based Schedulers
inferred← citeshttps://doi.org/10.1145/3167132.3167150openalex-snapshot
Data locality and VM interference aware mitigation of data skew in hadoop leveraging modern portfolio theory
inferred← citeshttps://doi.org/10.1155/2022/8598305openalex-snapshot
PAS: Performance-Aware Job Scheduling for Big Data Processing Systems
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.