Filters








2,099 Hits in 2.1 sec

Preface: Multiprocessor Scheduling, Theory and Applications [chapter]

Eugene Levner
2007 Multiprocessor Scheduling, Theory and Applications  
, approximation algorithms with performance guarantees, heuristics and metaheuristics; novel models and approaches to scheduling; and, last but least, several real-life applications and case studies.  ...  Part I presents tutorials, surveys and comparative studies of several new trends and modern tools in scheduling theory. Chapter 1 is a tutorial on theory of cyclic scheduling.  ...  Chapter 5 deals with a batch version of the single-processor scheduling problem with batch setup times and batch delivery costs, the objective being to find a schedule which minimizes the sum of the weighted  ... 
doi:10.5772/5211 fatcat:i4hco3bepjeo3i2eps3g46miga

New Developments in Scheduling Applications

M. Duran Toksarı, Daniel Oron, Emel Kızılkaya Aydoğan, Jorge G. Barbosa
2014 The Scientific World Journal  
Multiprocessor and shop scheduling problems are known to be hard to solve optimally. Scheduling problems are naturally very varied, both in application domains and in featured constraints.  ...  in multistage systems, scheduling in flexible shops, scheduling under some constraints such as precedence, batching/lot sizing, setups, and further technologies, scheduling under uncertainty, and scheduling  ...  Multiprocessor and shop scheduling problems are known to be hard to solve optimally. Scheduling problems are naturally very varied, both in application domains and in featured constraints.  ... 
doi:10.1155/2014/268941 pmid:24883373 pmcid:PMC4032687 fatcat:64ryuxgdjzdvbkvyv3votkhmla

Analysis of fork-join program response times on multiprocessors

D. Towsley, C.G. Rommel, J.A. Stankovic
1990 IEEE Transactions on Parallel and Distributed Systems  
AZ~tmet--In this paper, we develop analytic models for a shared memory multiprocessor that executesfork-join parallel programs.  ...  We develop and analyze models for two processor sharing policies, called task scheduling processor sharing and job scheduling processor sharing.  ...  SUMMARY We analyzed the behavior of TS-PS, JS-PS, and FCFS scheduling policies while executing fork-join programs on a multiprocessor.  ... 
doi:10.1109/71.80157 fatcat:6wdz7p3uhffhxp4jmt7cpemaxq

Scheduling Computer and Manufacturing Processes

J Blazewicz, K H Ecker, E Pesch, G Schmidt, J Weglarz
1997 Journal of the Operational Research Society  
The reader is given a detailed insight into scheduling flexible flow shops, scheduling dynamic job shops, simultaneous scheduling and routing in some FMS and batch sheduling in flexible flow shops under  ...  Chapter 9 deals with scheduling under resource constraints, in particular scheduling multiprocessor tasks and scheduling with continuous resources.  ... 
doi:10.1038/sj.jors.2600793 fatcat:qla2gdl7tffdhclth4kzzsuot4

Scheduling Computer and Manufacturing Processes

A. Orman, J. Blazewicz, K. H. Ecker, E. Pesch, G. Schmidt, J. Weglarz
1997 Journal of the Operational Research Society  
The reader is given a detailed insight into scheduling flexible flow shops, scheduling dynamic job shops, simultaneous scheduling and routing in some FMS and batch sheduling in flexible flow shops under  ...  Chapter 9 deals with scheduling under resource constraints, in particular scheduling multiprocessor tasks and scheduling with continuous resources.  ... 
doi:10.2307/3010235 fatcat:rshxvp54fran3ixvm6zbhaemvm

Scheduling Computer and Manufacturing Processes

J Blazewicz, K H Ecker, E Pesch, G Schmidt, J Weglarz
1997 Journal of the Operational Research Society  
The reader is given a detailed insight into scheduling flexible flow shops, scheduling dynamic job shops, simultaneous scheduling and routing in some FMS and batch sheduling in flexible flow shops under  ...  Chapter 9 deals with scheduling under resource constraints, in particular scheduling multiprocessor tasks and scheduling with continuous resources.  ... 
doi:10.1057/palgrave.jors.2600793 fatcat:qoir7xokmng25gdj5n4z4nwoka

Page 659 of The Journal of the Operational Research Society Vol. 48, Issue 6 [page]

1997 The Journal of the Operational Research Society  
The reader is given a detailed insight into scheduling flexible flow shops, scheduling dynamic job shops, simultaneous scheduling and routing in some FMS and batch sheduling in flexible flow shops under  ...  Chapter 9 deals with scheduling under resource constraints, in particular scheduling multiprocessor tasks and scheduling with continuous resources.  ... 

The impact of operating system scheduling policies and synchronization methods of performance of parallel applications

