Filters








44 Hits in 4.2 sec

Achieving Optimal Backlog in the Vanilla Multi-Processor Cup Game [article]

William Kuszmaul
2019 arXiv   pre-print
In each step of the p-processor cup game on n cups, a filler distributes up to p units of water among the cups, subject only to the constraint that no cup receives more than 1 unit of water; an emptier  ...  Designing strategies for the emptier that minimize backlog (i.e., the height of the fullest cup) is important for applications in processor scheduling, buffer management in networks, quality of service  ...  For the single-processor cup game, the greedy algorithm is known to achieve backlog O(log n), which is optimal for any deterministic algorithm [1, 15] .  ... 
arXiv:1910.13533v1 fatcat:lomlt67qrnb65nrzhxk62pft5e

Achieving Optimal Backlog in Multi-Processor Cup Games [article]

Michael A. Bender, Martin Farach-Colton, William Kuszmaul
2019 arXiv   pre-print
The single- and multi- processor cup games can be used to model natural problems in areas such as processor scheduling, deamortization, and buffer management.  ...  Whereas bounds for the single-processor cup game have been known for more than fifteen years, proving nontrivial bounds on backlog for the multi-processor extension has remained open.  ...  Acknowledgments This research was supported in part by NSF Grants 1314547 and 1533644.  ... 
arXiv:1904.02861v1 fatcat:ulh2esyoc5csxiohgcwvn23uny

Optimal Time-Backlog Tradeoffs for the Variable-Processor Cup Game [article]

