On the public citation graph

OREGAMI: Tools for mapping parallel computations to parallel architectures

https://doi.org/10.1007/bf01379319
0 signed · 75 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-18771-5_46openalex-snapshot
Graph grammar based specification of interconnection structures for massively parallel computation
inferredcites →https://doi.org/10.1007/3-540-19027-9_13openalex-snapshot
Garp: Graph abstractions for concurrent programming
inferredcites →https://doi.org/10.1007/3-540-55599-4_89openalex-snapshot
Application-specific deadlock free wormhole routing on multicomputers
inferredcites →https://doi.org/10.1007/978-1-4613-1077-8openalex-snapshot
Parallel Programming and Compilers
inferredcites →https://doi.org/10.1007/978-1-4613-2003-6openalex-snapshot
Assignment Problems in Parallel and Distributed Computing
inferredcites →https://doi.org/10.1007/bfb0029355openalex-snapshot
The specification of process synchronization by path expressions
inferredcites →https://doi.org/10.1007/bfb0040384openalex-snapshot
Graph embeddings 1988: Recent breakthroughs, new directions
inferredcites →https://doi.org/10.1016/0167-8191(86)90002-5openalex-snapshot
Framework for formulation and analysis of parallel computation structures
inferredcites →https://doi.org/10.1016/0167-8191(90)90105-iopenalex-snapshot
Synthesizing systolic arrays from recurrence equations
inferredcites →https://doi.org/10.1016/0167-8191(90)90115-popenalex-snapshot
Cluster partitioning approaches to mapping parallel programs onto a hypercube
inferredcites →https://doi.org/10.1016/0743-7315(86)90010-9openalex-snapshot
A design methodology for synthesizing parallel algorithms and architectures
inferredcites →https://doi.org/10.1016/0743-7315(87)90018-9openalex-snapshot
On mapping parallel algorithms into parallel architectures
inferredcites →https://doi.org/10.1016/0743-7315(90)90042-nopenalex-snapshot
Scheduling parallel program tasks onto arbitrary target machines
inferredcites →https://doi.org/10.1016/0743-7315(91)90107-kopenalex-snapshot
The DINO parallel programming language
inferredcites →https://doi.org/10.1016/0743-7315(92)90020-nopenalex-snapshot
Temporal communication graphs: Lamport's process-time graphs augmented for the purpose of mapping and scheduling
inferredcites →https://doi.org/10.1090/conm/089/13openalex-snapshot
Problem Corner
inferredcites →https://doi.org/10.1109/12.166603openalex-snapshot
Traffic routing for multicomputer networks with virtual cut-through capability
inferredcites →https://doi.org/10.1109/12.21148openalex-snapshot
A group-theoretic model for symmetric interconnection networks
inferredcites →https://doi.org/10.1109/12.8704openalex-snapshot
Heuristic algorithms for task assignment in distributed systems
inferredcites →https://doi.org/10.1109/32.24720openalex-snapshot
Constructing distributed systems in Conic
inferredcites →https://doi.org/10.1109/52.31648openalex-snapshot
CODE: a unified approach to parallel programming
inferredcites →https://doi.org/10.1109/icdcs.1990.89308openalex-snapshot
Traffic routing for multi-computer networks with virtual cut-through capability
inferredcites →https://doi.org/10.1109/ipps.1992.223064openalex-snapshot
Parallel implementation of divide-and-conquer algorithms on binary de Bruijn networks
inferredcites →https://doi.org/10.1109/mc.1982.1653826openalex-snapshot
Introduction to the configurable, highly parallel computer
inferredcites →https://doi.org/10.1109/tc.1987.1676922openalex-snapshot
Interprocessor Traffic Scheduling Algorithm for Multiple-Processor Networks
inferredcites →https://doi.org/10.1109/tc.1987.1676939openalex-snapshot
Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
inferredcites →https://doi.org/10.1109/tse.1977.233840openalex-snapshot
Multiprocessor Scheduling with the Aid of Network Flow Algorithms
inferredcites →https://doi.org/10.1145/2465.2467openalex-snapshot
The cosmic cube
inferredcites →https://doi.org/10.1145/3335772.3335934openalex-snapshot
Time, clocks, and the ordering of events in a distributed system
inferredcites →https://doi.org/10.1145/359460.359478openalex-snapshot
A data structure for manipulating priority queues
inferredcites →https://doi.org/10.1145/359545.359563openalex-snapshot
Time, clocks, and the ordering of events in a distributed system
inferredcites →https://doi.org/10.21236/ada459435openalex-snapshot
The DINO Parallel Programming Language

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9780470121177.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1002/cpe.4330070508openalex-snapshot
A framework for partitioning parallel computations in heterogeneous environments
inferred← citeshttps://doi.org/10.1007/3-540-38076-0_22openalex-snapshot
TOPPER: An Integrated Environment for Task Allocation and Execution of MPI Applications onto Parallel Architectures
inferred← citeshttps://doi.org/10.1007/3-540-44942-6_12openalex-snapshot
A Platform Independent Parallelising Tool Based on Graph Theoretic Models
inferred← citeshttps://doi.org/10.1007/3-540-45417-9_23openalex-snapshot
TOPPER: A Tool for Optimizing the Performance of Parallel Applications
inferred← citeshttps://doi.org/10.1007/3-540-55599-4_89openalex-snapshot
Application-specific deadlock free wormhole routing on multicomputers
inferred← citeshttps://doi.org/10.1007/3-540-63371-5_28openalex-snapshot
3D visual tool supporting derivation of parallel programs for MIMD systems
inferred← citeshttps://doi.org/10.1007/978-1-4614-4274-5_1openalex-snapshot
Network-on-Chip Technology: A Paradigm Shift
inferred← citeshttps://doi.org/10.1007/978-3-540-24669-5_123openalex-snapshot
Performance Study of Scheduling Mechanisms for Peer-to-Peer Computing Environments
inferred← citeshttps://doi.org/10.1007/978-3-642-19595-2_16openalex-snapshot
CnC-CUDA: Declarative Programming for GPUs
inferred← citeshttps://doi.org/10.1007/978-94-011-5514-4_15openalex-snapshot
Automatic Coarse-Grained Parallelization Techniques
inferred← citeshttps://doi.org/10.1007/bfb0002747openalex-snapshot
A graphical tool for automatic parallelization and scheduling of programs on multiprocessors
inferred← citeshttps://doi.org/10.1016/0743-7315(92)90020-nopenalex-snapshot
Temporal communication graphs: Lamport's process-time graphs augmented for the purpose of mapping and scheduling
inferred← citeshttps://doi.org/10.1016/s0743-7315(03)00013-3openalex-snapshot
Integrated scheduling: the best of both worlds
inferred← citeshttps://doi.org/10.1016/s1383-7621(03)00011-0openalex-snapshot
Clustering and reassignment-based mapping strategy for message-passing architectures
inferred← citeshttps://doi.org/10.1023/a:1008171232465openalex-snapshot
An Architecture-Independent Graphical Tool for Automatic Contention-Free Process-to-Processor Mapping
inferred← citeshttps://doi.org/10.1049/iet-cdt:20070049openalex-snapshot
Low-power algorithm for automatic topology generation for application-specific networks on chips
inferred← citeshttps://doi.org/10.1109/4434.895101openalex-snapshot
CASCH: a tool for computer-aided scheduling
inferred← citeshttps://doi.org/10.1109/71.308535openalex-snapshot
E-kernel: an embedding kernel on the IBM victor V256 multiprocessor for program mapping and network reconfiguration
inferred← citeshttps://doi.org/10.1109/71.569653openalex-snapshot
pp-mess-sim: a flexible and extensible simulator for evaluating multicomputer networks
inferred← citeshttps://doi.org/10.1109/aero.1996.496067openalex-snapshot
A scheduling tool for parallel and distributed systems
inferred← citeshttps://doi.org/10.1109/aqsdt.1994.315759openalex-snapshot
PARSA: a parallel program software development tool
inferred← citeshttps://doi.org/10.1109/cca.1994.381214openalex-snapshot
Simulation of parallel time-critical programs with the DYNAMO system
inferred← citeshttps://doi.org/10.1109/cgc.2013.30openalex-snapshot
Exploiting Network-Topology Awareness for VM Placement in IaaS Clouds
inferred← citeshttps://doi.org/10.1109/cpsna.2014.13openalex-snapshot
Simple One-to-One Architecture for Parallel Execution of Embedded Control Systems
inferred← citeshttps://doi.org/10.1109/date.2004.1269002openalex-snapshot
Bandwidth-constrained mapping of cores onto NoC architectures
inferred← citeshttps://doi.org/10.1109/ddecs.2008.4538763openalex-snapshot
Cluster-based Simulated Annealing for Mapping Cores onto 2D Mesh Networks on Chip
inferred← citeshttps://doi.org/10.1109/empdp.2000.823437openalex-snapshot
An efficient algorithm for the physical mapping of clustered task graphs onto multiprocessor architectures
inferred← citeshttps://doi.org/10.1109/hicss.1995.375471openalex-snapshot
Automatic task graph generation techniques
inferred← citeshttps://doi.org/10.1109/hipc.1997.634493openalex-snapshot
Parallel program design in visual environment
inferred← citeshttps://doi.org/10.1109/hpdc.1994.340249openalex-snapshot
Network partitioning of data parallel computations
inferred← citeshttps://doi.org/10.1109/icpp.1993.138openalex-snapshot
PARSA: A Parallel Program Scheduling and Assessment Environment
inferred← citeshttps://doi.org/10.1109/ipps.1994.288241openalex-snapshot
Clustering and intra-processor scheduling for explicitly-parallel programs on distributed-memory systems
inferred← citeshttps://doi.org/10.1109/ipps.1998.669950openalex-snapshot
Clustering and reassignment-based mapping strategy for message-passing architectures
inferred← citeshttps://doi.org/10.1109/isscs.2007.4292678openalex-snapshot
SMAP: An Intelligent Mapping tool for Network on Chip
inferred← citeshttps://doi.org/10.1109/isspit.2008.4775656openalex-snapshot
Randomized Algorithms for Mapping Clustered Object-Oriented Software onto Distributed Architectures
inferred← citeshttps://doi.org/10.1145/1297666.1297678openalex-snapshot
Tailoring circuit-switched network-on-chip to application-specific system-on-chip by two optimization schemes
inferred← citeshttps://doi.org/10.1145/165939.165973openalex-snapshot
The NuMesh
inferred← citeshttps://doi.org/10.1145/344588.344618openalex-snapshot
Static scheduling algorithms for allocating directed task graphs to multiprocessors
inferred← citeshttps://doi.org/10.1155/1997/586912openalex-snapshot
Towards Architecture‐Adaptable Parallel Programming
inferred← citeshttps://doi.org/10.14711/thesis-b556245openalex-snapshot
High-performance algorithms for compile-time scheduling of parallel processors
inferred← citeshttps://doi.org/10.18130/v34r9jopenalex-snapshot
Scheduling Parallel Computations in a Heterogeneous Environment
inferred← citeshttps://doi.org/10.5555/968879.969207openalex-snapshot
Bandwidth-constrained mapping of cores onto NoC architectures
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.