Scheduling in Computer and Manufacturing Systems

Błażewicz, Jacek; Ecker, Klaus; Schmidt, Günter; Węglarz, Jan

doi:10.1007/978-3-662-00074-8

Cited by 128 publications

(49 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Pinedo's coverage of stochastic scheduling is a useful element of the book. Two other very good books, by Brucker (1995) andB lazewicz et al (1993) that cover most important aspects of scheduling and gained popularity among researchers, lecturers and students. There have been several editions of each book.…”

Section: Scheduling At the End Of Decadementioning

confidence: 99%

Fifty years of scheduling: a survey of milestones

Potts

Strusevich

2009

Journal of the Operational Research Society

170

View full text Add to dashboard Cite

Scheduling has become a major field within operational research with several hundred publications appearing each year. This paper explores the historical development of the subject since the mid 1950s when the landmark publications started to appear. A discussion of the main topics of scheduling research for the past five decades is provided, highlighting the key contributions that helped shape the subject. The main topics covered in the respective decades are combinatorial analysis, branch and bound, computational complexity and classification, approximate solution algorithms, and enhanced scheduling models.

show abstract

Section: Scheduling At the End Of Decadementioning

confidence: 99%

Fifty years of scheduling: a survey of milestones

Potts

Strusevich

2009

Journal of the Operational Research Society

170

View full text Add to dashboard Cite

show abstract

“…Consider Figure 3. By topologically sorting [13] a directed acyclic graph, we can apply ready list scheduling [14] to compute the importance for stream s 5 . In the figure three RF s are initially ready because they are fed by primal So we obtain the rates at streams s 1 through s 3 .…”

Section: Glossary Of Key New Soda Termsmentioning

confidence: 99%

SODA: An Optimizing Scheduler for Large-Scale Stream-Based Distributed Computer Systems

Wolf¹,

Bansal²,

Hildrum³

et al. 2008

Middleware 2008

110

View full text Add to dashboard Cite

Abstract. This paper describes the SODA scheduler for System S , a highly scalable distributed stream processing system. Unlike traditional batch applications, streaming applications are open-ended. The system cannot typically delay the processing of the data. The scheduler must be able to shift resource allocation dynamically in response to changes to resource availability, job arrivals and departures, incoming data rates and so on. The design assumptions of System S , in particular, pose additional scheduling challenges. SODA must deal with a highly complex optimization problem, which must be solved in real-time while maintaining scalability. SODA relies on a careful problem decomposition, and intelligent use of both heuristic and exact algorithms. We describe the design and functionality of SODA, outline the mathematical components, and describe experiments to show the performance of the scheduler.

show abstract

“…4(b). By topologically sorting [7] a directed acyclic graph, we can apply ready list scheduling [4,6] to compute the importance for stream s 5 . In the figure three RF s are initially ready because they are fed by primal (external) streams.…”

Section: Resource Functionmentioning

confidence: 99%

Job Admission and Resource Allocation in Distributed Streaming Systems

Wolf

Bansal

Hildrum

et al. 2009

Job Scheduling Strategies for Parallel Processing

View full text Add to dashboard Cite

Abstract. This paper describes a new and novel scheme for job admission and resource allocation employed by the SODA scheduler in System S . Capable of processing enormous quantities of streaming data, System S is a large-scale, distributed stream processing system designed to handle complex applications. The problem of scheduling in distributed, stream-based systems is quite unlike that in more traditional systems. And the requirements for System S , in particular, are more stringent than one might expect even in a "standard" stream-based design. For example, in System S , the offered load is expected to vastly exceed system capacity. So a careful job admission scheme is essential. The jobs in System S are essentially directed graphs, with software "processing elements" (PEs) as vertices and data streams as edges connecting the PEs. The jobs themselves are often heavily interconnected. Thus resource allocation of individual PEs must be done carefully in order to balance the flow. We describe the design of the SODA scheduler, with particular emphasis on the component, known as macroQ, which performs the job admission and resource allocation tasks. We demonstrate by experiments the natural trade-offs between job admission and resource allocation.

show abstract

Scheduling in Computer and Manufacturing Systems

Cited by 128 publications

References 0 publications

Fifty years of scheduling: a survey of milestones

Fifty years of scheduling: a survey of milestones

SODA: An Optimizing Scheduler for Large-Scale Stream-Based Distributed Computer Systems

Job Admission and Resource Allocation in Distributed Streaming Systems

Contact Info

Product

Resources

About