Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Journal of the ACM (JACM)
Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases
Journal of the ACM (JACM)
Parallel and adaptive algorithms for problems in scientific and medical computing (multiprocessor, parabolic partial, differential equation, iterative, sor, communication)
Partitioning programs for parallel execution
ICS '88 Proceedings of the 2nd international conference on Supercomputing
Design of partially replicated distributed database systems: an integrated methodology
SIGMETRICS '88 Proceedings of the 1988 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Optimal selection theory for superconcurrency
Proceedings of the 1989 ACM/IEEE conference on Supercomputing
Optimal Dynamic Remapping of Data Parallel Computations
IEEE Transactions on Computers
Dynamic partitioning in a transputer environment
SIGMETRICS '90 Proceedings of the 1990 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Improved Algorithms for Mapping Pipelined and Parallel Computations
IEEE Transactions on Computers
Improved Algorithms for Partitioning Problems in Parallel, Pipelined, and Distributed Computing
IEEE Transactions on Computers
Optimal Task Assignment in Linear Array Networks
IEEE Transactions on Computers
Automatic partitioning of a program dependence graph into parallel tasks
IBM Journal of Research and Development
Models of machines and computation for mapping in multicomputers
ACM Computing Surveys (CSUR)
An optimal upper bound on the minimal completion time in distributed supercomputing
ICS '94 Proceedings of the 8th international conference on Supercomputing
Efficient Algorithms for a Class of Partitioning Problems
IEEE Transactions on Parallel and Distributed Systems
A metrics-driven approach for utilizing concurrency in object-oriented real-time systems
ACM SIGPLAN OOPS Messenger - Special issue: object-oriented real-time systems
Optimal Task Assignment in Homogeneous Networks
IEEE Transactions on Parallel and Distributed Systems
Task Allocation Algorithms for Maximizing Reliability of Distributed Computing Systems
IEEE Transactions on Computers
Allocating Task Interaction Graphs to Processors in Heterogeneous Networks
IEEE Transactions on Parallel and Distributed Systems
Using Recorded Values for Bounding the Minimum Completion Time in Multiprocessors
IEEE Transactions on Parallel and Distributed Systems
The Coign automatic distributed partitioning system
OSDI '99 Proceedings of the third symposium on Operating systems design and implementation
ISCA '90 Proceedings of the 17th annual international symposium on Computer Architecture
A parallel algorithm for mapping a special class of task graphs onto linear array multiprocessors
SAC '94 Proceedings of the 1994 ACM symposium on Applied computing
Distributed Multimedia Application Configuration Management
IEEE Transactions on Parallel and Distributed Systems
Assigning chain-like tasks to a chain-like network
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
SOS: synthesis of application-specific heterogeneous multiprocessor systems
Readings in hardware/software co-design
Task Parallelism in a High Performance Fortran Framework
IEEE Parallel & Distributed Technology: Systems & Technology
Efficient Partitioning of Sequences
IEEE Transactions on Computers
IEEE Transactions on Parallel and Distributed Systems
Efficient Task Migration Algorithm for Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Fast Allocation of Processes in Distributed and Parallel Systems
IEEE Transactions on Parallel and Distributed Systems
Optimal Processor Assignment for a Class of Pipelined Computations
IEEE Transactions on Parallel and Distributed Systems
On Rectangular Partitionings in Two Dimensions: Algorithms, Complexity, and Applications
ICDT '99 Proceedings of the 7th International Conference on Database Theory
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Task and data parallelism in P3L
Patterns and skeletons for parallel and distributed computing
Recursive Bipartitioning of Signal Flow Graphs for Programmable Video Signal Processors
EDTC '96 Proceedings of the 1996 European conference on Design and Test
On k-ary n-cubes: theory and applications
Discrete Applied Mathematics - Special issue: Algorithmic aspects of communication
Decentralizing execution of composite web services
OOPSLA '04 Proceedings of the 19th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Fast optimal load balancing algorithms for 1D partitioning
Journal of Parallel and Distributed Computing
Approximation algorithms for array partitioning problems
Journal of Algorithms
Optimal partitioning of nodes to space-sharing parallel tasks
Parallel Computing
Computational models for image processing for shared-memory multiprocessors
Integrated Computer-Aided Engineering
Bounding the minimal completion time in high-performance parallel processing
International Journal of High Performance Computing and Networking
Mapping pipeline skeletons onto heterogeneous platforms
Journal of Parallel and Distributed Computing
Mapping Pipeline Skeletons onto Heterogeneous Platforms
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007
ICAC '09 Proceedings of the 6th international conference on Autonomic computing
Optimized on-chip pipelining of memory-intensive computations on the cell BE
ACM SIGARCH Computer Architecture News
Placing pipeline stages on a Grid: Single path and multipath pipeline execution
Future Generation Computer Systems
Context aware body area networks for telemedicine
PCM'07 Proceedings of the multimedia 8th Pacific Rim conference on Advances in multimedia information processing
Smart distribution of bio-signal processing tasks in m-health
OTM'07 Proceedings of the 2007 OTM confederated international conference on On the move to meaningful internet systems - Volume Part I
Reassortment Networks for Investigating the Evolution of Segmented Viruses
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Two-constraint domain decomposition with Space Filling Curves
Parallel Computing
Recommendation systems with complex constraints: A course recommendation perspective
ACM Transactions on Information Systems (TOIS)
CloudOpt: multi-goal optimization of application deployments across a cloud
Proceedings of the 7th International Conference on Network and Services Management
Relations between two common types of rectangular tilings
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Load-balancing spatially located computations using rectangular partitions
Journal of Parallel and Distributed Computing
A survey of pipelined workflow scheduling: Models and algorithms
ACM Computing Surveys (CSUR)
| Hi-index | 15.00 |
The problem of optimally assigning the modules of a parallel program over the processors of a multiple-computer system is addressed. A sum-bottleneck path algorithm is developed that permits the efficient solution of many variants of this problem under some constraints on the structure of the partitions. In particular, the following problems are solved optimally for a single-host, multiple-satellite system: partitioning multiple chain-structures parallel programs, multiple arbitrarily structured serial programs, and single-tree structured parallel programs. In addition, the problem of partitioning chain-structured parallel programs across chain-connected systems is solved under certain constraints. All solutions for parallel programs are equally applicable to pipelined programs.