On the public citation graph
Forget the Deadline: Scheduling Interactive Applications in Data Centers
0 signed · 37 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/3-540-44679-6_51openalex-snapshot
Competitive Online Scheduling with Level of Service
inferredcites →https://doi.org/10.1007/3-540-45071-8_43openalex-snapshot
Improved Competitive Algorithms for Online Scheduling with Partial Job Values
inferredcites →https://doi.org/10.1016/j.tcs.2004.02.046openalex-snapshot
Improved competitive algorithms for online scheduling with partial job values
inferredcites →https://doi.org/10.1023/a:1008044430932openalex-snapshot
Criticality- and QoS-Based Multiresource Negotiation and Adaptation
inferredcites →https://doi.org/10.1109/allerton.2012.6483429openalex-snapshot
Performance analysis of work-conserving schedulers for minimizing total flow-time with phase precedence
inferredcites →https://doi.org/10.1109/infcom.2010.5462070openalex-snapshot
Utility Maximization for Delay Constrained QoS in Wireless
inferredcites →https://doi.org/10.1109/infcom.2011.5935152openalex-snapshot
Scheduling in mapreduce-like systems for fast completion time
inferredcites →https://doi.org/10.1109/infcom.2012.6195473openalex-snapshot
Joint scheduling of processing and Shuffle phases in MapReduce systems
inferredcites →https://doi.org/10.1109/infcom.2013.6566956openalex-snapshot
A new analytical technique for designing provably efficient MapReduce schedulers
inferredcites →https://doi.org/10.1109/infocom.2015.7218405openalex-snapshot
Exploiting large system dynamics for designing simple data center schedulers
inferredcites →https://doi.org/10.1109/tc.2003.1197134openalex-snapshot
User-level qos-adaptive resource management in server end-systems
inferredcites →https://doi.org/10.1109/tcsvt.2003.809829openalex-snapshot
QoS-adaptive proxy caching for multimedia streaming over the internet
inferredcites →https://doi.org/10.1145/2371536.2371557openalex-snapshot
Budget-based control for interactive services with adaptive execution
inferredcites →https://doi.org/10.2200/s00507ed1v01y201305cnt014openalex-snapshot
Packets with Deadlines: A Framework for Real-Time Wireless Networks
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.6037openalex-snapshot
An efficient deadline constrained and data locality aware dynamic scheduling framework for multitenancy clouds
inferred← citeshttps://doi.org/10.1016/j.peva.2021.102229openalex-snapshot
Elastic job scheduling with unknown utility functions
inferred← citeshttps://doi.org/10.1109/bdcloud-socialcom-sustaincom.2016.37openalex-snapshot
Optimal Assignment for Deadline Aware Tasks in the Crowdsourcing
inferred← citeshttps://doi.org/10.1109/glocom.2017.8254631openalex-snapshot
Online SLA-Aware Multi-Resource Allocation for Deadline Sensitive Jobs in Edge-Clouds
inferred← citeshttps://doi.org/10.1109/infocom.2016.7524430openalex-snapshot
Online multi-resource allocation for deadline sensitive jobs with partial values in the cloud
inferred← citeshttps://doi.org/10.1109/infocom.2018.8486323openalex-snapshot
Online Partial Throughput Maximization for Multidimensional Coflow
inferred← citeshttps://doi.org/10.1109/iwqos.2018.8624184openalex-snapshot
Competitive Online Scheduling Algorithms with Applications in Deadline-Constrained EV Charging
inferred← citeshttps://doi.org/10.1109/tase.2021.3093341openalex-snapshot
SHWS: Stochastic Hybrid Workflows Dynamic Scheduling in Cloud Container Services
inferred← citeshttps://doi.org/10.1109/tmc.2016.2577585openalex-snapshot
Maximizing Charging Satisfaction of Smartphone Users via Wireless Energy Transfer
inferred← citeshttps://doi.org/10.1109/tnet.2017.2781200openalex-snapshot
Scheduling Frameworks for Cloud Container Services
inferred← citeshttps://doi.org/10.1109/tnet.2018.2882557openalex-snapshot
Action-Based Scheduling: Leveraging App Interactivity for Scheduler Efficiency
inferred← citeshttps://doi.org/10.1109/tnet.2022.3182890openalex-snapshot
Learning-NUM: Network Utility Maximization With Unknown Utility Functions and Queueing Delay
inferred← citeshttps://doi.org/10.1109/tnsm.2016.2618394openalex-snapshot
Reactive Pricing: An Adaptive Pricing Policy for Cloud Providers to Maximize Profit
inferred← citeshttps://doi.org/10.1145/3055280openalex-snapshot
Obtaining and Managing Answer Quality for Online Data-Intensive Services
inferred← citeshttps://doi.org/10.1145/3529113.3529137openalex-snapshot
Elastic Job Scheduling with Unknown Utility Functions
inferred← citeshttps://doi.org/10.11575/prism/31816openalex-snapshot
Efficient Algorithms for Dynamic Cloud Resource Provisioning
inferred← citeshttps://doi.org/10.1186/s13638-017-0986-0openalex-snapshot
Scheduling multi-task jobs with extra utility in data centers
inferred← citeshttps://doi.org/10.48550/arxiv.1506.05172openalex-snapshot
Measuring and Managing Answer Quality for Online Data-Intensive Services
inferred← citeshttps://doi.org/10.70675/51170576zc49ez4d22z9fd9z1815c558880eopenalex-snapshot
Optimal resource allocation strategies for electric vehicles in smart grids
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.