William Kuszmaul, Shyam Narayanan
2022 arXiv   pre-print
This paper establishes a tight trade-off curve between time and backlog in the variable-processor cup game.  ...  They showed that this seemingly small modification fundamentally changes the dynamics of the game: whereas the optimal backlog in the fixed p-processor game is Θ(log n), independent of p, the optimal backlog  ...  In this version of the game, it is possible for the emptier to achieve a backlog of O(1), both in the single-processor cup game (i.e., p = 1) [35, 36] and in the multi-processor cup game (i.e., p > 1  ... 
arXiv:2205.01722v2 fatcat:yilhdnkp7rbzxgbwtjd4kafyd4

Theoretical Foundations of Storage Systems (Dagstuhl Seminar 19111)

Martin Farach-Colton, Inge Li Gørtz, Rob Johnson, Donald E. Porter, Michael Wagner
2019 Dagstuhl Reports  
This seminar brought together researchers from two distinct communities -algorithms researchers with an interest in external memory and systems researchers with an interest in storage -with the objective  ...  Proving nontrivial bounds on the backlog for the multi-processor cup game has remained open for decades.  ...  problems in processor scheduling, deamortization, and buffer management can be modeled as single-and multi-processor cup games.  ... 
doi:10.4230/dagrep.9.3.39 dblp:journals/dagstuhl-reports/Farach-ColtonGJ19 fatcat:pfbfw7sgzjeq7eoqnjurmwzq5u

How Asymmetry Helps Buffer Management: Achieving Optimal Tail Size in Cup Games [article]

William Kuszmaul
2021 arXiv   pre-print
We also extend our results to the multi-processor cup game, achieving tail size Õ(log n + p) on p processors with high probability in n.  ...  The cup game on n cups is a multi-step game with two players, a filler and an emptier.  ...  In any multi-processor cup game of poly n length, the asymmetric smoothed greedy algorithm achieves backlog O(log log n + log p) after each step, with high probability in n.  ... 
arXiv:2104.05172v1 fatcat:akhrxoah5zfpdkqbu5xbvoohny

Optimal Time-Backlog Tradeoffs for the Variable-Processor Cup Game

William Kuszmaul, Shyam Narayanan, Mikołaj Bojańczyk, Emanuela Merelli, David P. Woodruff
2022
This paper establishes a tight trade-off curve between time and backlog in the variable-processor cup game.  ...  They showed that this seemingly small modification fundamentally changes the dynamics of the game: whereas the optimal backlog in the fixed p-processor game is Θ(log n), independent of p, the optimal backlog  ...  In this version of the game, it is possible for the emptier to achieve a backlog of O (1) , both in the single-processor cup game (i.e., p = 1) [34, 35] and in the multi-processor cup game (i.e., p  ... 
doi:10.4230/lipics.icalp.2022.85 fatcat:esjmtptoorfdpmmbgxrpn5faai

High-speed wireless backbones: measurements from MagNets

Alessio Botta, Antonio Pescape, Giorgio Ventre, Roger P. Karrer
2007 2007 Fourth International Conference on Broadband Communications, Networks and Systems (BROADNETS '07)  
In contrast, we show that the link performance is largely unaffected by environmental factors, such as day/night or social events (i.e. 2006 FIFA World Cup semi-final and final matches).  ...  This paper presents an experimental evaluation of the single and multi-hop performance in terms of throughput, jitter, delay, packet loss, and assesses the impact of environmental factors on these parameters  ...  -Performance achieved by each the using Turbo Mode, Burst Mode, and Turbo+Burst Mode. -TCP performance over multi-hop paths.  ... 
doi:10.1109/broadnets.2007.4550499 dblp:conf/broadnets/BottaPVK07 fatcat:434uo5p37fauzgzc6fm46ver2y

The Vessel Schedule Recovery Problem (VSRP) – A MIP model for handling disruptions in liner shipping

Berit D. Brouer, Jakob Dirksen, David Pisinger, Christian E.M. Plum, Bo Vaaben
2013 European Journal of Operational Research  
for the optimization of plants and entire supply chains that are involved in EWO problems.  ...  The problem is framed as a multi-indicator assessment and is solved using a minimal cost objective.  ...  -Optimal Dynamic Tax Evasion: A Portfolio Approach Francesco Menoncin, Economics, Brescia University, Via S. Faustino, 74/B, 25122, Brescia, Italy, menoncin@eco.unibs.it, Rosella Levaggi  ... 
doi:10.1016/j.ejor.2012.08.016 fatcat:c27kagfnxnhjfbil2rydhjhomm

LANET: Visible-Light Ad Hoc Networks

Nan Cen, Jithin Jagannath, Simone Moretti, Zhangyu Guan, Tommaso Melodia
2018 Ad hoc networks  
In LANETs, VLC-enabled nodes are networked together via possibly multi-hop visible 660 light links in an ad hoc fashion to support various applications spanning terrestrial, underwater, air 661 as well  ...  When 87 increasing the link distance, for a given desired level of reliability the achievable data rate decays 88 sharply, thus limiting the number of applications where VLC high data rate transmissions  ...  This is a joint function of backlog and the achievable forward progress through the chosen 617 sector. Accordingly, B and C choose the sector corresponding to their maximum U ini .  ... 
doi:10.1016/j.adhoc.2018.04.009 fatcat:aa6dg2ae2bg6pd2cok5tho42ze

Ultra-Low Latency (ULL) Networks: The IEEE TSN and IETF DetNet Standards and Related 5G ULL Research

Ahmed Nasrallah, Akhilesh S. Thyagaturu, Ziyad Alharbi, Cuixiang Wang, Xing Shao, Martin Reisslein, Hesham ElBakoury
2019 IEEE Communications Surveys and Tutorials  
We survey the studies that specifically target the support of ULL in 5G networks, with the main categories of fronthaul, backhaul, and network management.  ...  ULL networking mechanisms play a critical role in the emerging fifth generation (5G) network access chain from wireless devices via access, backhaul, and core networks.  ...  The 4.9G corresponds to the optimization efforts for LTE towards 5G, where a drastic more than 10 fold reduction in the latency is achieved.  ... 
doi:10.1109/comst.2018.2869350 fatcat:kvymef5mbvfarfw3jnct5uj5ma

Intelligent Autonomous Robotics: A Robot Soccer Case Study

Peter Stone
2007 Synthesis Lectures on Artificial Intelligence and Machine Learning  
A significant amount of material is from our team technical report written after the 2003 RoboCup competition and written in collaboration with Kurt Dresner, Selim T.  ...  The main contributions of this lecture are (i) a roadmap for new classes and research groups interested in intelligent autonomous robotics who are starting from scratch with a new robot, and (ii) documentation  ...  Any combination can be achieved as shown in Fig. 5 .4.  ... 
doi:10.2200/s00090ed1v01y200705aim001 fatcat:mnrq7oqbzrhttbwsogb3oo2qfm

User Facilitated Real-Time Inter-Operator Resource Sharing

Ahmet Cihat Toker, Technische Universität Berlin, Technische Universität Berlin, Sahin Albayrak
2011
If it were possible for operators to obtain this information indirectly over a neutral path, it would also be possible to extend the gains of CRRM to multi operator scenarios.  ...  We propose an alternative method, in which an operator can estimate the load in the RAN of another operator. This alternative method involves the cooperation of the end users.  ...  However this is achieved with the cost of having a continuous state space which is multi-dimensional.  ... 
doi:10.14279/depositonce-2770 fatcat:tkrorzk73zdpzlutbt4djsenli

Size-based prioritization in Network Utility Maximization and its applicability to decentralized elastic electricity demand scheduling

BRUNO LUIS MENDIVEZ VASQUEZ
2022
This thesis proposes a common scheduling framework that aims at minimizing response time in both scenarios.  ...  It is well known that SRPT is not optimal for flow time in multi-processor systems, except in heavy load [31] .  ...  multi server SRPT, where the scheduler is not necessarily optimal.  ... 
doi:10.26180/20154905 fatcat:k5n3knu6dvasllh7ol7dxleaji

Building secure and reliable network applications [chapter]

Kenneth P. Birman
1997 Lecture Notes in Computer Science  
(The author sometimes chose this moment to get a hot cup of coffee, sharpen a pencil, or play a quick game of solitaire!).  ...  In their study, the range of performance was from 1.1ms to do a null RPC (equivalent to 4,400 instructions) on the "Cedar" system, highly optimized for the Dorado multi-processor, to 78ms (195,000 instructions  ...  Can you characterize a range of performance within which one protocol is superior to the others in terms of loss rate, achievable throughput, and consistently low latency?  ... 
doi:10.1007/3-540-63343-x_35 fatcat:rqkxmxr6djhfhplu2qmugnq274

Emerging Trends in Management, IT and Education

Dr. P S Aithal, Shreepathy R Bhat
2019 Zenodo  
International Conference on Emerging Trends in Management, IT and Education  ...  Scale jile helps scale methods on programs and portfolios to deliver integrated solutions such as a team of teams support, multi-level backlog, synchronize release and iteration planning, road mapping  ...  and also the game result.  ... 
doi:10.5281/zenodo.3492020 fatcat:wytrxibqsjegfi6oouvfjcoiia
« Previous Showing results 1 — 15 out of 44 results