On the public citation graph
Improved algorithms for mapping pipelined and parallel computations
0 signed · 77 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/bf01933729openalex-snapshot
Sorting in parallel by double distributive partitioning
inferredcites →https://doi.org/10.1109/12.75137openalex-snapshot
Partitioning problems in parallel, pipeline, and distributed computing
inferredcites →https://doi.org/10.1109/tc.1987.1676924openalex-snapshot
The Effects of Problem Partitioning, Allocation, and Granularity on the Performance of Multiple-Processor Systems
inferredcites →https://doi.org/10.1109/tc.1987.1676942openalex-snapshot
A Partitioning Strategy for Nonuniform Problems on Multiprocessors
inferredcites →https://doi.org/10.1109/tc.1987.1676980openalex-snapshot
Stencils and Problem Partitionings: Their Influence on the Performance of Multiple Processor Systems
inferredcites →https://doi.org/10.1109/tc.1987.5009494openalex-snapshot
Nearest-Neighbor Mapping of Finite Element Graphs onto Processor Meshes
inferredcites →https://doi.org/10.1109/tc.1987.5009502openalex-snapshot
The Warp Computer: Architecture, Implementation, and Performance
inferredcites →https://doi.org/10.1109/tse.1977.233840openalex-snapshot
Multiprocessor Scheduling with the Aid of Network Flow Algorithms
inferredcites →https://doi.org/10.1109/tse.1978.231502openalex-snapshot
Critical Load Factors in Two-Processor Distributed Systems
inferredcites →https://doi.org/10.1109/tse.1981.226469openalex-snapshot
A Shortest Tree Algorithm for Optimal Assignments Across Space and Time in a Distributed Processor System
inferredcites →https://doi.org/10.1109/tse.1986.6313018openalex-snapshot
Allocating programs containing branches and loops within a multiple processor system
inferredcites →https://doi.org/10.1137/0216063openalex-snapshot
Optimal Parallel Sorting Scheme by Order Statistics
inferredcites →https://doi.org/10.1137/0908016openalex-snapshot
Reduction of the Effects of the Communication Delays in Scientific Algorithms on Message Passing MIMD Architectures
inferredcites →https://doi.org/10.1145/321623.321627openalex-snapshot
Optimal Sequential Partitions of Graphs
inferredcites →https://doi.org/10.1287/opre.38.6.993openalex-snapshot
A Multistage Linear Array Assignment Problem
inferredcites →https://doi.org/10.13182/nse68-a19548openalex-snapshot
The Art of Computer Programming
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/spe.4380250603openalex-snapshot
Runtime and language support for compiling adaptive irregular programs on distributed‐memory machines
inferred← citeshttps://doi.org/10.1006/jagm.2002.1221openalex-snapshot
Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem
inferred← citeshttps://doi.org/10.1006/jpdc.1993.1117openalex-snapshot
Efficient Algorithms for Mapping and Partitioning a Class of Parallel Computations
inferred← citeshttps://doi.org/10.1006/jpdc.1994.1062openalex-snapshot
Program Speedup in a Heterogeneous Computing Network
inferred← citeshttps://doi.org/10.1006/jpdc.1994.1126openalex-snapshot
Rectilinear Partitioning of Irregular Data Parallel Computations
inferred← citeshttps://doi.org/10.1006/jpdc.1999.1596openalex-snapshot
Optimal Use of Mixed Task and Data Parallelism for Pipelined Computations
inferred← citeshttps://doi.org/10.1007/3-540-45253-2_20openalex-snapshot
Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem
inferred← citeshttps://doi.org/10.1007/3-540-62828-2_112openalex-snapshot
Markov chain based management of large scale distributed computations of earthen dam leakages
inferred← citeshttps://doi.org/10.1007/978-3-319-07941-7_26openalex-snapshot
Deterministic Control of the Scalable High Performance Distributed Computations
inferred← citeshttps://doi.org/10.1007/978-3-540-72588-6_69openalex-snapshot
Context-Aware Optimal Assignment of a Chain-Like Processing Task onto Chain-Like Resources in M-Health
inferred← citeshttps://doi.org/10.1007/978-3-540-77255-2_74openalex-snapshot
Context Aware Body Area Networks for Telemedicine
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90054-yopenalex-snapshot
Mapping a chain task to chained processors
inferred← citeshttps://doi.org/10.1016/j.amc.2006.06.071openalex-snapshot
Multi-objective task allocation in distributed computing systems by hybrid particle swarm optimization
inferred← citeshttps://doi.org/10.1016/j.csi.2005.03.005openalex-snapshot
A hybrid particle swarm optimization algorithm for optimal task assignment in distributed systems
inferred← citeshttps://doi.org/10.1016/j.jpdc.2004.05.003openalex-snapshot
Fast optimal load balancing algorithms for 1D partitioning
inferred← citeshttps://doi.org/10.1016/j.parco.2006.01.002openalex-snapshot
Optimal partitioning of nodes to space-sharing parallel tasks
inferred← citeshttps://doi.org/10.1016/s0167-8191(98)00049-0openalex-snapshot
Data-parallel load balancing strategies
inferred← citeshttps://doi.org/10.1016/s0377-2217(99)00251-9openalex-snapshot
Assignment of program modules to processors: A simulated annealing approach
inferred← citeshttps://doi.org/10.1080/08993400903255226openalex-snapshot
Planning readings: a comparative exploration of basic algorithms
inferred← citeshttps://doi.org/10.1109/71.273050openalex-snapshot
Optimal processor assignment for a class of pipelined computations
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.342129openalex-snapshot
Efficient algorithms for a class of partitioning problems
inferred← citeshttps://doi.org/10.1109/71.577254openalex-snapshot
Optimal task assignment in homogeneous networks
inferred← citeshttps://doi.org/10.1109/71.615437openalex-snapshot
Allocating task interaction graphs to processors in heterogeneous networks
inferred← citeshttps://doi.org/10.1109/71.877776openalex-snapshot
Distributed multimedia application configuration management
inferred← citeshttps://doi.org/10.1109/aina.2005.265openalex-snapshot
On the Power-Aware Resource Allocation for Linear-Pipelined Real-Time Tasks
inferred← citeshttps://doi.org/10.1109/asap.1994.331813openalex-snapshot
A methodology for performance prediction of Sphinx I in multi-computer architectures
inferred← citeshttps://doi.org/10.1109/camp.1993.622485openalex-snapshot
Heterogeneous partitioning of chain structured image processing tasks
inferred← citeshttps://doi.org/10.1109/cec.2007.4424811openalex-snapshot
Context-aware task assignment in ubiquitous computing environment - A genetic algorithm based approach
inferred← citeshttps://doi.org/10.1109/dmcc.1991.633117openalex-snapshot
The Assign Parallel Program Generator
inferred← citeshttps://doi.org/10.1109/hcw.1994.324963openalex-snapshot
Partitioning of image processing tasks on heterogeneous computer systems
inferred← citeshttps://doi.org/10.1109/hipc.1997.634497openalex-snapshot
Sparse matrix decomposition with optimal load balancing
inferred← citeshttps://doi.org/10.1109/hpcs.2017.59openalex-snapshot
Performance Evaluation of a Parallel Dynamic Programming Algorithm for Solving the 1D Array Partitioning Problem
inferred← citeshttps://doi.org/10.1109/hpcs.2017.63openalex-snapshot
An Exact Pseudo-Linearithmic Binary Search Algorithm for Scheduling Independent Tasks under Contiguity Constraint
inferred← citeshttps://doi.org/10.1109/icdcs.1994.302437openalex-snapshot
Improved algorithms for partitioning tree and linear task graphs on shared memory architecture
inferred← citeshttps://doi.org/10.1109/icdcs.1999.776505openalex-snapshot
Reducing message overhead in TMR systems
inferred← citeshttps://doi.org/10.1109/icpads.2002.1183491openalex-snapshot
Module filtering preprocessing for module assignment problems in pipelined computing
inferred← citeshttps://doi.org/10.1109/icpp.1994.181openalex-snapshot
Sequential and Parallel Algorithms for Partitioning Tree Task Graphs on Shared Memory Architecture
inferred← citeshttps://doi.org/10.1109/icpp.2005.42openalex-snapshot
Filter decomposition for supporting coarse-grained pipelined parallelism
inferred← citeshttps://doi.org/10.1109/robot.2006.1642118openalex-snapshot
AutoPower: toward energy-aware software systems for distributed mobile robots
inferred← citeshttps://doi.org/10.1109/sasp.2011.5941072openalex-snapshot
Customized MPSoC synthesis for task sequence
inferred← citeshttps://doi.org/10.1109/shpcc.1994.296641openalex-snapshot
Adaptive runtime support for direct simulation Monte Carlo methods on distributed memory architectures
inferred← citeshttps://doi.org/10.1109/superc.1994.344269openalex-snapshot
Run-time and compile-time support for adaptive irregular problems
inferred← citeshttps://doi.org/10.1109/superc.1994.344296openalex-snapshot
Communication and memory requirements as the basis for mapping task and data parallel programs
inferred← citeshttps://doi.org/10.1109/whp.1993.664363openalex-snapshot
Heuristics for Mapping Parallel Computations to Parallel Architectures
inferred← citeshttps://doi.org/10.1145/1569901.1570094openalex-snapshot
Evolutionary algorithms for the mapping of pipelined applications onto heterogeneous embedded systems
inferred← citeshttps://doi.org/10.1145/1629435.1629495openalex-snapshot
Mapping pipelined applications onto heterogeneous embedded systems
inferred← citeshttps://doi.org/10.1145/326619.326815openalex-snapshot
A parallel algorithm for mapping a special class of task graphs onto linear array multiprocessors
inferred← citeshttps://doi.org/10.1145/602770.602793openalex-snapshot
Run-time and compile-time support for adaptive irregular problems
inferred← citeshttps://doi.org/10.1145/602791.602793openalex-snapshot
Run-time and compile-time support for adaptive irregular problems
inferred← citeshttps://doi.org/10.1177/003754970007500105openalex-snapshot
Reducing Rollbacks Through Partitioning in PCS Parallel Simulation
inferred← citeshttps://doi.org/10.15760/etd.6418openalex-snapshot
Mapping Programs to Parallel Architectures in the Real World
inferred← citeshttps://doi.org/10.18130/v34r9jopenalex-snapshot
Scheduling Parallel Computations in a Heterogeneous Environment
inferred← citeshttps://doi.org/10.18419/opus-2410openalex-snapshot
Task allocation in distributed multimedia systems based on the host-satellite model
inferred← citeshttps://doi.org/10.2174/18740618009030100016openalex-snapshot
Metaheuristic Algorithms for Task Assignment in Distributed Computing Systems: A Comparative and Integrative Approach
inferred← citeshttps://doi.org/10.31274/rtd-180813-9550openalex-snapshot
The assignment problem in distributed computing
inferred← citeshttps://doi.org/10.34737/90644openalex-snapshot
Dynamic load balancing of parallel road traffic simulation
inferred← citeshttps://doi.org/10.3990/1.9789036530262openalex-snapshot
Task distribution based adaptation in mobile patient monitoring systems
inferred← citeshttps://doi.org/10.5555/602770.602832openalex-snapshot
Communication and memory requirements as the basis for mapping task and data parallel programs
inferred← citeshttps://doi.org/10.7155/jgaa.00031openalex-snapshot
Clustering in Trees: Optimizing Cluster Sizes and Number of Subtrees
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.