A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
Book announcements
1993
Discrete Applied Mathematics
Preserved Fulltext
A scheduling problem. Barry C. Arnold, N. Balakrishnan and H. N. Nagaraja, A First Course in Order Statistics (Wiley, New York, 1992) 279 pages Chapter 1: Introduction and Preoiew. Order statistics. ...
Canonical constructions
and
hub diagrams. Zero-one integer programming
problems as netforms. Connections
to more general discrete
problems. Fixed-charge
model. Application:
UFT Graduates. ...
Linear estimation of location and scale parameters. Prediction or order statistics. Distribution-free confidence and tolerance intervals. Goodness-of-fit tests. Other applications, ...
doi:10.1016/0166-218x(93)90030-r
fatcat:ss6bl44ckvh63gsk22rycr44ja
An Efficient Study of Scheduling Algorithms with Freidman Test in WiMAX Networks
2014
Network Protocols and Algorithms
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The proposed scheme adapts dynamically the scheduler operation to according queue load and QoS constraints. ...
The experimental result and analysis show that the proposed scheduler schemes outperform the traditional scheduling techniques for rtPS traffic that allows ensuring QoS requirements for IPTV application ...
We also performed a statistical analysis of four schedulers with the Friedman test. ...
doi:10.5296/npa.v6i4.6582
fatcat:x66cq534bfaexpehax2mr2dsiq
Enhanced Low Latency Queuing Algorithm for Real Time Applications in Wireless Networks
2016
International Journal of Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In order to handle the resources effectively and to increase the QoS, proper packet scheduling algorithms need to be developed. ...
LLQ places delay sensitive applications such as voice and video in the SPQ and treat them preferentially over other traffic by allowing the application to be processed and sent first from the SPQ. ...
The behavior of queues and their traffic is monitored to address the buffer under-run problem. ...
doi:10.14716/ijtech.v7i4.1805
fatcat:bxmz5p4t5ncqzebxl7fgipseeu
Improving Resource Selection and Scheduling Using Predictions
[chapter]
2004
International Series in Operations Research and Management Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
Our approach to help address this problem is to provide predictions of when an application would start to execute if submitted to specific scheduled computer systems. ...
The first problem is selecting where to run an application on the many resources available in a grid. ...
Acknowledgments We wish to thank Ian Foster and Valerie Taylor who investigated many of the problems discussed here with the author. ...
doi:10.1007/978-1-4615-0509-9_16
fatcat:okb6h6a2bzaado2wwi6b7w4dta
Page 1951 of Mathematical Reviews Vol. , Issue 99c
[page]
1991
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
to queueing and scheduling problems. ...
We gen- eralize the standard order statistics result for Poisson processses, and show how to sample a busy period in the M/M/c system. ...
Page 421 of The Journal of the Operational Research Society Vol. 57, Issue 4
[page]
2006
The Journal of the Operational Research Society
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Statistical Process Control and Quality Improve- ment, 4th edn. Prentice-Hall: NJ.
Second Order Asymptotics. ...
The practical service simulation and the manufacturing problems presented here demonstrate the applicability of these results in practice.
References
Bechhofer RE, Santner TJ and Goldsman DM (1995). ...
Dynamic Service Request Scheduling for Mobile Edge Computing Systems
2018
Wireless Communications and Mobile Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Nowadays, mobile services (applications) running on terminal devices are becoming more and more computation-intensive. ...
Edge computing is an emerging technology to solve this problem, which places servers at the edge of the network. ...
In order to reduce queue length and maintain system stability, we seek to keep the Lyanuov function at a small value. ...
doi:10.1155/2018/1324897
fatcat:h3d3anw6hzgzlox5jrxskd2mxu
ADAPTIVE MODIFIED LOW LATENCY QUEUING ALGORITHM FOR REAL TIME TRAFFIC IN WiMAX NETWORKS
2017
Journal of Engineering Science and Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Scheduling algorithm determines the order of packet delivery among many packets which are waiting to be serviced from the queue. ...
The AMLLQ algorithm determines the order of scheduling between the two SPQs dynamically by considering the queue size. ...
Low latency queuing (LLQ) algorithm In order to overcome these problems, Cisco Systems has introduced Low Latency Queuing (LLQ) [12] algorithm which combines a single strict priority queue (SPQ) with ...
doaj:aeee45c540844585b9e2372e3eb939b1
fatcat:bdbxqnmdazestoemxc2cktj4mi
A Proof of Concept for Optimizing Task Parallelism by Locality Queues
[article]
2009
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Dynamic scheduling is fully preserved inside each domain, and is preferred over possible load imbalance even if non-local access is required. ...
We present a programming technique which ameliorates adverse effects of dynamic task distribution by sorting tasks into locality queues, each of which is preferably processed by threads that belong to ...
Acknowledgments Fruitful discussions with Gerhard Wellein and Thomas Zeiser are gratefully acknowledged. ...
arXiv:0902.1884v1
fatcat:ynoq35iv3bbwjfcnafaw4ukhr4
Page 1927 of Mathematical Reviews Vol. , Issue 96c
[page]
1996
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Machine speeds are supposed to be controllable and should be selected in order to minimize a certain penalty function. ...
(BE-BEL; Minsk)
* Scheduling theory. Multi-stage systems. (English summary) Translated and revised from the 1989 Russian original by the authors.
Mathematics and its Applications, 285. ...
Abstracts
1974
IBM Systems Journal
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
It utilizes some techniques that are more generally applicable, and some that make use of the structure of the crew-scheduling problem, and that therefore are spe- Cific to it.
ABSTRACTS IBM SYST J ...
This paper describes a statistical evaluation of the performance of the swap scheduling algorithm of an interactive computer system and investigation into foreground-background scheduling to improve sys ...
doi:10.1147/sj.133.0271
fatcat:du7qcyk4pvdzxokttlongwddtq
The Research of P2P Traffic Control Model Based on IPV6
2016
International Journal of Future Generation Communication and Networking
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
So it can contribute to reasonable network planning and effective traffic management. ...
The P2P traffic identification and control model in this paper can effectively identify and control P2P business flow in the Internet. ...
Acknowledgements The authors wish to thank Science of ...
doi:10.14257/ijfgcn.2016.9.7.01
fatcat:ooxwcphbjff77p2pezfphuoaem
Intelligent Workload Scheduling in Distributed Computing Environment for Balance Between Energy Efficiency and Performance
[chapter]
2019
Scheduling Problem - New Applications and Trends [Working Title]
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The main idea of the proposed approach is to use each node's individual energy consumption models in order to generate distributed system scaling patterns based on the statistical daily workload and then ...
adjust these patterns to match the current workload while using energy-aware Power Consumption and Performance Balance (PCPB) scheduling algorithm. ...
In order to estimate the dependency between the probability of job loss p loss and number of active nodes n, consider the queueing system with a finite queue: The basic concepts of queuing theory are requests ...
doi:10.5772/intechopen.86874
fatcat:pvrexkuxdvek5mnsvxcvutyjum
Exploiting incomplete information to manage multiprocessor tasks with variable arrival rates
2008
Computers & Operations Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Moreover, we also consider a test framework with a continuous generation of tasks in order to study the behavior of the proposed approach in real applications, which confirms the efficiency of our approach ...
We consider the case in which it is 1 possible to exploit probabilistic information and use this information to obtain better solutions in comparison with standard non clairvoyant on-line algorithms. ...
The main point of this paper is to introduce new aspects in the multiprocessor task scheduling model in order to capture the main features of the real applications described above, which are inherently ...
doi:10.1016/j.cor.2006.09.005
fatcat:xzs5dxrbnjcl5fl3y5vcnbc57e
Optimizing number of outbound door in the Crossdock based on a New Queuing System with the Assumption of Beta Arrival Time
2017
Scientia Iranica. International Journal of Science and Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Many studies on the problem of crossdocking have been conducted with respect to various characteristics of crossdocks. ...
In this paper, a queuing model is proposed in order to optimize the number of outbound doors based on minimizing the total costs, including the costs of adding a new outbound door and the expected waiting ...
The crossdock scheduling problem focuses on determining the assignment and order of service of the incoming and outgoing trucks to the inbound and outbound doors. ...
doi:10.24200/sci.2017.4452
fatcat:fioklouhsjfzxgqwlch23tn2z4
« Previous
Showing results 1 — 15 out of 38,562 results