Filters








7,350 Hits in 8.4 sec

Flexible Load Balancing with Multi-dimensional State-space Collapse: Throughput and Heavy-traffic Delay Optimality [article]

Xingyu Zhou and Jian Tan and Ness Shroff
2018 arXiv   pre-print
Further, we explore the greater flexibility provided by allowing a multi-dimensional state-space collapse in designing new load balancing policies that are both throughput optimal and heavy-traffic delay  ...  This result directly implies that achieving steady-state heavy-traffic delay optimality simply requires that no server is idling while others are busy at heavy loads, thus complementing and extending the  ...  balancing policies that are both throughput optimal and heavy-traffic delay optimal.  ... 
arXiv:1806.02939v1 fatcat:itk3gwtdbrf7na3m3muztptnuy

Throughput optimal scheduling in the presence of heavy-tailed traffic

Krishna Jagannathan, Mihalis Markakis, Eytan Modiano, John N. Tsitsiklis
2010 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton)  
We investigate the tail behavior of the steady-state queue occupancies under throughput optimal scheduling in the presence of heavy-tailed traffic.  ...  However, the priority policy is not throughput optimal, and can cause undesirable instability effects in the heavy queue. Finally, we propose a log-max-weight (LMW) scheduling policy.  ...  Additionally, we show that the LMW policy is throughput optimal, and can therefore stabilize traffic rates that are not supportable under priority scheduling.  ... 
doi:10.1109/allerton.2010.5707012 fatcat:lmm6qu54hbcnnheyxz6beoa6p4

Affinity Scheduling and the Applications on Data Center Scheduling with Data Locality [article]

Mohammadamir Kavousi
2017 arXiv   pre-print
There is a huge body of work on affinity scheduling, proposing heuristic algorithms which try to increase data locality in data centers like Delay Scheduling and Quincy.  ...  However, not enough attention has been put on theoretical guarantees on throughput and delay optimality of such algorithms.  ...  In this paper, we discuss different real-time scheduling algorithms for systems with multiple levels of data locality with theoretical guaranties for throughput and heavy-traffic optimality.  ... 
arXiv:1705.03125v1 fatcat:dpc4uy6qvbazzfaxs26slaq7ti

Near-Data Scheduling for Data Centers with Multiple Levels of Data Locality [article]

Ali Yekkehkhany
2017 arXiv   pre-print
both throughput and heavy-traffic optimal, while the latter is only throughput optimal, but heavy-traffic optimal in only a special traffic load.  ...  We show that an extension of the JSQ-MW algorithm for a system with thee levels of data locality is throughput optimal, but not heavy-traffic optimal for all loads, only for a special traffic scenario.  ...  throughput and heavy-traffic optimal algorithm for a system with two levels of data locality.  ... 
arXiv:1702.07802v2 fatcat:up76vkw27fdanovlahxw3g5v7u

Network selection for heterogeneous multi-service wireless networks

Jun Seok Kang, Seung-jae Han
2010 IEEE Local Computer Network Conference  
Another evolution direction is multi-service wireless networks. In multi-service networks, traffic of various QoS classes is serviced concurrently.  ...  In this paper, we propose a scalable and flexible network selection scheme for multi-service heterogeneous wireless networks.  ...  This is related with the NRT traffic scheduling policy and will determine the data transfer completion time of a NRT traffic user. IV. PERFORMANCE EVALUATION A.  ... 
doi:10.1109/lcn.2010.5735743 dblp:conf/lcn/KangH10 fatcat:lw3wx6sf7befvmsinpzwc5nzri

Scalable, optimal flow routing in datacenters via local link balancing

Siddhartha Sen, David Shue, Sunghwan Ihm, Michael J. Freedman
2013 Proceedings of the ninth ACM conference on Emerging networking experiments and technologies - CoNEXT '13  
Even recent proposals like centralized scheduling or end-host multi-pathing give suboptimal throughput, and they suffer from poor scalability and other limitations.  ...  We use an optimization decomposition to prove Local-Flow's optimality when combined with unmodified end hosts' TCP.  ...  We thank Jennifer Rexford, our shepherd, and the anonymous reviewers for their valuable feedback. This work was supported by funding from the National Science Foundation and a Google PhD Fellowship.  ... 
doi:10.1145/2535372.2535397 dblp:conf/conext/SenSIF13 fatcat:rrq5w2mt65d27lg66uli3pq47q

Data locality in MapReduce: A network perspective

Weina Wang, Lei Ying
2014 2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton)  
Simulation results demonstrate that with popularity skew, the Joint Scheduler improves the throughput and delay performance significantly compared to the Hadoop Fair Scheduler with delay scheduling, which  ...  To optimize the performance, we face the following challenges: how to strike the right balance between local and remote tasks, and how to route the traffic in the network appropriately to avoid congestion  ...  Section 4 presents the design of our Joint Scheduler and Section 5 establishes the throughput optimality.  ... 
doi:10.1109/allerton.2014.7028579 dblp:conf/allerton/WangY14 fatcat:refd6qtu6jfdlibi4q7xnj567a

Data locality in MapReduce: A network perspective

