Results 1 - 10 of 2,618

Effect of Job Size Characteristics on Job Scheduling Performance

by Kento Aida
"... A workload characteristic on a parallel computer depends on an administration policy or a user community for the computer system. An administrator of a parallel computer system needs to select an appropriate scheduling algorithm that schedules multiple jobs on the computer system efficiently. The go ..."
Abstract - Cited by 31 (0 self) - Add to MetaCart
. The goal of the work presented in this paper is to investigate mechanisms how job size characteristics affect job scheduling performance. For this goal, this paper evaluates the performance of job scheduling algorithms under various workload models, each of which has a certain characteristic related

Job Size for Internet Parallel Computing

by Peiyi Tang, Jingling Xue
"... In this paper, we present a performance model and the experimental results of parallel execution of Java Remote Method Invocation (RMI). The Java RMI is used for remote execution of parallel jobs on the Internet. The main use of the model is to determine the job size of the distributed objects that ..."
Abstract - Add to MetaCart
In this paper, we present a performance model and the experimental results of parallel execution of Java Remote Method Invocation (RMI). The Java RMI is used for remote execution of parallel jobs on the Internet. The main use of the model is to determine the job size of the distributed objects

Analysis of Scheduling Policies under Correlated Job Sizes

by Varun Gupta, Michelle Burroughs, Mor Harchol-Balter - PERFORMANCE EVALUATION 00 (2010) 1–24 , 2010
"... Correlations in traffic patterns are an important facet of the workloads faced by real systems, and one that has far-reaching consequences on the performance and optimization of the systems involved. However, all the existing analytical work on understanding the effect of correlations between succes ..."
Abstract - Cited by 4 (1 self) - Add to MetaCart
successive service requirements (job sizes) is limited to First-Come-First-Served scheduling. This leaves open fundamental questions: How do various scheduling policies interact with correlated job sizes? Can scheduling be used to mitigate the harmful effects of correlations? In this paper we take the first

Revisiting size-based scheduling with estimated job sizes

by Damiano Carra, Mario Pastorelli, Pietro Michiardi - in MASCOTS. IEEE , 2014
"... Abstract—We study size-based schedulers, and focus on the impact of inaccurate job size information on response time and fairness. Our intent is to revisit previous results, which allude to performance degradation for even small errors on job size estimates, thus limiting the applicability of size-b ..."
Abstract - Cited by 5 (3 self) - Add to MetaCart
Abstract—We study size-based schedulers, and focus on the impact of inaccurate job size information on response time and fairness. Our intent is to revisit previous results, which allude to performance degradation for even small errors on job size estimates, thus limiting the applicability of size

Contention Resolution with Heterogeneous Job Sizes

by Michael A. Bender, Jeremy T. Fineman, Seth Gilbert
"... Abstract. We study the problem of contention resolution for differentsized jobs on a simple channel. When a job makes a run attempt, it learns only whether the attempt succeeded or failed. We first analyze binary exponential backoff, and show that it achieves a makespan of √ log n) with high probabi ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
probability, where V is the total work of all n con-V 2 Θ( tending jobs. This bound is significantly larger than when jobs are constant sized. A variant of exponential backoff, however, achieves makespan O(V log V) with high probability. Finally, we introduce a new protocol, size-hashed backoff, specifically

Contention Resolution with Heterogeneous Job Sizes

by unknown authors
"... Abstract. We study the problem of contention resolution for differentsized jobs on a simple channel. When a job makes a run attempt, it learns only whether the attempt succeeded or failed. We first analyze binary exponential backoff, and show that it achieves a makespan of ..."
Abstract - Add to MetaCart
Abstract. We study the problem of contention resolution for differentsized jobs on a simple channel. When a job makes a run attempt, it learns only whether the attempt succeeded or failed. We first analyze binary exponential backoff, and show that it achieves a makespan of

Contention Resolution with Heterogeneous Job Sizes

by unknown authors
"... Abstract. We study the problem of contention resolution for differentsized jobs on a simple channel. When a job makes a run attempt, it learns only whether the attempt succeeded or failed. We first analyze binary exponential backoff, and show that it achieves a makespan of ..."
Abstract - Add to MetaCart
Abstract. We study the problem of contention resolution for differentsized jobs on a simple channel. When a job makes a run attempt, it learns only whether the attempt succeeded or failed. We first analyze binary exponential backoff, and show that it achieves a makespan of

Semi-Online Scheduling With Decreasing Job Sizes

by Steve Seiden, Jirí Sgall, Gerhard Woeginger , 1998
"... We investigate the problem of semi-online scheduling jobs on m identical parallel machines where the jobs arrive in order of decreasing sizes. We present a complete solution for the preemptive variant of semi-online scheduling with decreasing job sizes. We give matching lower and upper bounds on the ..."
Abstract - Cited by 27 (2 self) - Add to MetaCart
We investigate the problem of semi-online scheduling jobs on m identical parallel machines where the jobs arrive in order of decreasing sizes. We present a complete solution for the preemptive variant of semi-online scheduling with decreasing job sizes. We give matching lower and upper bounds

PROCESSING MACHINES AND ARBITRARY JOB SIZES

by Yanming Zheng, Discrete Processing Machines, Yanming Zheng , 2010
"... in INDUSTRIAL AND SYSTEMS ENGINEERING by ..."
Abstract - Add to MetaCart
in INDUSTRIAL AND SYSTEMS ENGINEERING by

Scheduling despite inexact job-size information

by Adam Wierman, et al.
"... Motivated by the optimality of Shortest Remaining Processing Time (SRPT) for mean response time, in recent years many computer systems have used the heuristic of “favoring small jobs” in order to dramatically reduce user response times. However, rarely do computer systems have knowledge of exact rem ..."
Abstract - Cited by 15 (4 self) - Add to MetaCart
remaining sizes. In this paper, we introduce the class of ɛ-SMART policies, which formalizes the heuristic of “favoring small jobs” in a way that includes a wide range of policies that schedule using inexact job-size information. Examples of ɛ-SMART policies include (i) policies that use exact size
Results 1 - 10 of 2,618