Filters








13 Hits in 3.2 sec

Pseudo-scheduling: A New Approach to the Broadcast Scheduling Problem [article]

Shaun N. Joseph, Lisa C. DiPippo
2012 arXiv   pre-print
The broadcast scheduling problem asks how a multihop network of broadcast transceivers operating on a shared medium may share the medium in such a way that communication over the entire network is possible  ...  This coloring is difficult to compute and may require a number of colors quadratic in the graph degree. This paper introduces pseudo-scheduling, a relaxation of distance-2 coloring.  ...  This is a total of 2∆ G − 2 vertices (including v), so Conclusion This work has introduced and motivated pseudo-scheduling as a new approach to the broadcast scheduling problem.  ... 
arXiv:1210.3319v1 fatcat:ozvmwt6ndbd6nlulq4vet6tl24

Pseudo-scheduling: A New Approach to the Broadcast Scheduling Problem [chapter]

Shaun N. Joseph, Lisa C. DiPippo
2013 Lecture Notes in Computer Science  
Performance • Let j be the number of colors used: d(Δ T -1) ≤ j ≤ 2d(Δ G -1) • Introduction • Introduction Broadcast scheduling problem -Simultaneous transmissions conflict -Hidden terminal problem •  ...  b needs the color of a before requesting color from q… • p needs to be told to "break the cycle" by just assigning color to a • DEP messages and "reverse" REPs achieve cycle-breaking d-Band Algorithm  ... 
doi:10.1007/978-3-642-36092-3_11 fatcat:65vucqkhdbfgzgvdznmhx5r76m

Non-Preemptive Min-Sum Scheduling with Resource Augmentation

Nikhil Bansal, Ho-Leung Chan, Rohit Khandekar, Kirk Pruhs, Cliff Stein, Baruch Schieber
2007 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07)  
formulation whose relaxation is sufficiently close to the integer optimum, and which can be transformed to a schedule on a faster machine.  ...  More precisely, we give the first O(1)-speed O(1)-approximations for the nonpreemptive scheduling problems and an O(1)-machine, O(1)-speed O(1)-approximation for Our main contribution is an integer programming  ...  Thus we obtain a 24-speed 1-approximation algorithm for maximizing throughput. Broadcast Scheduling We now explain how to extend our technique to broadcast scheduling.  ... 
doi:10.1109/focs.2007.11 dblp:conf/focs/FischerMS07 fatcat:7tbgzvw4o5hohgrjxsdwbiffle

Non-Preemptive Min-Sum Scheduling with Resource Augmentation

Nikhil Bansal, Ho-Leung Chan, Rohit Khandekar, Kirk Pruhs, Cliff Stein, Baruch Schieber
2007 Foundations of Computer Science (FOCS), IEEE Annual Symposium on  
formulation whose relaxation is sufficiently close to the integer optimum, and which can be transformed to a schedule on a faster machine.  ...  More precisely, we give the first O(1)-speed O(1)-approximations for the nonpreemptive scheduling problems and an O(1)-machine, O(1)-speed O(1)-approximation for Our main contribution is an integer programming  ...  Thus we obtain a 24-speed 1-approximation algorithm for maximizing throughput. Broadcast Scheduling We now explain how to extend our technique to broadcast scheduling.  ... 
doi:10.1109/focs.2007.4389530 fatcat:pro7j2k7yrb5tbovfrmi6w3bom

AGAMOS: A Graph-Based Approach to Modulo Scheduling for Clustered Microarchitectures

A. Aleta, J.M. Codina, J. Sanchez, A. Gonzalez, D. Kaeli
2009 IEEE transactions on computers  
This paper presents AGAMOS, a technique to modulo schedule loops on clustered micro-architectures.  ...  The proposed scheme uses a multi-level graph partitioning strategy to distribute the workload among clusters and reduces the number of inter-cluster communications at the same time.  ...  In order to deal with the phase-ordering problem, pseudo-schedules are used to guide cluster assignment and information from the partition is passed to the final scheduler.  ... 
doi:10.1109/tc.2009.32 fatcat:zjqa5ifrindj7dyd3exhwt3mmu

When is the right time to transmit in multi-hop White-Fi?

N. Facchi, F. Gringoli, D. Malone, P. Patras
2016 2016 IEEE 17th International Symposium on A World of Wireless, Mobile and Multimedia Networks (WoWMoM)  
Using a small test bed, we demonstrate a prototype implementation of a medium access protocol that learns appropriate transmission opportunities in such settings, achieving pseudo-scheduled behaviour ex  ...  Potential exists for the TV white-space (TVWS) wireless technology to bridge this digital divide, though efficient channel access mechanisms suited to multi-hop networks that operate in sub-gigahertz bands  ...  ACKNOWLEDGEMENTS The research leading to these results has received funding from the EC grant no.  ... 
doi:10.1109/wowmom.2016.7523539 dblp:conf/wowmom/FacchiGMP16 fatcat:g3qzcqvf7vh5fbdya4jrwwsex4