Anoop Gupta, Andrew Tucker, Shigeru Urushibara
1991 Performance Evaluation Review  
control with processor partitioning, handoff scheduling, and affinity-based scheduling.  ...  We also explore tradeoffs between the use of busy-waiting and blocking synchronization primitives and their interactions with the scheduling strategies.  ...  We would also like to thank Helen Davis and Steve Goldschmidt for creating rmd supporting Tango, and for helping us modify it for this paper.  ... 
doi:10.1145/107972.107985 fatcat:b7qohqlg4rdwnjazfhgjgukbsy

The impact of operating system scheduling policies and synchronization methods of performance of parallel applications

Anoop Gupta, Andrew Tucker, Shigeru Urushibara
1991 Proceedings of the 1991 ACM SIGMETRICS conference on Measurement and modeling of computer systems - SIGMETRICS '91  
control with processor partitioning, handoff scheduling, and affinity-based scheduling.  ...  We also explore tradeoffs between the use of busy-waiting and blocking synchronization primitives and their interactions with the scheduling strategies.  ...  We would also like to thank Helen Davis and Steve Goldschmidt for creating rmd supporting Tango, and for helping us modify it for this paper.  ... 
doi:10.1145/107971.107985 dblp:conf/sigmetrics/GuptaTU91 fatcat:bbccni7gvvdcdajurz234y3hn4

Page 5839 of Mathematical Reviews Vol. , Issue 2004g [page]

2004 Mathematical Reviews  
The batch processing time is the maximum processing time of operations in the batch, and all operations in a batch complete at the same time.  ...  We consider cases in which there is no restriction on the size of a batch on a machine, and in which a machine can process only a bounded number of operations in one batch.  ... 

Parallel Batch Scheduling of Deteriorating Jobs with Release Dates and Rejection

Juan Zou, Cuixia Miao
2014 The Scientific World Journal  
We consider the unbounded parallel batch scheduling with deterioration, release dates, and rejection.  ...  Then, we present two pseudopolynomial time algorithms and a fully polynomial-time approximation scheme to solve this problem.  ...  [6, 7] presented new complexity results and approximation algorithms for the parallel batch scheduling problem subject to release dates.  ... 
doi:10.1155/2014/270942 pmid:25143969 pmcid:PMC4131089 fatcat:t7iuqe26fzdotem3e3p6fd5aba

Scheduling at Villa Vigoni

Rolf H. Möhring, Franz Josef Radermacher, M. Grazia Speranza
1997 Discrete Applied Mathematics  
The major topics were: machine scheduling project analysis and scheduling vehicle scheduling and routing graph-theoretic models complexity of scheduling problems approximation algorithms on-line algorithms  ...  -The modelling issue is dealt with in the paper of Bampis, Guinand and Trystram who present and analyse scheduling problems that arise in the context of parallel programming.  ...  The design and analysis of approximate and heuristic algorithms is the basic issue of the last four papers.  ... 
doi:10.1016/s0166-218x(96)00033-9 fatcat:lvzjd3aeh5gdrif7herzjca3zm

Comparative Study of Scheduling Algorithms for Real Time Environment

Ishan Khera, Ajay Kakkar
2012 International Journal of Computer Applications  
Also techniques used for scheduling in real time environment are analyzed and comparison between different techniques have been done.  ...  In order to achieve optimized results in a real rime operations the scheduling techniques has been used. In the paper we classify the various scheduling techniques based on different parameters.  ...  Rate scheduling etc are the examples of iterative scheduling algorithms b.Batch Scheduling Processes are queued together in a batch and scheduling is done in batches.  ... 
doi:10.5120/6233-7797 fatcat:z6nergndrne5zfsok7x4wbgxae

Page 3433 of Mathematical Reviews Vol. , Issue 2004d [page]

2004 Mathematical Reviews  
In a batch scheduling problem, a set of jobs has to be partitioned into a collection of batches which are then scheduled one after the other.  ...  ; Yorktown Heights, NY) A note on scheduling tall/small multiprocessor tasks with unit processing time to minimize maximum tardiness.  ... 

Anytime Algorithms for GPU Architectures

Rahul Mangharam, Aminreza Abrahimi Saba
2011 2011 IEEE 32nd Real-Time Systems Symposium  
The algorithm execution time and resource usage is described in terms of CUDA kernels constructed at design-time.  ...  This is an early effort to enable imprecise and approximate real-time computation on parallel architectures for stream-based timebounded applications such as traffic congestion prediction and route allocation  ...  This scheduler, named offline, creates batches of queries and runs all queries in that batch in one of the levels of the multilevel graph.  ... 
doi:10.1109/rtss.2011.41 dblp:conf/rtss/MangharamS11 fatcat:oknx34th5vdybhu4mce4wbd55a
« Previous Showing results 1 — 15 out of 2,099 results