Filters








89,116 Hits in 5.5 sec

Dominator-path scheduling

Philip H. Sweany, Steven J. Beaty
1992 ACM SIGMICRO Newsletter  
Unlike other global scheduling methods, dominator-path scheduling does not require copies of operations to preserve program semantics.  ...  Dominator-path scheduling performs global instruction scheduling of paths in the dominator tree.  ...  Dominator-Path Scheduling Dominator-path scheduling is a global instruction scheduling method that does not require copies of operations that move from one block to another.  ... 
doi:10.1145/144965.145824 fatcat:ke6oeyz5vfeenaqtiiyce7imbu

Dominator-path Scheduling - A Global Scheduling Method

P.H. Sweany, S.J. Beaty
[1992] Proceedings the 25th Annual International Symposium on Microarchitecture MICRO 25  
Unlike other global scheduling methods, dominator-path scheduling does not require copies of operations to preserve program semantics.  ...  Dominator-path scheduling performs global instruction scheduling of paths in the dominator tree.  ...  Dominator-Path Scheduling Dominator-path scheduling is a global instruction scheduling method that does not require copies of operations that move from one block to another.  ... 
doi:10.1109/micro.1992.697028 dblp:conf/micro/SweanyB92 fatcat:g2kjzrbqgrhbhgnsszvv6m3jkq

Extending list scheduling to consider execution frequency

M.J. Bourke, P.H. Sweany, S.J. Beaty
1996 Proceedings of HICSS-29: 29th Hawaii International Conference on System Sciences  
This is useful for global instruction scheduling methods that schedule groups of basic blocks, called meta-blocks, as though they were a single block.  ...  1], a meta-block global scheduling algorithm.  ...  Dominator-Path Scheduling Dominator-Path Scheduling (DPS) [7, 1] is a global scheduling method in which parallelism in multiple basic blocks can be exploited without the cost of trace scheduling's bookkeeping  ... 
doi:10.1109/hicss.1996.495463 dblp:conf/hicss/BourkeSB96 fatcat:rvqhi7knezerrb2baifwcqoopq

Instruction scheduling over regions: A framework for scheduling across basic blocks [chapter]

Uma Mahadevan, Sridhar Ramakrishnan
1994 Lecture Notes in Computer Science  
Global instruction scheduling is important for superscalar, superpipelined and VLIW machines.  ...  Instruction scheduling issues for scopes extending beyond a basic block are significantly different from those for scheduling within a basic block.  ...  In Section 2, this technique is compared with other known global scheduling methods. Section 3 and 4 provide a general description of the problem and its solution.  ... 
doi:10.1007/3-540-57877-3_28 fatcat:tsynmpalmjalrhnwxudtl2casm

Non-local instruction scheduling with limited code growth [chapter]

Keith D. Cooper, Philip J. Schielke
1998 Lecture Notes in Computer Science  
This paper explores two global scheduling techniques, extended basic block scheduling and dominator path scheduling, that do not increase the size of the object code, and in some cases may decrease it.  ...  However many of the global scheduling techniques described in the literature have a side effect of increasing the size of compiled code.  ...  Acknowledgements The scheduler was implemented inside the experimental compiler built by the Massively Scalar Compiler Group at Rice; the many people who have contributed to that effort deserve our heartfelt  ... 
doi:10.1007/bfb0057791 fatcat:d6o2pgg7ergknehjsuu6tqleou

Compiler Optimization for Superscalar Systems: Global Instruction Scheduling without Copies

Philip H. Sweany, Steve Carr, Brett L. Huber
1998 Digital technical journal of Digital Equipment Corporation  
Instruction scheduling is classified as local if it considers code only within a basic block and global if it schedules code across multiple basic blocks.  ...  Generally, global scheduling is preferred because it can take advantage of added program parallelism available when the compiler is allowed to move code across basic block boundaries.  ...  Global scheduling is generally thought to give better results. One global method, dominator-path scheduling, schedules paths in a function's dominator tree.  ... 
dblp:journals/dtj/SweanyCH98 fatcat:ppzzymiicjbu7mc6jgo5cnbj4y

Constraint-based scheduling

M.P.J. Fromherz
2001 Proceedings of the 2001 American Control Conference. (Cat. No.01CH37148)  
Constraint-based scheduling has become the dominant form of modeling and solving scheduling problems.  ...  This tutorial gives a brief introduction to constraint-based scheduling, generic constraint programming techniques for modeling and solving scheduling problems, and a concrete real-time application example  ...  In contrast to refinement-based methods, repairbased methods typically are not complete, i.e., they are not guaranteed to find the global optimum or even a variable assignment that satisfies all the constraints  ... 
doi:10.1109/acc.2001.946421 fatcat:smqrhmkjf5eo3ofiuavfmd7ovq

Delay insertion method in clock skew scheduling