On bufferless routing of variable length messages in leveled networks

S.N. Bhatt, G. Bilardi, G. Pucci, A. Ranade, A.L. Rosenberg, E.J. Schwabe
1996 IEEE transactions on computers  
By insisting on oblivious routes for messages, we convert the communication problem to a pure scheduling problem.  ...  We introduce the notion of a virtual chatting schedule, and we show how e cient chatting schedules can often be produced from e cient virtual chatting schedules.  ...  This approach is then shown to yield e cient chatting schedules for tree networks. 6 II. The Problem Formalized A.  ... 
doi:10.1109/12.506427 fatcat:r42nrpb6xfcqbag5htzzufzge4

Heterogeneous Clustered VLIW Microarchitectures

Alex Aleta, Josep M. Codina, Antonio Gonzalez, David Kaeli
2007 International Symposium on Code Generation and Optimization (CGO'07)  
Finally, we present a modulo scheduling technique based on graph partitioning that exploits the opportunities presented on heterogeneous clustered microarchitectures.  ...  We propose a scheme to choose these parameters based on a model that estimates the energy consumption and the execution time of floating-point codes at compile time.  ...  To obtain an estimate, a pseudo-schedule is used [3] . A pseudo-schedule is an approximate schedule which can be computed quite fast.  ... 
doi:10.1109/cgo.2007.15 dblp:conf/cgo/AletaCGK07 fatcat:cczgrh2adjbklhjo26da5nqzlq

Max-Min Fair Resource Allocation in Millimetre-Wave Backhauls

Rui Li, Paul Patras
2019 IEEE Transactions on Mobile Computing  
We also thank Nicolò Facchi for helping us extend the NS-3 simulator, which we used for evaluation purposes.  ...  Similarly, Niu et al. propose MIS based scheduling that aims to minimise the energy consumption [37] . A joint scheduling and power allocation problem is also solved with MIS in [38] .  ...  Medium Access & Scheduling in Mm-wave Networks: Medium Access Control protocols for mm-wave communications can be grouped into two main classes -contentionbased and (pseudo-)scheduled.  ... 
doi:10.1109/tmc.2019.2917205 fatcat:5it6b6pmvbew7hdp6redye5c5e

Max-Min Fair Resource Allocation in Millimetre-Wave Backhauls [article]

Rui Li, Paul Patras
2019 arXiv   pre-print
In particular, resource allocation and scheduling of very narrow transmission/ reception beams requires to overcome terminal deafness and link blockage problems, while managing fairness issues that arise  ...  We evaluate the proposed WiHaul scheme over a broad range of practical network conditions, and demonstrate up to 5 times individual throughput gains and a fivefold improvement in terms of measurable fairness  ...  We also thank Nicolò Facchi for helping us extend the NS-3 simulator, which we used for evaluation purposes.  ... 
arXiv:1709.07078v2 fatcat:rpg4vmg72vfkvlkgbwbzjogxea

Scheduling with Setup Costs and Monotone Penalties

Rohit Khandekar, Kirsten Hildrum, Deepak Rajan, Joel Wolf
unpublished
Our approach gives a randomized polynomial time offline O(1)-speed O(1)-approximation algorithm for the broadcast scheduling problem with general cost functions as well. 1998 ACM Subject Classification  ...  We extend the approach of Bansal et al. (FOCS 2007) of rounding a linear programming relaxation which accounts for costs incurred due to the non-preemptive nature of the schedule.  ...  We obtain a pseudo-schedule for jobs in J c for each class c separately. Fix a class c. To obtain a pseudo-schedule for class c, we create an instance of the network flow problem.  ... 
fatcat:3nn3tje2avbcdnv6fvn3o64wzy

A fuzzy evolutionary approach with Taguchi parameter setting for the set covering problem

Jingpeng Li, R.S.K. Kwan
Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600)  
This thesis presents two evolutionary algorithms, namely a Genetic Algorithm and a Simulated Evolution algorithm, attempting to model and solve the driver scheduling problem in new ways.  ...  This approach has achieved success in solving driver scheduling problems from different companies, with comparable results to the previously best known solutions.  ...  This new approach is novel because it is the first time that the SE algorithm has been applied to the driver scheduling problem.  ... 
doi:10.1109/cec.2002.1004414 fatcat:fadifkm6ejdrda7wiz73g7qsvq

Model Predictive Control for Deferrable Loads Scheduling

Niangjun Chen
2014
In this thesis, we propose a real-time distributed deferrable load control algorithm to reduce the variance of aggregate load (load minus renewable generation) by shifting the power consumption of deferrable  ...  The algorithm is model predictive in nature, i.e., at every time step, the algorithm minimizes the expected variance to go with updated predictions.  ...  obtain a new schedule {p (k+1) n (τ )} T τ =t , and reports {p k+1 n (τ )} T τ =t to the utility.  ... 
doi:10.7907/493h-bd56 fatcat:aaifs4le65a6nnkd7oywqucogy