Weina Wang, Lei Ying
2016 Performance evaluation (Print)  
Simulation results demonstrate that with popularity skew, the Joint Scheduler improves the throughput and delay performance significantly compared to the Hadoop Fair Scheduler with delay scheduling, which  ...  To optimize the performance, we face the following challenges: how to strike the right balance between local and remote tasks, and how to route the traffic in the network appropriately to avoid congestion  ...  Section 4 presents the design of our Joint Scheduler and Section 5 establishes the throughput optimality.  ... 
doi:10.1016/j.peva.2015.12.002 fatcat:jtjf4dd6lvetfj4i373mmb3exu

MDTM: Optimizing Data Transfer Using Multicore-Aware I/O Scheduling

Liang Zhang, Phil Demar, Bockjoo Kim, Wenji Wu
2017 2017 IEEE 42nd Conference on Local Computer Networks (LCN)  
The MDTM scheduler exploits underlying multicore layouts to optimize throughput by reducing delay and contention for I/O reading and writing operations.  ...  In this paper, we identify the issues that lead to underperformance of these tools, and present a new data transfer tool with an innovative I/O scheduler called MDTM.  ...  illustrates the differences in scheduling with and without I/O locality support.  ... 
doi:10.1109/lcn.2017.64 dblp:conf/lcn/ZhangDKW17 fatcat:5fw764fqmjckjpl4su7fl43kom

Local Greedy Approximation for Scheduling in Multihop Wireless Networks

Changhee Joo, Ness B. Shroff
2012 IEEE Transactions on Mobile Computing  
In this paper, we propose local greedy algorithms that achieve good throughput performance with lower complexity and delay.  ...  While policies in class (2) and class (3) achieve optimal throughput performance, they suffer from high complexity (i.e., high-order message exchanges), long convergence time, low delay performance, and  ...  Scheduling is a process that determines which links transmit, at what times, and at what power levels.  ... 
doi:10.1109/tmc.2011.33 fatcat:kbuxluvzyjalhevpwdlysa3vm4

Analyses of MAC performance for Multi-Carrier based wireless sensor networks

Fei Qin, John E. Mitchell
2011 2011 IEEE 36th Conference on Local Computer Networks  
We demonstrate that the proposed scheme can achieve better throughput under heavy offered traffic load, as a result of the higher bandwidth utilisation.  ...  In this work we adopt an OFDMA like Multi-Carrier scheme for wireless sensor networks with the aim of improving the performance in the presence of intensive traffic load.  ...  be achieved while still maintaining high throughput when exposed with heavy offered traffic load.  ... 
doi:10.1109/lcn.2011.6115564 dblp:conf/lcn/QinM11 fatcat:7fk6elmehzfe3jk4djdc4om6le

Hybrid Access Techniques for Densely Populated Wireless Local Area Networks [chapter]

J. Alonso-Zrate, C. Crespo, Ch. Verikoukis, L. Alonso
2011 Advances in Vehicular Networking Technologies  
164 Acknowledgments The research leading to these results has received funding from the research projects NEWCOM++ (ICT-216715), CO2GREEN (TEC2010-20823), CENTENO (TEC2008-06817-C02-02), and GREENET  ...  poll-based access of the PCF to achieve high performance in highly populated networks with heavy traffic load.  ...  the polls with data and ACK packets.  ... 
doi:10.5772/15002 fatcat:qo2czt5vpne5zo7666q6ahe7j4

Dependency-Aware Data Locality for MapReduce

Xiaoyi Fan, Xiaoqiang Ma, Jiangchuan Liu, Dan Li
2014 2014 IEEE 7th International Conference on Cloud Computing  
There have been a significant studies on data locality that seeks to co-locate computation with data, so as to reduce cross-server traffic in MapReduce.  ...  State-of-the-art data replication and task scheduling strategies achieve data locality through replicating popular files and spreading the replicas over multiple servers.  ...  Node-local is the optimal case that the task is scheduled on the node having data.  ... 
doi:10.1109/cloud.2014.62 dblp:conf/IEEEcloud/FanMLL14 fatcat:sqyn6akjdbfxxafdrt34n2mjhm

The Locality Principle [chapter]

Peter J. Denning
2006 Communication Networks and Computer Systems  
Working set memory management was the first exploitation of this principle; it prevented thrashing while maintaining near optimal system throughput, and eventually it enabled virtual memory systems to  ...  to a program's address trace observed during a backward window, and (3) memory management is optimal when it guarantees each program that its locality sets will be present in high-speed memory.  ...  With such a control, we expected that the multiprogramming level would rise to the optimal level and stabilize there.  ... 
doi:10.1142/9781860948947_0004 fatcat:t2wgrmpozja7lj2fqsmwq5ignm

Analysis and Evaluation of Dynamic Load Balancing in IEEE 802. 11b Wireless Local Area Networks

Farhad SoleimanianGharehchopogh, Zeinab Abbasi Khalifehlou
2012 International Journal of Computer Applications  
The features of wireless local area networks (WLANs) are simple installation with low cost, and support high speed data communications.  ...  This study is a discussion and evaluation of the techniques in dynamic load balancing in WLANs.  ...  In order to increasing overall system throughput, to be increasing number of APs in the mobile station which lead to heavy traffic distributing between them.  ... 
doi:10.5120/7486-0193 fatcat:6uk5qmsxrvc5leqwdj2dsikysi
« Previous Showing results 1 — 15 out of 7,350 results