Sequencing Aspects of Multiprogramming
Journal of the ACM (JACM)
An Automatic Sequencing Procedure with Application to Parallel Programming
Journal of the ACM (JACM)
A study of a model for parallel computations
A study of a model for parallel computations
Static scheduling of synchronous data flow programs for digital signal processing
IEEE Transactions on Computers
The use of a synchronizer yields maximum computation rate in distributed networks
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Static Rate-Optimal Scheduling of Iterative Data-Flow Programs Via Optimum Unfolding
IEEE Transactions on Computers
Analysis of free schedule in periodic graphs
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
A novel framework of register allocation for software pipelining
POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Minimizing register requirements under resource-constrained rate-optimal software pipelining
MICRO 27 Proceedings of the 27th annual international symposium on Microarchitecture
Scheduling and mapping: software pipelining in the presence of structural hazards
PLDI '95 Proceedings of the ACM SIGPLAN 1995 conference on Programming language design and implementation
ISSS '95 Proceedings of the 8th international symposium on System synthesis
A Framework for Resource-Constrained Rate-Optimal Software Pipelining
IEEE Transactions on Parallel and Distributed Systems
Determining the Order of Processor Transactions in StaticallyScheduled Multiprocessors
Journal of VLSI Signal Processing Systems
Constraint analysis for DSP code generation
ISSS '97 Proceedings of the 10th international symposium on System synthesis
Analyzing Asynchronous Pipeline Schedules
International Journal of Parallel Programming
Rate analysis for embedded systems
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Legality and Other Properties of Graph Models of Computations
Journal of the ACM (JACM)
A Study of Schedules as Models of Synchronous Parallel Computation
Journal of the ACM (JACM)
A Survey of Some Theoretical Aspects of Multiprocessing
ACM Computing Surveys (CSUR)
ACM Transactions on Programming Languages and Systems (TOPLAS)
A constraint driven approach to loop pipelining and register binding
Proceedings of the conference on Design, automation and test in Europe
Rate analysis for embedded systems
Readings in hardware/software co-design
Constraint analysis for DSP code generation
Readings in hardware/software co-design
Discrete Event Dynamic Systems
Minimizing Buffer Requirements under Rate-Optimal Schedule in Regular Dataflow Networks
Journal of VLSI Signal Processing Systems
Enhanced Co-Scheduling: A Software Pipelining Method Using Modulo-Scheduled Pipeline Theory
International Journal of Parallel Programming
Scheduling for Embedded Real-Time Systems
IEEE Design & Test
Heuristic Algorithms for Scheduling Iterative Task Computations on Distributed Memory Machines
IEEE Transactions on Parallel and Distributed Systems
Self-Timed Resynchronization: A Post-Optimization for Static Multiprocessor Schedules
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
From max-plus algebra to nonexpansive mappings: a nonlinear theory for discrete event systems
Theoretical Computer Science
Register allocation for optimal loop scheduling
CASCON '93 Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: distributed computing - Volume 2
Decentralizing execution of composite web services
OOPSLA '04 Proceedings of the 19th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
LISA '01 Proceedings of the 15th USENIX conference on System administration
Modelling run-time arbitration by latency-rate servers in dataflow graphs
SCOPES '07 Proceedingsof the 10th international workshop on Software & compilers for embedded systems
High-level synthesis of DSP applications using adaptive negative cycle detection
EURASIP Journal on Applied Signal Processing
Scheduling multiple independent hard-real-time jobs on a heterogeneous multiprocessor
EMSOFT '07 Proceedings of the 7th ACM & IEEE international conference on Embedded software
A new strategy for multiprocessor scheduling of cyclic task graphs
International Journal of High Performance Computing and Networking
A general model for cyclic machine scheduling problems
Discrete Applied Mathematics
Note: A connection between circular colorings and periodic schedules
Discrete Applied Mathematics
Modular performance analysis of cyclic dataflow graphs
EMSOFT '09 Proceedings of the seventh ACM international conference on Embedded software
A Comparison of Some Theoretical Models of Parallel Computation
IEEE Transactions on Computers
The Role of Back-Pressure in Implementing Latency-Insensitive Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Journal of Computer and System Sciences
Bandwidth Allocation for Iterative Data-Dependent E-science Applications
CCGRID '10 Proceedings of the 2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing
Simultaneous budget and buffer size computation for throughput-constrained task graphs
Proceedings of the Conference on Design, Automation and Test in Europe
Multithreaded Simulation for Synchronous Dataflow Graphs
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Mapping Parameterized Cyclo-static Dataflow Graphs onto Configurable Hardware
Journal of Signal Processing Systems
Compositional temporal analysis model for incremental hard real-time system design
Proceedings of the tenth ACM international conference on Embedded software
Hi-index | 0.01 |
A model for parallel computations is given as a directed graph in which nodes represent elementary operations, and branches, data channels. The problem considered is the determination of an admissible schedule for such a computation; i.e. for each node determine a sequence of times at which the node initiates its operation. These times must be such that each node, upon initiation, is assured of having the necessary data upon which to operate. Necessary and sufficient conditions that a schedule be admissible are given. The computation rate of a given admissible schedule is defined and is shown to have a limiting value 1/&pgr; where &pgr; is a parameter dependent upon the cycles in the graph. Thus, the computation cannot proceed at a rate exceeding 1/&pgr;. For &ggr; ≥ &pgr;, the class of all periodic admissible schedules with period &ggr; is characterized by the solution space of a certain system of linear inequalities. In particular, then, the maximum computation rate of 1/&pgr; is attainable under a periodic admissible schedule with period &pgr;. A class of all-integer admissible schedules is given. Finally, an algorithm is given for the determination of the number of initiations of each node in the graph defining a parallel computation.An example for a system of difference equations is given in detail.