Allen Leung, et al.  Home/Search
Context Related
| nyu.edu/leunga/www/mypaper...pact98.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: nyu.edu/leunga/...imedscheduling (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Instruction scheduling is central to achieving performance in modern processors with instruction level parallelism (ILP). Classical work in this area has spanned the theoretical foundations of algorithms for instruction scheduling with provable optimality, as well as heuristic approaches with experimentally validated performance improvements. Typically, the theoretical foundations are developed in the context of basic-blocks of code. In this paper, we provide the theoretical foundations for... (Update)
Context of citations to this paper: More
.... constraints, inter instructional latency constraints, individual integer release time and deadline constraints on multiple processors[3]. The time complexity of their algorithm is O(n 3 ff(n) which can be improved to O(n 3 ) by using Gabow s static tree set union...
...is structured as follows. In Section 2 we provide the for Some of the results in this paper appeared previously in our conference paper [30]. n) is the functional inverse of the Ackermann function. mal de nition of the optimization decision questions, and discuss related...
Cited by: More
Instruction Scheduling with Timing Constraints on a Single.. - Wu, Jaffar, Yap (2000) (Correct)
Instruction Scheduling with Timing Constraints on ILP Processors - Wu, Jaffar (Correct)
Scheduling Time-Constrained Instructions on Pipelined.. - Leung, Palem, Pnueli (Correct)
Active bibliography (related documents): More All
1.5: A fast algorithm for scheduling time-constrained.. - Leung, Palem, Pnueli (1998) (Correct)
0.4: Highly Efficient Instruction Scheduling of Realtime.. - Leung, Palem, Pnueli (Correct)
0.4: Run-time versus Compile-time Instruction Scheduling in.. - Leung, Palem, Ungureanu (1995) (Correct)
Similar documents based on text: More All
0.3: A Fast Algorithm for Scheduling Instructions with Deadline.. - Wu, Jaffar, Yap (2000) (Correct)
0.1: TimeC: A Time Constraint Language for ILP Processor Compilation - Leung, Palem, Pnueli (1998) (Correct)
0.1: Instruction Scheduling with Timing Constraints on Multiple.. - Wu, Jaffar, Palem (2000) (Correct)
Related documents from co-citation: More All
8: A Linear-Time Algorithm for a Special Case of Disjoint Set Union (context) - Gabow, Tarjan - 1985
7: NP-Complete scheduling problems (context) - Ullman - 1975
7: Postpass Code Optimization of Pipeline Constraints (context) - Hennessy, Gross - 1983
BibTeX entry: (Update)
Leung, Allen, Krishna V. Palem and Amir Pnueli. A fast algorithm for scheduling time-constrained instructions on processors with ILP. Proceedings of the 1998 International Conference on Parallel Architectures and Compilation Techniques. Paris, France, 1998. http://citeseer.ist.psu.edu/leung98fast.html More
@inproceedings{ leung98fast,
author = "Allen Leung and Krishna V. Palem and Amir Pnueli",
title = "A Fast Algorithm for Scheduling Time-Constrained Instructions on Processors with {ILP}",
booktitle = "{IEEE} {PACT}",
pages = "158-",
year = "1998",
url = "citeseer.ist.psu.edu/leung98fast.html" }
Citations (may not include all citations):212 Optimization and approximation in deterministic sequencing a.. (context) - Graham, Lawler et al. - 1979
127 A linear-time algorithm for a special case of disjoint set u.. (context) - Gabow, Tarjan - 1983
112 NP-complete scheduling problems (context) - Ullman - 1975
87 Approximation algorithms for scheduling unrelated parallel m.. (context) - Lenstra, Shmoys et al. - 1987
78 Efficiency of a good but not linear set union algorithm (context) - Tarjan - 1975
66 Optimal scheduling for twoprocessor systems (context) - Coffman, Graham - 1972
60 Postpass code optimization of pipeline constraints (context) - Hennessy, Gross - 1983
44 Scheduling a production line to minimize maximum tardiness (context) - Jackson - 1955
43 Two-processor scheduling with start-times and deadlines (context) - Garey, Johnson - 1977
40 Scheduling intervalordered tasks (context) - Papadimitriou, Yannakakis - 1979
33 Scheduling time-critical instructions on RISC machines (context) - Palem, Simons - 1993
28 Reduced Instruction Set Computer Architecture for VLSI (context) - Katevenis - 1984
23 Scheduling expressions on a pipelined processor with a maxim.. (context) - Bernstein, Gertner - 1989
20 Deterministic scheduling with pipelined processors (context) - Bruno, Jones et al. - 1980
15 Single machine scheduling subject to precedence delays - Finta, Liu - 1996
13 Complexity results for singlemachine problems with positive .. - Brucker, Knust - 1998
9 Scheduling unit-time tasks with integer release times and de.. (context) - Frederickson - 1982
9 IBM Journal of Research and Development (context) - Radin, minicomputer - 1983
5 the complexity of precedence constrained scheduling (context) - Palem - 1986
5 The MIPS machine (context) - Hennessy, Jouppi et al. - 1982
5 Instruction scheduling for the IBM RISC system /6k processor.. (context) - Warren - 1990
4 Technische Universitat Berlin (context) - Schulz, Scheduling et al. - 1996
Documents on the same site (http://cs.nyu.edu/leunga/www/timed-scheduling.html):
Scheduling Time-Constrained Instructions on Pipelined.. - Leung, Palem, Pnueli (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC