On the public citation graph

Job Scheduling Strategies for Parallel Processing: IPPS/SPDP'98 Workshop, Orlando, Florida, USA, March 30, 1998 Proceedings

https://doi.org/10.1007/bfb0053977
0 signed · 25 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/bfb0053978openalex-snapshot
Metrics and benchmarking for parallel job scheduling
inferredcites →https://doi.org/10.1007/bfb0053982openalex-snapshot
Implementing the combination of time sharing and space sharing on AP/Linux
inferredcites →https://doi.org/10.1007/bfb0053986openalex-snapshot
Probabilistic loop scheduling considering communication overhead

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.1409openalex-snapshot
Accessing RDF(S) data resources in service‐based Grid infrastructures
inferred← citeshttps://doi.org/10.1007/3-540-39997-6_12openalex-snapshot
Adaptive Selection of Partition Size for Supercomputer Requests
inferred← citeshttps://doi.org/10.1007/3-540-45307-5_6openalex-snapshot
On Job Scheduling for HPC-Clusters and the dynP Scheduler
inferred← citeshttps://doi.org/10.1007/3-540-47954-6_10openalex-snapshot
Scheduling a Metacomputer with Uncooperative Sub-schedulers
inferred← citeshttps://doi.org/10.1007/978-3-030-27562-4_9openalex-snapshot
Scalable Optimal Greedy Scheduler for Asymmetric Multi-/Many-Core Processors
inferred← citeshttps://doi.org/10.1007/978-3-540-27866-5_90openalex-snapshot
Designing Parallel Operating Systems via Parallel Programming
inferred← citeshttps://doi.org/10.1007/978-81-322-0740-5_67openalex-snapshot
A Broker Based Architecture for Adaptive Load Balancing and Elastic Resource Provisioning and Deprovisioning in Multi-tenant Based Cloud Environments
inferred← citeshttps://doi.org/10.1007/s11227-009-0365-7openalex-snapshot
Improving job scheduling performance with parallel access to replicas in Data Grid environment
inferred← citeshttps://doi.org/10.1016/j.asoc.2017.12.040openalex-snapshot
Characterization of runtime resource usage from analysis of binary executable programs
inferred← citeshttps://doi.org/10.1016/j.dam.2008.03.005openalex-snapshot
Idle regulation in non-clairvoyant scheduling of parallel jobs
inferred← citeshttps://doi.org/10.1016/j.future.2004.02.001openalex-snapshot
Performance of adaptive space-sharing policies in dedicated heterogeneous cluster systems
inferred← citeshttps://doi.org/10.1016/j.future.2008.09.001openalex-snapshot
SOAs for scientific applications: Experiences and challenges
inferred← citeshttps://doi.org/10.1016/j.future.2012.12.012openalex-snapshot
Online cost-efficient scheduling of deadline-constrained workloads on hybrid clouds
inferred← citeshttps://doi.org/10.1016/j.future.2024.04.023openalex-snapshot
Asynchronous modeling workflows in CyberWater with on-demand HPC/Cloud access
inferred← citeshttps://doi.org/10.1016/j.jpdc.2010.04.004openalex-snapshot
Environment-conscious scheduling of HPC applications on distributed Cloud-oriented data centers
inferred← citeshttps://doi.org/10.1016/s0166-5316(99)00035-8openalex-snapshot
Analysis of job arrival patterns and parallel scheduling performance
inferred← citeshttps://doi.org/10.1023/a:1019024019093openalex-snapshot
A comparative study of online scheduling algorithms for networks of workstations
inferred← citeshttps://doi.org/10.1109/dac.2018.8465916openalex-snapshot
QoS-Aware Stochastic Power Management for Many-Cores
inferred← citeshttps://doi.org/10.1109/sc.2000.10041openalex-snapshot
Randomization, Speculation, and Adaptation in Batch Schedulers
inferred← citeshttps://doi.org/10.1145/3624062.3624201openalex-snapshot
A Reinforcement Learning Based Backfilling Strategy for HPC Batch Jobs
inferred← citeshttps://doi.org/10.1145/377792.377852openalex-snapshot
Improving Gang Scheduling through job performance analysis and malleability
inferred← citeshttps://doi.org/10.21474/ijar01/2260openalex-snapshot
ENHANCE BROKER TOPOLOGY FOR COMPUTATIONAL GRID SYSTEM
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.