scispace - formally typeset

Job scheduler

About: Job scheduler is a(n) research topic. Over the lifetime, 5675 publication(s) have been published within this topic receiving 85876 citation(s). The topic is also known as: process scheduler & batch scheduler. more


Open accessProceedings ArticleDOI: 10.1109/SFCS.1995.492493
23 Oct 1995-
Abstract: The energy usage of computer systems is becoming an important consideration, especially for battery-operated systems. Various methods for reducing energy consumption have been investigated, both at the circuit level and at the operating systems level. In this paper, we propose a simple model of job scheduling aimed at capturing some key aspects of energy minimization. In this model, each job is to be executed between its arrival time and deadline by a single processor with variable speed, under the assumption that energy usage per unit time, P, is a convex function, of the processor speed s. We give an off-line algorithm that computes, for any set of jobs, a minimum-energy schedule. We then consider some on-line algorithms and their competitive performance for the power function P(s)=s/sup p/ where p/spl ges/2. It is shown that one natural heuristic, called the Average Rate heuristic, uses at most a constant times the minimum energy required. The analysis involves bounding the largest eigenvalue in matrices of a special type. more

Topics: Energy consumption (57%), Job scheduler (55%), Scheduling (computing) (52%) more

1,497 Citations

Open accessJournal ArticleDOI: 10.1016/J.COMPCHEMENG.2006.02.008
Abstract: There has been significant progress in the area of short-term scheduling of batch processes, including the solution of industrial-sized problems, in the last 20 years. The main goal of this paper is to provide an up-to-date review of the state-of-the-art in this challenging area. Main features, strengths and limitations of existing modeling and optimization techniques as well as other available major solution methods are examined through this paper. We first present a general classification for scheduling problems of batch processes as well as for the corresponding optimization models. Subsequently, the modeling of representative optimization approaches for the different problem types are introduced in detail, focusing on both discrete and continuous time models. A comparison of effectiveness and efficiency of these models is given for two benchmarking examples from the literature. We also discuss two real-world applications of scheduling problems that cannot be readily accommodated using existing methods. For the sake of completeness, other alternative solution methods applied in the field of scheduling are also reviewed, followed by a discussion related to solving large-scale problems through rigorous optimization approaches. Finally, we list available academic and commercial software, and briefly address the issue of rescheduling capabilities of the various optimization approaches as well as important extensions that go beyond short-term batch scheduling. more

  • Figure 4. Roadmap for optimization models for short-term scheduling of batch plants
    Figure 4. Roadmap for optimization models for short-term scheduling of batch plants
  • Figure 11. Schematic representation of the polymer batch process
    Figure 11. Schematic representation of the polymer batch process
  • Figure 12. Steel making process
    Figure 12. Steel making process
  • Figure 8. Gantt charts for case 1.a (Makespan minimization)
    Figure 8. Gantt charts for case 1.a (Makespan minimization)
  • Figure 9. Gantt charts for case 1.b (Profit maximization)
    Figure 9. Gantt charts for case 1.b (Profit maximization)
  • + 14

741 Citations

Journal ArticleDOI: 10.1145/1394608.1382128
Onur Mutlu1, Thomas Moscibroda1Institutions (1)
01 Jun 2008-
Abstract: In a chip-multiprocessor (CMP) system, the DRAM system isshared among cores. In a shared DRAM system, requests from athread can not only delay requests from other threads by causingbank/bus/row-buffer conflicts but they can also destroy other threads’DRAM-bank-level parallelism. Requests whose latencies would otherwisehave been overlapped could effectively become serialized. As aresult both fairness and system throughput degrade, and some threadscan starve for long time periods.This paper proposes a fundamentally new approach to designinga shared DRAM controller that provides quality of service to threads,while also improving system throughput. Our parallelism-aware batchscheduler (PAR-BS) design is based on two key ideas. First, PARBSprocesses DRAM requests in batches to provide fairness and toavoid starvation of requests. Second, to optimize system throughput,PAR-BS employs a parallelism-aware DRAM scheduling policythat aims to process requests from a thread in parallel in the DRAMbanks, thereby reducing the memory-related stall-time experienced bythe thread. PAR-BS seamlessly incorporates support for system-levelthread priorities and can provide different service levels, includingpurely opportunistic service, to threads with different priorities.We evaluate the design trade-offs involved in PAR-BS and compareit to four previously proposed DRAM scheduler designs on 4-, 8-, and16-core systems. Our evaluations show that, averaged over 100 4-coreworkloads, PAR-BS improves fairness by 1.11X and system throughputby 8.3% compared to the best previous scheduling technique, Stall-Time Fair Memory (STFM) scheduling. Based on simple request prioritizationrules, PAR-BS is also simpler to implement than STFM. more

Topics: Scheduling (computing) (57%), Dram (56%), Thread (computing) (53%) more

551 Citations

Book ChapterDOI: 10.1007/3-540-63574-2_14
05 Apr 1997-
Abstract: The scheduling of jobs on parallel supercomputer is becoming the subject of much research. However, there is concern about the divergence of theory and practice. We review theoretical research in this area, and recommendations based on recent results. This is contrasted with a proposal for standard interfaces among the components of a scheduling system, that has grown from requirements in the field. more

Topics: Flow shop scheduling (59%), Job scheduler (57%), Scheduling (production processes) (54%) more

506 Citations

Proceedings ArticleDOI: 10.1109/HPDC.2002.1029935
Kavitha Ranganathan1, Ian Foster1Institutions (1)
24 Jul 2002-
Abstract: In high-energy physics, bioinformatics, and other disciplines, we encounter applications involving numerous, loosely coupled jobs that both access and generate large data sets. So-called Data Grids seek to harness geographically distributed resources for such large-scale data-intensive problems. Yet effective scheduling in such environments is challenging, due to a need to address a variety of metrics and constraints while dealing with multiple, potentially independent sources of jobs and a large number of storage, compute, and network resources. We describe a scheduling framework that addresses these problems. Within this framework, data movement operations may be either tightly bound to job scheduling decisions or, alternatively, performed by a decoupled, asynchronous process on the basis of observed data access patterns and load. We develop a family of algorithms and use simulation studies to evaluate various combinations. Our results suggest that while it is necessary to consider the impact of replication, it is not always necessary to couple data movement and computation scheduling. Instead, these two activities can be addressed separately, thus significantly simplifying the design and implementation. more

Topics: Fair-share scheduling (65%), Two-level scheduling (64%), Dynamic priority scheduling (63%) more

501 Citations

No. of papers in the topic in previous years

Top Attributes

Show by:

Topic's top 5 most impactful authors

T.C.E. Cheng

35 papers, 1K citations

Dmitry Yemelyanov

18 papers, 125 citations

Gur Mosheiov

16 papers, 253 citations

Dror G. Feitelson

16 papers, 1.4K citations

Jinjiang Yuan

15 papers, 280 citations

Network Information
Related Topics (5)
Rate-monotonic scheduling

15.8K papers, 350.4K citations

91% related
Dynamic priority scheduling

28.2K papers, 585.1K citations

90% related
Fair-share scheduling

24.7K papers, 516.6K citations

89% related
Scheduling (computing)

78.6K papers, 1.3M citations

89% related
Job shop scheduling

35.2K papers, 658.3K citations

88% related