<--- Back to Details
First PageDocument Content
System software / Job scheduler / IBM Tivoli Workload Scheduler LoadLeveler / Batch processing / Job queue / Indian Institute of Science / Portable Batch System / Operating system / Computer cluster / Job scheduling / Computing / Concurrent computing
Date: 2009-03-17 01:21:56
System software
Job scheduler
IBM Tivoli Workload Scheduler LoadLeveler
Batch processing
Job queue
Indian Institute of Science
Portable Batch System
Operating system
Computer cluster
Job scheduling
Computing
Concurrent computing

How to make computers work for you when you are enjoying life. J. Lakshmi[removed]

Add to Reading List

Source URL: www.serc.iisc.ernet.in

Download Document from Source Website

File Size: 333,25 KB

Share Document on Facebook

Similar Documents

JAWS: Job-Aware Workload Scheduling for the Exploration of Turbulence Simulations ∗ Dept. Xiaodan Wang∗ , Eric Perlman∗ , Randal Burns∗¶ , Tanu Malik† , Tamas Budav´ari‡¶ , Charles Meneveau§¶ and Alexand

JAWS: Job-Aware Workload Scheduling for the Exploration of Turbulence Simulations ∗ Dept. Xiaodan Wang∗ , Eric Perlman∗ , Randal Burns∗¶ , Tanu Malik† , Tamas Budav´ari‡¶ , Charles Meneveau§¶ and Alexand

DocID: 1uUno - View Document

Employing Checkpoint to Improve Job Scheduling in Large-Scale Systems Shuangcheng Niu1 , Jidong Zhai1 , Xiaosong Ma2 , Mingliang Liu1 , Yan Zhai1 , Wenguang Chen1 , and Weimin Zheng1 2

Employing Checkpoint to Improve Job Scheduling in Large-Scale Systems Shuangcheng Niu1 , Jidong Zhai1 , Xiaosong Ma2 , Mingliang Liu1 , Yan Zhai1 , Wenguang Chen1 , and Weimin Zheng1 2

DocID: 1uIow - View Document

Hardness of Approximating Flow and Job Shop Scheduling Problems MONALDO MASTROLILLI, IDSIA, Lugano, Switzerland OLA SVENSSON, EPFL, Switzerland 20 We consider several variants of the job shop problem that is a fundamenta

Hardness of Approximating Flow and Job Shop Scheduling Problems MONALDO MASTROLILLI, IDSIA, Lugano, Switzerland OLA SVENSSON, EPFL, Switzerland 20 We consider several variants of the job shop problem that is a fundamenta

DocID: 1uCRt - View Document

Increasing Waiting Time Satisfaction in Parallel Job Scheduling via a Flexible MILP Approach Stephan Schlagkamp, Matthias Hofmann Robotics Research Institute TU Dortmund University

Increasing Waiting Time Satisfaction in Parallel Job Scheduling via a Flexible MILP Approach Stephan Schlagkamp, Matthias Hofmann Robotics Research Institute TU Dortmund University

DocID: 1tWDk - View Document

Speed Scaling Functions for Flow Time Scheduling based on Active Job Count Tak-Wah Lam1 , Lap-Kei Lee1 , Isaac K. K. To2 , and Prudence W. H. Wong2 1  Department of Computer Science, University of Hong Kong.

Speed Scaling Functions for Flow Time Scheduling based on Active Job Count Tak-Wah Lam1 , Lap-Kei Lee1 , Isaac K. K. To2 , and Prudence W. H. Wong2 1 Department of Computer Science, University of Hong Kong.

DocID: 1srzz - View Document