On the public citation graph

Implementing the combination of time sharing and space sharing on AP/Linux

https://doi.org/10.1007/bfb0053982
0 signed · 34 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/3-540-62095-8_69openalex-snapshot
Multi-tasking method on parallel computers which combines a contiguous and a non-contiguous processor partitioning algorithm
inferredcites →https://doi.org/10.1007/bfb0022289openalex-snapshot
Packing schemes for gang scheduling
inferredcites →https://doi.org/10.1016/0743-7315(91)90032-5openalex-snapshot
A two-dimensional buddy system for dynamic resource allocation in a partitionable mesh connected system
inferredcites →https://doi.org/10.1016/0743-7315(92)90016-gopenalex-snapshot
Efficient processor allocation strategies for mesh-connected parallel computers
inferredcites →https://doi.org/10.1109/2.53356openalex-snapshot
Distributed hierarchical control for parallel processing
inferredcites →https://doi.org/10.1109/71.598346openalex-snapshot
Noncontiguous processor allocation algorithms for mesh-connected multicomputers
inferredcites →https://doi.org/10.1109/hicss.1995.375465openalex-snapshot
A scalable time-sharing scheduling for partitionable distributed memory parallel machines
inferredcites →https://doi.org/10.1109/icdcs.1991.148674openalex-snapshot
An efficient submesh allocation strategy for mesh computer systems
inferredcites →https://doi.org/10.1109/icdcs.1995.500056openalex-snapshot
An efficient task allocation scheme for two-dimensional mesh-connected systems
inferredcites →https://doi.org/10.1109/icpp.1993.39openalex-snapshot
An Adaptive Submesh Allocation Strategy for Two-Dimensional Mesh Connected Systems
inferredcites →https://doi.org/10.1109/mpidc.1996.534092openalex-snapshot
Implementing MPI under AP/Linux
inferredcites →https://doi.org/10.1109/spdp.1993.395466openalex-snapshot
A fast and efficient strategy for submesh allocation in mesh-connected parallel computers
inferredcites →https://doi.org/10.1109/superc.1994.344323openalex-snapshot
Paging tradeoffs in distributed-shared-memory multiprocessors
inferredcites →https://doi.org/10.1145/602770.602811openalex-snapshot
Non-contiguous processor allocation algorithms for distributed memory multicomputers
inferredcites →https://doi.org/10.5555/602770.602811openalex-snapshot
Non-contiguous processor allocation algorithms for distributed memory multicomputers
inferredcites →https://doi.org/10.5555/602770.602869openalex-snapshot
Paging tradeoffs in distributed-shared-memory multiprocessors

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/10968987_10openalex-snapshot
Gang Scheduling Extensions for I/O Intensive Workloads
inferred← citeshttps://doi.org/10.1007/3-540-44520-x_33openalex-snapshot
The Impact of Migration on Parallel Job Scheduling for Distributed Systems
inferred← citeshttps://doi.org/10.1007/3-540-45540-x_9openalex-snapshot
An Integrated Approach to Parallel Scheduling Using Gang-Scheduling, Backfilling, and Migration
inferred← citeshttps://doi.org/10.1007/3-540-47954-6_8openalex-snapshot
Process Tracking for Parallel Job Control
inferred← citeshttps://doi.org/10.1007/bfb0053977openalex-snapshot
Job Scheduling Strategies for Parallel Processing: IPPS/SPDP'98 Workshop, Orlando, Florida, USA, March 30, 1998 Proceedings
inferred← citeshttps://doi.org/10.1007/bfb0053985openalex-snapshot
Job scheduling strategies for networks of workstations
inferred← citeshttps://doi.org/10.1016/s0167-8191(01)00078-3openalex-snapshot
Efficient processor management schemes for mesh-connected multicomputers
inferred← citeshttps://doi.org/10.1109/71.954632openalex-snapshot
Impact of workload and system parameters on next generation cluster scheduling mechanisms
inferred← citeshttps://doi.org/10.1109/icdcs.2000.840933openalex-snapshot
Scheduling with global information in distributed systems
inferred← citeshttps://doi.org/10.1109/ipdps.2000.845975openalex-snapshot
Improving parallel job scheduling by combining gang scheduling and backfilling techniques
inferred← citeshttps://doi.org/10.1109/ipdps.2000.846019openalex-snapshot
Buffered coscheduling: a new methodology for multitasking parallel jobs on distributed systems
inferred← citeshttps://doi.org/10.1109/ipdps.2013.34openalex-snapshot
Throughput Enhancement through Selective Time Sharing and Dynamic Grouping
inferred← citeshttps://doi.org/10.1109/sc.1998.10026openalex-snapshot
An Infrastructure for Efficient Parallel Job Execution in Terascale Computing Environments
inferred← citeshttps://doi.org/10.1109/sc.1998.10028openalex-snapshot
Optimizing Software Cache-coherent Cluster Architectures
inferred← citeshttps://doi.org/10.1109/tpds.2003.1189582openalex-snapshot
An integrated approach to parallel scheduling using gang-scheduling, backfilling, and migration
inferred← citeshttps://doi.org/10.1145/1048935.1050205openalex-snapshot
Scalable Hardware-Based Multicast Trees
inferred← citeshttps://doi.org/10.5555/509058.509107openalex-snapshot
An Infrastructure for Efficient Parallel Job Execution in Terascale Computing Environments
inferred← citeshttps://doi.org/10.5555/509058.509123openalex-snapshot
Internet based audiovisual communication tools used in a joint engineering design class at the University of Alabama in Huntsville and the Ecole Superieure et de Construction Automobile (ESTACA) in Paris, France
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.