P. Chr'etienne, E.G. Cofman, J.K. Lenstra, Z. Liu, Scheduling Theory and its Applications, John Wiley & Sons, (1995).  Home/Search   Document Not in Database   Summary   Related Articles   Check

....restricted models which allowed an infinite number of processors in the system. Polynomial algorithms were found for the cases where the precedence constraints form a tree under certain constraints [2, 3, 4, 7, 17] A good review of models and algorithms developed for this problem can be found in [2, 6, 15, 19]. Most of this work was very theoretical in nature, i.e. the models were too simplistic for practical application to real machines. More recently, Valiant s BSP Model [22, 23] provided a general framework with which to study more practical algorithms in an asynchronous distributed memory parallel ....

P. Chr'etienne, Jr. E. G. Coffman, J. K. Lenstra, and Z. Liu, editors. Scheduling Theory and its Applications. John Wiley & Sons Ltd, 1995.

....return E# 21: MSTG # GS Figure 5: Pseudocode of the proposed variable power DVS algorithm (PV DVS) communication tasks to allow an unification of communications and tasks. Second, for each successive execution of tasks on same resources a pseudo edge is introduced between the these two tasks [4], if it does not already exists. In this way it becomes possible to easily and fast traverse the task graph in the chronological correct order by using a breadth first search algorithm (linear time complexity) An example MSTG is shown in Fig. 4, which is the transformed version of the task graph ....

P. Chretienne, E. G. Co#man, J. K. Lenstra, and Z. Liu. Scheduling Theory and its Applications. John Wiley & Sons, 1995.

....a systematic exploration of all alternative schedules. In theory, it is possible to determine optimal schedules for static or dynamic deterministic scheduling problems. In practice, the computation of optimal solutions is impossible since these problems belong to the class of NP hard problems [2]. Therefore, the existence of algorithms that are polynomial bounded in the problem size is very unlikely. Only for small problems is it possible to generate optimal schedules using, for example, a branch and bound approach [13] However, the time requirements for calculating optimal processing ....

Philippe Chretienne, "Scheduling theory and its applications", John Wiley & Sons, New York, 1995.

....(x H ) i (or (x H ) i ) it is the dater function of the token of G i . 5. AN APPLICATION TO THE MODELING AND PERFORMANCE ANALYSIS OF JOBSHOPS The results presented above find a natural domain of application in scheduling theory. A good introduction to the subject is provided by the books [8, 10]. We first show how heap representations can be used to design performance evaluation methods. We explain informally the method on a small manufacturing model, and we compare it with the classical approach. Then, we consider the general subclass of safe jobshops. We describe the classical ....

P. Chretienne, E. Coffman, J. Lenstra, and Z. Liu, editors. Scheduling Theory and Its Applications, New-York, 1995. John Wiley.

....G 4 G 1 G 3 p 1 p 6 p4 p 3 Fig. 7. Expansion of the Petri net of Fig. 2. V. An Application to the Modeling and Performance Analysis of Jobshops The results presented above find a natural domain of application in scheduling theory. A good introduction to the subject is provided by the books [8] [10]. We first show how heap representations can be used to design performance evaluation methods. We explain informally the method on a small manufacturing model, and we compare it with the classical approach. Then, we consider the general subclass of safe jobshops. We describe the classical ....

P. Chretienne, E. Coffman, J. Lenstra, and Z. Liu, editors. Scheduling Theory and Its Applications, Wiley, 1995.

....has been receiving increasing interest for more than two decades. Researchers from both the communities of parallel computing and of combinatorial optimization have obtained a number of results on the complexity of the problems and optimal solutions. The reader is referred to the books [1, 3] for the recent development in the eld. In this paper, we are interested in a scheduling problem in multiprocessor systems with identical parallel processors. The number of available processors can vary in time, so that we have a variable prole. Parallel programs running in the system are composed ....

....time of all the tasks of the program, is minimized. At any time, a processor can execute at most one task and a task can be run on at most one processor. Much literature exists on scheduling of parallel programs with known deterministic structure. The interested reader is referred to [9] and [3] for surveys. In particular, the results on scheduling with variable prole and precedence constraints can be found in [10, 11] and the references therein. However, in many applications such as branch and bound algorithms, structures of programs cannot be obtained in advance. Thus, iooe linej or ....

P. Chretienne, E. G. Cooeman, J. K. Lenstra, Z. Liu, (Eds.) Scheduling Theory and Its Applications, J. Wiley, 1995.

....computations has received an increasing interest during the last two decades. Researchers from both the communities of parallel computing and of combinatorial optimization have obtained a number of results on the complexity of the problems and optimal solutions. The reader is referred to the books [2, 4] for the recent development in the eld. In this paper we are interested in the makespan (or schedule length) minimization for parallel computations which are represented by task graphs. It is now well known that most such scheduling problems are NP hard, even under very special assumptions. Thus, ....

P. Chretienne, E. G. Cooeman, J. K. Lenstra, Z. Liu, (Eds.) Scheduling Theory and Its Applications, J. Wiley, 1995.

....computations has received an increasing interest during the last two decades. Researchers from both the communities of parallel computing and of combinatorial optimization have obtained a number of results on the complexity of the problems and optimal solutions. The reader is referred to the books [2, 3] for the recent development in the field. In this note we are interested in the makespan (or schedule length) minimization for parallel computations which are represented by task graphs. It is now well known that most such scheduling problems are NP hard, even under very special assumptions. Thus ....

P. Chretienne, E. G. Coffman, J. K. Lenstra, Z. Liu, (Eds.) Scheduling Theory and Its Applications, J. Wiley, 1995.

No context found.

P. Chr'etienne, E.G. Cofman, J.K. Lenstra, Z. Liu, Scheduling Theory and its Applications, John Wiley & Sons, (1995).

No context found.

P.Chr'etienne, E.G. Cofman, J.K. Lenstra, Z. Liu, Scheduling Theory and its Applications, John Wiley & Sons, (1995).

No context found.

P. Chretienne, E. G. Co#man Jr., J. K. Lenstra, and Z. Liu, editors. Scheduling Theory and its Applications. John Wiley and Sons, 1995.

No context found.

P. Chretienne, E. G. Co#man Jr., J. K. Lenstra, and Z. Liu, editors. Scheduling Theory and its Applications. John Wiley and Sons, 1995.

No context found.

P. Chretienne, E. G. Co#man Jr., J. K. Lenstra, and Z. Liu, editors. Scheduling Theory and its Applications. John Wiley and Sons, 1995.

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