On the public citation graph
Implementing a dynamic processor allocation policy for multiprogrammed parallel applications in the SolarisTM
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.
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-60153-8_22openalex-snapshot
A scalable multi-discipline, multiple-processor scheduling framework for IRIX
inferredcites →https://doi.org/10.1007/978-1-4612-3192-9_24openalex-snapshot
SunOS Multi-Thread Architecture
inferredcites →https://doi.org/10.1007/bfb0024757openalex-snapshot
Application-assisted dynamic scheduling on large-scale multi-computer systems
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/2.261915openalex-snapshot
Exploiting the parallelism available in loops
inferredcites →https://doi.org/10.1109/icpp.1996.538561openalex-snapshot
Performance analysis and prediction of processor scheduling strategies in multiprogrammed shared-memory multiprocessors
inferredcites →https://doi.org/10.1109/ipps.1996.508094openalex-snapshot
Efficient execution of parallel applications in multiprogrammed multiprocessor systems
inferredcites →https://doi.org/10.1109/ipps.1998.669946openalex-snapshot
Dynamic processor allocation with the Solaris operating system
inferredcites →https://doi.org/10.1145/107971.107985openalex-snapshot
The impact of operating system scheduling policies and synchronization methods of performance of parallel applications
inferredcites →https://doi.org/10.1145/169627.169848openalex-snapshot
Performance analysis of job scheduling policies in parallel supercomputing environments
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-540-71035-6_1openalex-snapshot
Provably Efficient Two-Level Adaptive Scheduling
inferred← citeshttps://doi.org/10.1016/j.jpdc.2009.03.004openalex-snapshot
Improved results for scheduling batched parallel jobs by using a generalized analysis framework
inferred← citeshttps://doi.org/10.1049/iet-cdt.2018.5220openalex-snapshot
Amdahl's law in the context of heterogeneous many‐core systems – a survey
inferred← citeshttps://doi.org/10.1109/icdcs.2006.14openalex-snapshot
An empirical evaluation of work stealing with parallelism feedback
inferred← citeshttps://doi.org/10.1109/icpp.2007.12openalex-snapshot
Adaptive Scheduling of Parallel Jobs on Functionally Heterogeneous Resources
inferred← citeshttps://doi.org/10.1109/ipdps.2007.370303openalex-snapshot
Provably Efficient Online Non-clairvoyant Adaptive Scheduling
inferred← citeshttps://doi.org/10.1109/ipdps.2007.370496openalex-snapshot
Adaptive Scheduling with Parallelism Feedback
inferred← citeshttps://doi.org/10.1109/ipdpsw.2010.5470909openalex-snapshot
Dynamic core partitioning for energy efficiency
inferred← citeshttps://doi.org/10.1145/1122971.1122988openalex-snapshot
Adaptive scheduling with parallelism feedback
inferred← citeshttps://doi.org/10.1145/1229428.1229448openalex-snapshot
Adaptive work stealing with parallelism feedback
inferred← citeshttps://doi.org/10.1145/1394441.1394443openalex-snapshot
Adaptive work-stealing with parallelism feedback
inferred← citeshttps://doi.org/10.32657/10356/60519openalex-snapshot
Provably efficient adaptive scheduling of parallel jobs on multiprocessors
inferred← citeshttps://doi.org/10.4018/ijghpc.2017040104openalex-snapshot
Competitive Processors Allocation in 2D Mesh Connected Multicomputer Networks
inferred← citeshttps://doi.org/10.5772/6341openalex-snapshot
Provably-Efficient Online Adaptive Scheduling of Parallel Jobs Based on Simple Greedy Rules
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.