B. Taskin, I.S. Kourtev
2006 IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems  
This paper describes a delay insertion method that improves the efficiency of clock skew scheduling.  ...  A delay insertion method is proposed such that the optimal clock period achievable through clock skew scheduling is improved by mitigating the limitations caused by reconvergent paths.  ...  After clock skew scheduling is applied, the earliest (a c global ) and latest (A c global ) data arrival times at the convergent node with respect to the global zero time reference are a c global = t c  ... 
doi:10.1109/tcad.2006.870072 fatcat:4ogh4n4klvbyxjy3sfiydctljy

Delay insertion method in clock skew scheduling

Baris Taskin, Ivan S. Kourtev
2005 Proceedings of the 2005 international symposium on physical design - ISPD '05  
This paper describes a delay insertion method that improves the efficiency of clock skew scheduling.  ...  A delay insertion method is proposed such that the optimal clock period achievable through clock skew scheduling is improved by mitigating the limitations caused by reconvergent paths.  ...  After clock skew scheduling is applied, the earliest (a c global ) and latest (A c global ) data arrival times at the convergent node with respect to the global zero time reference are a c global = t c  ... 
doi:10.1145/1055137.1055149 dblp:conf/ispd/TaskinK05 fatcat:4hd3jhmo3bhqhmaqnbxupfp36i

Resource Constrained Scheduling within Fixed Project Durations

R. K-Y. Li, R. J. Willis
1993 Journal of the Operational Research Society  
We have developed a procedure in which a similar path can be established under resource constraints. The path is called the Dominant Sequence.  ...  Willis— Resource Constrained Scheduling Dominant Sequence Numerous methods have been proposed (Antill and Woodhead*, Goyal®, Martino’, Siemens®, Talbot?  ... 
doi:10.1057/jors.1993.8 fatcat:auken2yrizgdtm7jodvgdwz6ca

Scheduling with timed automata

Yasmina Abdeddaı¨m, Eugene Asarin, Oded Maler
2006 Theoretical Computer Science  
In this work, we present timed automata as a natural tool for posing and solving scheduling problems.  ...  We show how efficient shortest path algorithms for timed automata can find optimal schedules for the classical job-shop problem.  ...  Conclusions and future work We have suggested a novel application of timed automata, namely for solving optimal job-shop scheduling problems.  ... 
doi:10.1016/j.tcs.2005.11.018 fatcat:6imydoapfvdjdgesr34qcexxnm

A learning-based optimization approach to multi-project scheduling

Tony Wauters, Katja Verbeeck, Patrick De Causmaecker, Greet Vanden Berghe
2014 Journal of Scheduling  
Through the mediator, a sequence of feasible activity lists is eventually scheduled by using a serial schedule generation scheme, which is adopted from single project scheduling.  ...  The availability of local and global resources, precedence relations between activities, and non-equal project start times have to be considered.  ...  The critical path duration can be determined by the critical path method and is a lower bound for the project makespan [Willis, 1985] .  ... 
doi:10.1007/s10951-014-0401-1 fatcat:o2q7tpqhdrg2zpuah5ctx3hjiq

Efficient local search far DAG scheduling

Min-You Wu, Wei Shu, Jun Gu
2001 IEEE Transactions on Parallel and Distributed Systems  
Most realistic scheduling algorithms are heuristic and heuristic algorithms often have room for improvement. The quality of a scheduling algorithm can be effectively improved by a local search.  ...  This is a compaction algorithm that can effectively reduce the schedule length produced by any DAG scheduling algorithm. Thus, it can improve the quality of existing DAG scheduling algorithms.  ...  The CPN-dominate algorithm utilizes the two important properties of DAG: the critical path and the topological order. It potentially generates a good schedule.  ... 
doi:10.1109/71.932715 fatcat:27k34g2wujapnbknw66v4kmp7m

On green routing and scheduling problem [article]

Nora Touati
2012 arXiv   pre-print
In this paper, some of the existing literature dealing with routing and scheduling problems with environmental issues is reviewed, and a description is provided of the problems that have been investigated  ...  The vehicle routing and scheduling problem has been studied with much interest within the last four decades.  ...  Gateway shortestpaths method [69] Generate dissimilar paths by forcing at each time a new path to go through a different node (called the gateway node).  ... 
arXiv:1203.1604v1 fatcat:l577lwg22reynk3kyctauzs36m

Immune Scheduling Network Based Method for Task Scheduling in Decentralized Fog Computing

Yabin Wang, Chenghao Guo, Jin Yu
2018 Wireless Communications and Mobile Computing  
In this paper, we propose a method that takes advantages of the immune mechanism to schedule tasks in a decentralized way for fog computing.  ...  However, it will bring more difficulties for resource managing and task scheduling especially in a decentralized ad hoc network.  ...  The most popular list-scheduling methods include Modified Critical Path (MCP) [8] , Mapping Heuristic (MH) [9] , and Dynamic Critical Path (DCP) [10] .  ... 
doi:10.1155/2018/2734219 fatcat:ttokvnwmqvhqzpfnkl3gasqphq
« Previous Showing results 1 — 15 out of 89,116 results