Results 11 - 20
of
167
A Monotonicity Theorem for Tandem Queues
, 1992
"... Tandem queues are often used for performance modeling in production lines, computer systems and communication networks. Consider a series of tandem first-come-first-served queues with single servers. The buffers may be finite or infinite. When a finite buffer is full, the upstream server may suffer ..."
Abstract
- Add to MetaCart
from transfer blocking or service blocking. A job's service requirements at various servers may be correlated. A transient analysis shows that, if the network is open, then response time decreases if a server is speeded up, or a finite buffer increases in size, or service blocking is changed
Design and Implementation of Statistical Rate Monotonic Scheduling in KURT Linux
- In IEEE Real-Time Systems Symposium
, 1998
"... Statistical Rate Monotonic Scheduling (SRMS) is a generalization of the classical RMS results of Liu and Layland [LL73] for periodic tasks with highly variable execution times and statistical QoS requirements. The main tenet of SRMS is that the variability in task resource requirements could be smoo ..."
Abstract
-
Cited by 20 (0 self)
- Add to MetaCart
Statistical Rate Monotonic Scheduling (SRMS) is a generalization of the classical RMS results of Liu and Layland [LL73] for periodic tasks with highly variable execution times and statistical QoS requirements. The main tenet of SRMS is that the variability in task resource requirements could
Monotonicity Of Optimal Performance Measures For Polling Systems
- Probability in the Engineering and Informational Sciences
, 1997
"... We consider scheduling a single server in a multi-class queue subject to set-up times and set-up costs. We examine the issue of whether or not reductions in the mean and variance of the set-up time distributions can lead to degraded system performance. Provided that set-ups are reduced according ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
to avoid degradation of performance as set-up times are cut. We extend this approach to show that system performance is monotonic with respect to service time distributions, switching costs, holding costs, and uniform reductions in the arrival rates. Extensions to sequence-dependent set-ups and job
The Power of Lexicographic Maximization: Beyond Cross-Monotonicity
, 2009
"... In a cost-sharing problem, finitely many players have an unknown preference for some non-rivalrous but excludable good (service). The task is to determine which set of players Q to serve and how to distribute the incurred cost C(Q). Typical constraints of cost-sharing problems demand for mechanisms ..."
Abstract
- Add to MetaCart
findings to the problem of sharing the makespan cost when scheduling jobs on parallel related machines. Towards understanding the limitations imposed by GSP itself, we establish an impossibility result stating that for more than three players, exactly budget-balanced GSP mechanisms do not exist in general
Slack Stealing Job Admission Control
, 1998
"... In this paper, we present Slack Stealing Job Admission Control (SSJAC) -- a methodology for scheduling periodic firm-deadline tasks with variable resource requirements, subject to controllable Quality of Service (QoS) constraints. In a system that uses Rate Monotonic Scheduling, SSJAC augments th ..."
Abstract
-
Cited by 7 (5 self)
- Add to MetaCart
In this paper, we present Slack Stealing Job Admission Control (SSJAC) -- a methodology for scheduling periodic firm-deadline tasks with variable resource requirements, subject to controllable Quality of Service (QoS) constraints. In a system that uses Rate Monotonic Scheduling, SSJAC augments
A general scheme for designing monotone algorithms for scheduling problems with precedence constraints
- IN WAOA ’08: 6TH INTERNATIONAL WORKSHOP ON APPROXIMATION AND ONLINE ALGORITHMS, 2008
, 2009
"... We provide a general scheme for constructing monotone algorithms for a wide class C of scheduling problems Q|prec,rj|γ on related machines with precedence constraints and/or release dates. Our scheme works in the offline and the online setting. It takes as input two approximation/competitive algor ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
We provide a general scheme for constructing monotone algorithms for a wide class C of scheduling problems Q|prec,rj|γ on related machines with precedence constraints and/or release dates. Our scheme works in the offline and the online setting. It takes as input two approximation
Procrastination for leakage-aware rate-monotonic scheduling on a dynamic voltage scaling processor
- In ACM SIGPLAN Conference on Language, Compiler, and Tool Support for Embedded Systems
, 2006
"... As the dynamic voltage scaling (DVS) technique provides system engineers the flexibility to trade-off the performance and the energy consumption, DVS has been adopted in many computing systems. However, the longer a job executes, the more energy in the leakage current the device/processor consumes f ..."
Abstract
-
Cited by 19 (7 self)
- Add to MetaCart
for the job. To reduce the energy consumption resulting from the leakage current, a system might enter the dormant mode. This paper targets energy-efficient rate-monotonic scheduling for periodic real-time tasks on a uniprocessor DVS system with non-negligible leakage power consumption. On-line simulated
Approximation Techniques for Utilitarian Mechanism Design
, 2005
"... This paper deals with the design of efficiently computable incentive compatible, or truthful, mechanisms for combinatorial optimization problems with multi-parameter agents. We focus on approximation algorithms for NP-hard mechanism design problems. These algorithms need to satisfy certain monotonic ..."
Abstract
-
Cited by 92 (5 self)
- Add to MetaCart
problems like, e.g., knapsack, constrained shortest path, or job scheduling with deadlines. For example, the monotone FPTAS for the knapsack problem gives a very efficient, truthful mechanism for single-minded multi-unit auctions. The best previous result for such auctions was a 2-approximation
PeriodDependent Initial Values for Exact Schedulability Test of Rate Monotonic Systems
- In Proceedings Parallel and Distributed Processing Symposium 2007, IPDPS 2007
, 2007
"... Real-time systems using Rate Monotonic fixed priority scheduling can be checked for schedulability either by pessimistic schedulability conditions or exact testing. Exact testing provides a more precise result but cannot always be performed in polynomial time. Audsley et al. proposed one of the earl ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
Real-time systems using Rate Monotonic fixed priority scheduling can be checked for schedulability either by pessimistic schedulability conditions or exact testing. Exact testing provides a more precise result but cannot always be performed in polynomial time. Audsley et al. proposed one
JOB STRESS AND ITS IMPACT ON PERFORMANCE EMPLOYEES WORKING IN BPOS: A STUDY
"... ABSTRACT The purpose of this paper is to determine what and how job-related and demographic variables are associated with performance of the BPO employees. This paper has made an attempt to find out the job stress factors affecting the performance of the employees. For this study 100 questionnaires ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
health. The business process outsourcing (BPO) industry in India has always been characterized by ungodly hours, monotonous job, low perceived value, dispirited efficiency resulting to high attrition level. Notwithstanding the ever rising attrition rate, it has become critical for the companies
Results 11 - 20
of
167