100 Hits in 4.2 sec

Scheduling and Traffic Allocation for Tasks with Bounded Splittability [chapter]

Piotr Krysta, Peter Sanders, Berthold Vöcking
2003 Lecture Notes in Computer Science  
Optimal solutions for the ksplittable scheduling problem yield optimal solutions for this traffic allocation problem.  ...  This result is the first proof that bounded splittability reduces the complexity of scheduling as the unsplittable scheduling is known to be AEÈ-hard already for two machines.  ...  The k-splittable traffic allocation problem is a variant of the k-splittable scheduling problem.  ... 
doi:10.1007/978-3-540-45138-9_44 fatcat:wuu2i77wgvbohi3a7ek3fgftgq

Algorithms for Network-on-Chip Design with Guaranteed QoS [article]

Guy Even, Yaniv Fais
2015 arXiv   pre-print
Given a topology, a mapping of tasks to processing elements, and traffic requirements between the tasks, the algorithm computes the interconnection widths, a detailed static routing, and a periodic scheduling  ...  The algorithm supports arbitrary topologies and traffic patterns. Routing along multiple paths is allowed in order to increase utilization and decrease latency.  ...  Results Random steady traffic. We executed a random traffic model with steady traffic for 16 to 256 PEs over various topologies 4 . The schedule period is 8 time slots.  ... 
arXiv:1509.00249v1 fatcat:gl5vzylyyzcvjgjtikm2sranaa

Scheduling in green vehicular infrastructure with multiple roadside units

Amir Khezrian, Abdulla Hammad, Terence D. Todd, George Karakostas
2013 2013 IEEE International Conference on Communications (ICC)  
These bounds are used for comparisons with several proposed online scheduling algorithms.  ...  We consider both splittable and unsplittable RSU assignment scheduling (SRA and URA).  ...  If C opt and E opt are the optimal bound for the ILP, Algorithm 1 can be used to find a schedule with C opt and 2E opt .  ... 
doi:10.1109/icc.2013.6655264 dblp:conf/icc/KhezrianHTK13 fatcat:v2shaci23zfg5buf5ge5ntqrsm

Coordination mechanisms for congestion games

Marek Chrobak, Elias Koutsoupias
2004 ACM SIGACT News  
Typical examples include the selfish task allocation problem-in which users have tasks to schedule on machimes and compete for the execution time-and the selfish routing problem-in which selfish traffic  ...  The completion time for a task depends on the tasks allocated to its machine as well as on the scheduling policy of that machine.  ... 
doi:10.1145/1054916.1054933 fatcat:ehonaytd4rdglkzq4qromhj36m

IC-Data: Improving Compressed Data Processing in Hadoop

Adnan Haider, Xi Yang, Ning Liu, Xian-He Sun, Shuibing He
2015 2015 IEEE 22nd International Conference on High Performance Computing (HiPC)  
NOC reduces data load time and hides compression overhead by interleaving network I/O with compression.  ...  Additionally, we develop a MapReduce Module which recognizes the characteristics of compressed data to improve resource allocation and load balance.  ...  This research is also supported in part by NSF under NSF grants CNS-0751200, CNS-1162540, and CNS-1526887.  ... 
doi:10.1109/hipc.2015.28 dblp:conf/hipc/HaiderYLSH15 fatcat:e3kiik6eobfxxhwgsdvlzjbiva

Edge-based traffic engineering for OSPF networks

Jun Wang, Yaling Yang, Li Xiao, Klara Nahrstedt
2005 Computer Networks  
Finding the optimal traffic splitting and routing for a given k is NP-hard. Therefore, we present a heuristic algorithm to handle the problem.  ...  It is also able to keep "the same path for the same flow," which is desirable and beneficial to TCP applications.  ...  Acknowledgment The authors would like to thank William Yurcik, National Center for Supercomputing Applications (NCSA), University of Illinois at Urbana-Champaign, for his valuable comments and discussion  ... 
doi:10.1016/j.comnet.2004.11.008 fatcat:layv5qxgxvaktg6pydzygonxom

Scheduling (Dagstuhl Seminar 20081)

Nicole Megow, David Shmoys, Ola Svensson
2020 Dagstuhl Reports  
The seminar focused on the interplay between scheduling problems and problems that arise in the management of transportation and traffic.  ...  Important aspects at the intersection of these two research directions include data-driven approaches in dynamic decision-making, scheduling in combination with routing, shared mobility, and coordination  ...  for 1|r j , d j | j p j U j .  ... 
doi:10.4230/dagrep.10.2.50 dblp:journals/dagstuhl-reports/MegowSS20 fatcat:dtrzez6ogbhdjc56hbnv3hyuhy

Coordination mechanisms

George Christodoulou, Elias Koutsoupias, Akash Nanavati
2009 Theoretical Computer Science  
We give upper and lower bounds for the price of anarchy for selfish task allocation and congestion games.  ...  We introduce the notion of coordination mechanisms to improve the performance in systems with independent selfish and noncolluding agents.  ...  Selfish task allocation We now turn our attention to the coordination model for selfish task allocation. There are n players with loads and m identical facilities (machines or links).  ... 
doi:10.1016/j.tcs.2009.01.005 fatcat:trpp2kb3jzex3pikstvhna7qr4

