UofT Libraries is getting a new library services platform in January 2021.
Learn more about the change.

Search Articles

X
Search Filters
Format Format
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
scheduling (9) 9
m/g/1 (5) 5
srpt (5) 5
processor sharing (4) 4
response time (4) 4
science & technology (4) 4
shortest remaining processing time (4) 4
technology (4) 4
computer science (3) 3
computer science, theory & methods (3) 3
least attained service (3) 3
prozesszeit (3) 3
rückmeldezeit (3) 3
algorithms (2) 2
computer networks (2) 2
computer science, hardware & architecture (2) 2
computer systems (2) 2
design and construction (2) 2
electronic digital computers (2) 2
evaluation (2) 2
feedback (2) 2
heavy traffic (2) 2
las (2) 2
m/g/k (2) 2
mathematical models (2) 2
mathematics (2) 2
operating systems (2) 2
preemptive shortest job first (2) 2
psjf (2) 2
queuing networks (2) 2
queuing theory (2) 2
server (2) 2
servers (2) 2
set (2) 2
shortest elapsed time (2) 2
studies (2) 2
transaction systems (2) 2
unfairness (2) 2
adp systems (1) 1
analysis (1) 1
applied (1) 1
arquitectura de ordenadores (1) 1
bedientheorie (1) 1
bedienungstheorie (1) 1
betriebssystem (1) 1
busy period (1) 1
busy periods (1) 1
closed form (1) 1
colas, teoría de (1) 1
computer (1) 1
computer centers (1) 1
computer communication networks (1) 1
computer systems -- design and construction -- mathematics (1) 1
computer systems / design and construction / mathematics (1) 1
computer systems ; design and construction ; mathematics (1) 1
computer systems design and constructionmathematics (1) 1
computer-system (1) 1
computers (1) 1
computers / general (1) 1
computers / general. bisacsh (1) 1
computers general (1) 1
computersystem (1) 1
computing systems (1) 1
conservation (1) 1
conservation law (1) 1
convergence (1) 1
cumulants (1) 1
customer services (1) 1
cyberinfrastructure (1) 1
data transmission systems (1) 1
datenverarbeitungsanlage (1) 1
datorsystem (1) 1
design (1) 1
digitale datenverarbeitungsanlage (1) 1
digitale rechenanlage (1) 1
digitaler computer (1) 1
digitalrechner (1) 1
dimensionality reduction (1) 1
diseño y construcción (1) 1
dva (1) 1
economics / management science (1) 1
eingetragenes design (1) 1
electronic systems (1) 1
elektronenrechner (1) 1
elektronische rechenanlage (1) 1
elektronischer rechenautomat (1) 1
erlang traffic formula (1) 1
exact response time analysis (1) 1
file servers (1) 1
fluctuating load (1) 1
foreground background (1) 1
foreground-background (1) 1
formgebung (1) 1
formula omitted (1) 1
general (1) 1
gittins index (1) 1
gittins policy (1) 1
internet (1) 1
kybernetika (1) 1
laplace-transformation (1) 1
more...
Library Location Library Location
Language Language
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


