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.
Filters
Evolution of distributed computing theory
2008
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing - PODC '08
Preserved Fulltext
Questions: What is a scheduler? How does a fair schedule arise?'
Token circulation Consider an oriented ring of 3 or more processors, two of which contain a token. ...
Fairness The order in which processes take steps is determined by a scheduler. A fairness condition constrains what the scheduler is allowed to do. ...
doi:10.1145/1400751.1400858
dblp:conf/podc/Fischer08
fatcat:ospmit6o2jfbnos53f7zvpl4n4
Fair Scheduling Scheme with Feedback in the Joint Allocation of Heterogeneous Resources
2006
2006 IEEE International Conference on Communications
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.
Efficient QoS guarantee in network environments mainly relies on the fair scheduling and reliable allocation of computing, storage space and bandwidth resources, which are available in each node. ...
In this paper, a kind of novel architecture is presented, which supports the joint allocation of heterogeneous resources. ...
In this part, the basic performance bounds of the proposed architecture are presented with the network calculus theory. A. ...
doi:10.1109/icc.2006.254740
dblp:conf/icc/Hua06
fatcat:gbvqi432bbakvdddvwwrm6qhle
A graph theory based opportunistic link scheduling for wireless ad hoc networks
2009
IEEE Transactions on Wireless Communications
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 2016; you can also visit the original URL.
The file type is application/pdf.
We also propose GOS, a distributed Graph theory based and Opportunistic Scheduling algorithm, which modifies IEEE 802.11 protocol to implement the optimal scheduling policy. ...
Taking the contention relationship and the channel diversity among links into account, we extend the concept of multi-user diversity to a more generalized one, by which a set of senders cooperatively schedule ...
Performance Lower Bound of the Optimal Scheduling As we mentioned in the Section III, the centralized and greedy algorithm to locate MWIS obtains a lower bound as equation (23) . ...
doi:10.1109/twc.2009.070311
fatcat:qnxtrhcrojgqbd2cuaea67p6o4
Controllable fair queuing for meeting performance goals
2005
Performance evaluation (Print)
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 2006; you can also visit the original URL.
The file type is application/pdf.
The experimental results demonstrate the importance of controllable-fair scheduling for feedback control of computing utilities. ...
The analytic results are confirmed by experimental evaluation using a three-tier Web service and a prototype controllable-fair scheduler called C-SFQ(D). ...
D reflects a trade-off between resource utilization and the worst-case fairness bound of the scheduler. ...
doi:10.1016/j.peva.2005.07.019
fatcat:eowm2vdcwrfxbhattdm6kfcjyu
Finitary fairness
1998
ACM Transactions on Programming Languages and Systems
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.
Fairness is a mathematical abstraction: in a multiprogramming environment, fairness abstracts the details of admissible ("fair") schedulers; in a distributed environment, fairness abstracts the relative ...
In a multiprogramming environment, the program then satisfies the property for all fair finite-state schedulers. ...
ACKNOWLEDGMENTS Notions that are similar to k-bounded fairness, for a fixed k, have been defined in several places [Jayasimha 1988 ]; the notion of bounded fairness seems to be part of the folklore, but ...
doi:10.1145/295656.295659
fatcat:iy4iske4rzfcbdwtyxrdit77he
An evaluation of fair packet schedulers using a novel measure of instantaneous fairness
2005
Computer Communications
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 2015; you can also visit the original URL.
The file type is application/pdf.
This measure captures the instantaneous fairness of a scheduler and, unlike other measures based on bounds, also captures the fairness of the scheduler in its handling of flows during idle periods. ...
Fairness in packet schedulers is an intuitively desirable property with practical value; fair schedulers such as weighted fair queueing are a critical component of quality-of-service mechanisms that seek ...
However, the worst-case performance bound is just one aspect of the fairness achieved by a packet scheduler. ...
doi:10.1016/j.comcom.2005.04.002
fatcat:bciujsuo75dylcmsld5vd4dok4
FlowFlex: Malleable Scheduling for Flows of MapReduce Jobs
[chapter]
2013
Lecture Notes in Computer 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 2018; you can also visit the original URL.
The file type is application/pdf.
We introduce FlowFlex, a highly generic and effective scheduler for flows of MapReduce jobs connected by precedence constraints. ...
All told, FlowFlex dramatically extends the capabilities of the earlier Flex scheduler for singleton MapReduce jobs while simultaneously providing a solid theoretical foundation for both. ...
We advance the theory of malleable parallel scheduling with precedence constraints. ...
doi:10.1007/978-3-642-45065-5_6
fatcat:n6maqvcqdjhtfdcpmlviy2r6w4
Using Holistic Queue Scheduling to Optimize the Real-Time Performance of AFDX
2014
Open Automation and Control Systems Journal
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.
To cope with this problem, this paper presents a Holistic Queue Scheduling policy to optimize the real-time performance of AFDX, and estimate the latency bounds based on Network Calculus. ...
Simulation results show that this policy not only ensures real-time critical data, but also ensures the fairness of scheduling non-critical data. ...
Chang developed the theory of network calculus by introducing a mathematical representation of min-plus algebra. ...
doi:10.2174/1874444301406011612
fatcat:6j6xtivui5dxvjumpk5jfsge5i
Adversarial Scheduling in Evolutionary Game Dynamics
[article]
2008
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.
A nonadaptive scheduler that is only allowed to choose one of the participants is no more powerful than a random scheduler. ...
With this restriction even an adaptive scheduler is not significantly more powerful than the random scheduler, provided it is "reasonably fair". ...
This work has been supported by the Romanian CNCSIS through a PN II/Parteneriate Grant, by the U.S. ...
arXiv:0812.1194v1
fatcat:xmgy4ad4b5hblhy5h7pp7hzqle
On Fairness-Efficiency Tradeoffs for Multi-resource Packet Processing
2013
2013 IEEE 33rd International Conference on Distributed Computing Systems Workshops
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.
An effective algorithm is therefore highly desired to schedule packets in a way such that multiple resources are shared in a fair and efficient manner. ...
Therefore, a new and important research problem arises: given a desired fairness-efficiency tradeoff, how can we design a packet scheduling algorithm to reinforce such a tradeoff? ...
We therefore measure the fairness of a schedule by bounding the gap of the processing time received on the dominant resources between two backlogged flows. ...
doi:10.1109/icdcsw.2013.69
dblp:conf/icdcsw/WangLL13
fatcat:jvq7zbkqtzdn3ft3jai2nq2qca
Multi-organization scheduling approximation algorithms
2011
Concurrency and Computation
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.
We formally define a selfishness notion, by means of restrictions on the schedules. We prove that selfish behavior imposes a lower bound of 2 on the approximation ratio for the global makespan. ...
In this paper we consider the problem of scheduling on computing platforms composed of several independent organizations, known as the Multi-Organization Scheduling Problem (MOSP). ...
ACKNOWLEDGEMENTS This work was partially sponsored by a Google Research Award and partially supported by the bilateral Brazilian-French CAPES-COFECUB program (Ma 660/10). ...
doi:10.1002/cpe.1752
fatcat:yo4fhy5jezaylkttww54td7na4
On the latency and fairness characteristics of pre-order deficit round Robin
2004
Computer Communications
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.
We further study the fairness properties of Pre-order DRR using a recently proposed measure of instantaneous fairness that seeks to more accurately capture the fairness of a scheduler. ...
The latency bound of a scheduling discipline is an important QoS parameter, especially for real-time playback applications. ...
This theory has occasionally found use in research in computer networks in the fairness analysis of protocols [22] . The fairness measure proposed in Ref. ...
doi:10.1016/j.comcom.2003.12.006
fatcat:kuuzzfx54fea3dgg7ant4a622i
Dynamics at the Boundary of Game Theory and Distributed Computing
[article]
2017
arXiv
pre-print
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.
Other Versions
Our work opens a new avenue for research at the intersection of distributed computing and game theory. ...
We exhibit a general non-convergence result for a broad class of dynamics in asynchronous settings. ...
This work was initiated partly as result of the DIMACS Special Focus on Communication Security and Information Privacy. ...
arXiv:1509.02955v2
fatcat:k46a2pa47vhwldfmn4ls2e3ymq
Introduction
2016
Queueing systems
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.
The paper of Shah and de Veciana considers the performance analysis of queueing systems employing various fair scheduling policies, such as alpha-fairness or balanced B Ayalvadi Ganesh a. ...
This is the classical fork-join queueing model, and is studied in the paper of Rizk, Poloczek and Ciucu, who obtain stochastic bounds on delays in such a system. ...
The Backpressure algorithm is a canonical example of such a scheduling policy. ...
doi:10.1007/s11134-016-9495-9
fatcat:upydp57u5raqxhme5qlxr2he7m
Federated scheduling for stochastic parallel real-time tasks
2014
2014 IEEE 20th International Conference on Embedded and Real-Time Computing Systems and Applications
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.
We define a stochastic capacity augmentation bound and prove that federated scheduling algorithms guarantee the same bound of 2 for stochastic tasks. ...
Federated scheduling is a strategy to schedule parallel real-time tasks: It allocates a dedicated cluster of cores to high-utilization task (utilization > 1); It uses a multiprocessor scheduling algorithm ...
Therefore, since FAIR provides a capacity augmentation bound of 2, so does this algorithm. ...
doi:10.1109/rtcsa.2014.6910549
dblp:conf/rtcsa/LiAGL14
fatcat:ehj6atdebrg3pfvybql5hik5wi
« Previous
Showing results 1 — 15 out of 68,575 results