Coordination Mechanisms [chapter]

George Christodoulou, Elias Koutsoupias, Akash Nanavati
2004 Lecture Notes in Computer Science  
We give upper and lower bounds for the price of anarchy for selfish task allocation and congestion games.  ...  We introduce the notion of coordination mechanisms to improve the performance in systems with independent selfish and noncolluding agents.  ...  Selfish task allocation We now turn our attention to the coordination model for selfish task allocation. There are n players with loads and m identical facilities (machines or links).  ... 
doi:10.1007/978-3-540-27836-8_31 fatcat:h4ovmqoo5nf5bj5fielifq72ai

Double Auction-Based Pricing Mechanism for Autonomous Vehicle Public Transportation System

James J. Q. Yu, Albert Y. S. Lam, Zhiyi Lu
2018 IEEE Transactions on Intelligent Vehicles  
We evaluate the performance of the proposed mechanism and charging rule with extensive simulations. The results show that the mechanism can result in better social welfare than the original scheme.  ...  In this paper, we re-design the pricing mechanism for handling multiple requests simultaneously.  ...  For splittable service, we prove the result by contradiction. Assume S∈Q k x k (S, r) = 2, i.e., an AV serves a splittable service request with two bids with seats S and S .  ... 
doi:10.1109/tiv.2018.2804161 fatcat:hsass74npbevreadk2jt4xnvf4

Mechanism design for fractional scheduling on unrelated machines

George Christodoulou, Elias Koutsoupias, Annamária Kovács
2010 ACM Transactions on Algorithms  
Scheduling on unrelated machines is one of the most general and classical variants of the task scheduling problem.  ...  Motivated by the fact that all the known deterministic and randomized mechanisms for the problem, assign each task independently from the others, we focus on an interesting subclass of allocation algorithms  ...  ., routing splittable traffic or flow problems. The fractional scheduling problem can be formulated as a linear program and hence it can be solved in polynomial time.  ... 
doi:10.1145/1721837.1721854 fatcat:rszd5lk7dvdrlifdlvbpi7ldem

Low-overhead hard real-time aware interconnect network router

Michel A. Kinsy, Srinivas Devadas
2014 2014 IEEE High Performance Extreme Computing Conference (HPEC)  
traffic with minimal hardware overhead.  ...  We propose a network-on-chip router that provides predictable and deterministic communication latency for hard real-time data traffic while maintaining high concurrency and throughput for best-effort/general-purpose  ...  Shi and Burns [7] also present a method for evaluating at design time the schedulability of a traffic-flow set with different quality of service (QoS) requirements in a real-time SoC/NoC communication  ... 
doi:10.1109/hpec.2014.7040976 dblp:conf/hpec/KinsyD14 fatcat:scnalfnj3ba5vpjb3chisz4xoy

It's About Time: On Optimal Virtual Network Embeddings under Temporal Flexibilities

Matthias Rost, Stefan Schmid, Anja Feldmann
2014 2014 IEEE 28th International Parallel and Distributed Processing Symposium  
For instance, many cloud applications suffer from today's variations of the intra-cloud bandwidth, which leads to poor and unpredictable application performance.  ...  Distributed applications often require highperformance networks with strict connectivity guarantees.  ...  Hence, the TVNEP conceptually consists of two tasks: (1) finding good embeddings for the VNets, and (2) scheduling the VNets in such a fashion, according to their temporal specification, that no resource  ... 
doi:10.1109/ipdps.2014.14 dblp:conf/ipps/RostSF14 fatcat:pq7t4tqmijbm3fieiep54ah6ei

Resource Calendaring for Mobile Edge Computing: Centralized and Decentralized Optimization Approaches

Bin Xiang, Jocelyne Elias, Fabio Martignon, Elisabetta Di Nitto
2021 Zenodo  
In this paper, we provide an optimization framework that considers several key aspects of the resource allocation problem with cooperating MECs.  ...  Mobile Edge Computing (MEC) is a key technology for the deployment of next generation (5G and beyond) mobile networks.  ...  This research was supported by the H2020-MSCA-ITN-2016 SPOTLIGHT under grant agreement number 722788 and the H2020-ICT-2020-1 PIACERE under grant agreement number 101000162.  ... 
doi:10.5281/zenodo.5106428 fatcat:hp3a6yourrchzfpc2b2cmhnugy

A fast robust optimization-based heuristic for the deployment of green virtual network functions

Antonio Marotta, Enrica Zola, Fabio D'Andreagiovanni, Andreas Kassler
2017 Journal of Network and Computer Applications  
solutions for large instances under one second.  ...  In this work, we apply the theory of robust optimization to deal with such parameter uncertainty.  ...  The joint problem of VNF scheduling and traffic steering is studied in [19] as a mixed ILP (MILP), with the goal of minimizing the makespan/latency of the overall VNFs' schedule.  ... 
doi:10.1016/j.jnca.2017.07.014 fatcat:pbmwe75lkfaqnf6q2245fv5f6m
« Previous Showing results 1 — 15 out of 100 results