2013, ISBN 9781107027503, Volume 9781107027503, xxiii, 548
"Computer systems design is full of conundrums. Tackling the questions that systems designers care about, this book brings queueing theory decisively back to... 
COMPUTERS / General | Computer systems | Queuing networks (Data transmission) | Queuing theory | Mathematical models | Mathematics | Design and construction | Transaction systems (Computer systems)
Book
2013, ISBN 9781107027503
"Computer systems design is full of conundrums. Tackling the questions that systems designers care about, this book brings queueing theory decisively back to... 
Computer systems | Queuing networks (Data transmission) | Queuing theory | Mathematical models | Mathematics | Design and construction | Transaction systems (Computer systems)
Web Resource
Performance Evaluation Review, ISSN 0163-5999, 01/2019, Volume 46, Issue 2, pp. 9 - 11
...SRPT for Multiserver Systems Isaac Grosof. Ziv Scully. Mor Harchol-Balter. 1. INTRODUCTION The Shortest Remaining Processing Time (SRPT) schedul­ing policy... 
Conference Proceeding
ACM transactions on computer systems, ISSN 0734-2071, 05/2003, Volume 21, Issue 2, pp. 207 - 233
...Size-Based Scheduling to Improve Web Performance MOR HARCHOL-BALTER, BIANCA SCHROEDER, NIKHIL BANSAL, and MUKESH AGRAWAL Carnegie Mellon University... 
web servers | Conservation law | system performance and design | SRPT | scheduling | networking | SJF | Networking | System performance and design | Scheduling | Web servers | Computer Science, Theory & Methods | Technology | Computer Science | Science & Technology | Algorithms | Research | Workloads
Journal Article
ACM transactions on Internet technology, ISSN 1533-5399, 02/2006, Volume 6, Issue 1, pp. 20 - 52
...Web Servers Under Overload: How Scheduling Can Help BIANCA SCHROEDER and MOR HARCHOL-BALTER Carnegie Mellon University This article provides a detailed... 
starvation | scheduling | SRPT | Web server | overload | unfairness | Unfairness | Starvation | Scheduling | Overload | Studies | Internet | Servers
Journal Article
Performance evaluation, ISSN 0166-5316, 11/2018, Volume 127-128, pp. 154 - 175
The Shortest Remaining Processing Time (SRPT) scheduling policy and its variants have been extensively studied in both theoretical and practical settings.... 
Computer Science, Theory & Methods | Computer Science, Hardware & Architecture | Technology | Computer Science | Science & Technology
Journal Article
Performance evaluation, ISSN 0166-5316, 2006, Volume 63, Issue 6, pp. 524 - 552
Approximating general distributions by phase-type (PH) distributions is a popular technique in stochastic analysis, since the Markovian property of PH... 
Moment matching | Normalized moment | Closed form | PH distribution | Algorithms
Journal Article
Journal Article
Performance Evaluation Review, ISSN 0163-5999, 01/2019, Volume 46, Issue 3, pp. 8 - 9
... Dept. Carnegie Mellon University Pittsburgh, PA, US zscully@cs.cmu.edu Mor Harchol-Balter* Computer Science Dept. Carnegie Mellon University Pittsburgh, PA, US... 
Preemptive shortest job first (PSJF) | M/G/k | Foreground background (FB) | Shortest remaining processing time (SRPT) | Heavy traffic | Response time bound
Conference Proceeding
Proceedings of the ACM on measurement and analysis of computing systems, ISSN 2476-1249, 04/2018, Volume 2, Issue 1, pp. 1 - 30
We consider an extremely broad class of M/G/1 scheduling policies called SOAP: Schedule Ordered by Age-based Priority. The SOAP policies include almost all... 
m/g/1 | shortest expected remaining processing time (serpt) | gittins index | exact response time analysis
Journal Article
Performance evaluation, ISSN 0166-5316, 2002, Volume 49, Issue 1, pp. 241 - 256
We explore the performance of an M/GI/1 queue under various scheduling policies from the perspective of a new metric: the slowdown experienced by the largest... 
Scheduling | Large jobs | Processor-sharing | Shortest-remaining-processing-time | Conservation | Convergence
Journal Article
Operations research letters, ISSN 0167-6377, 2004, Volume 32, Issue 1, pp. 73 - 76
We compare the overall mean response time (a.k.a. sojourn time) of the processor sharing ( PS) and feedback ( FB) queues under an M/GI/1 system. We show that... 
Shortest elapsed time (SET) | M/G/1 | Response time | Least attained service (LAS) | Processor sharing (PS) | Sojourn time | Scheduling | Feedback (FB) | Operations Research & Management Science | Technology | Science & Technology
Journal Article
Performance evaluation, ISSN 0166-5316, 2006, Volume 63, Issue 12, pp. 1253 - 1272
We ask the question, “for minimizing mean response time (sojourn time), which is preferable: one fast server of speed 1, or k slow servers each of speed 1 / k... 
Queueing | Preemptive | Dimensionality reduction | Busy period | Priority | Scheduling | formula omitted | Multiserver | M / PH / k | Computer Science, Theory & Methods | Computer Science, Hardware & Architecture | Technology | Computer Science | Science & Technology | File servers
Journal Article
Performance evaluation, ISSN 0166-5316
We consider scheduling to minimize mean response time of the M/G/k queue with unknown job sizes. In the single-server k=1 case, the optimal policy is the... 
M/G/k | Response time | Gittins policy | Shortest expected processing time (SERPT) | Heavy traffic | Scheduling
Journal Article
Proceedings of the 2005 ACM SIGMETRICS international conference on measurement and modeling of computer systems, ISSN 0163-5999, 06/2005, pp. 229 - 240
... Pittsburgh, PA 15213 acw@cs.cmu.edu Mor Harchol-Balter Carnegie Mellon University 5000 Forbes Avenue Pittsburgh, PA 15213 harchol@cs.cmu.edu ABSTRACT In addition... 
SET | SRPT | shortest job first | predictability | foreground-background | cumulants | M/G/1 | response time | variance | scheduling | shortest remaining processing time | PSJF | least attained service | LAS | processor sharing
Conference Proceeding
Performance evaluation review, ISSN 0163-5999, 2001, Volume 29, Issue 3, pp. 12 - 14
...Analysis of M/G/1/SRPT under Transient Overload 1 Nikhil Bansal and Mor Harchol-Balter School of Computer Science Carnegie Mellon University Pittsburgh, PA... 
Journal Article
Performance evaluation review, ISSN 0163-5999, 12/2002, Volume 30, Issue 3, pp. 9 - 11
...Understanding the Slowdown of Large Jobs in an M/GIll System, Mor HarchoI-Baltert Karl Sigman* Adam Wierman~ ABSTRACT We explore the performance of an M/GI/1... 
Journal Article
Proceedings of the 2003 ACM SIGMETRICS international conference on measurement and modeling of computer systems, ISSN 0163-5999, 06/2003, pp. 238 - 249
It is common to evaluate scheduling policies based on their mean response times. Another important, but sometimes opposing, performance metric is a scheduling... 
feedback | SET | M/G/1 | SRPT | shortest elapsed time | unfairness | scheduling | shortest remaining processing time | least attained service | slowdown | LAS | processor sharing
Conference Proceeding
No results were found for your search.

Cannot display more than 1000 results, please narrow the terms of your search.