Search results for "scheduling"
showing 10 items of 275 documents
Fairness aware rate adaptation and proportional scheduling for IEE 802.11 wlans using FSE
2015
With its rapid development in the wireless markets, IEEE 802.11 WLAN is experiencing a huge popularity. However, due to the limitation of frequency bandwidth of WLANs, it is essential that the available radio resource should be fully utilized to offer different services to multiple users. In order to maximize system throughput while still guaranteeing the fairness among users, a proportional fairness based algorithm is proposed in this work. Since most of the previous resource allocation algorithms were simply based on the channel conditions without taking into account user’s demand, in this paper, we introduce the theory of fuzzy synthetic evaluation (FSE) which also allows us to consider …
Resource allocation for clustered network MIMO OFDMA systems
2012
In this article, we address the resource allocation problem for the downlink of a large network multiple input multiple output orthogonal frequency division multiplexing system with 3-sector base stations. The system is statically divided into a number of disjoint clusters of sectors. A two-step resource allocation scheme is proposed involving the inter-cluster and the intra-cluster levels. As a first step or inter-cluster level, two cooperative frequency reuse approaches are designed to mitigate the inter-cluster interference. A user partition method is proposed to divide the users of each cluster into cluster-edge and cluster-center users. To balance the cell-edge and the cell-average per…
Energy Efficient Resource Allocation and User Scheduling for Collaborative Mobile Clouds with Hybrid Receivers
2014
In this paper, we study the resource allocation and user scheduling algorithm for minimizing the energy cost of data transmission in the context of OFDMA collaborative mobile cloud (CMC) with simultaneous wireless information and power transfer (SWIPT) receivers. The CMC, which consists of several collaborating MTs offers one potential solution for downlink content distribution and for the energy consumption reduction at the terminal side. Meanwhile, as RF signal can carry both information and energy simultaneously, the induced SWIPT has gained much attention for energy efficiency design of mobile nodes. Previous work on the design of CMC system mainly focused on the cloud formulation or en…
A Clustering Approach for Improving Network Performance in Heterogeneous Systems
2000
A lot of research has focused on solving the problem of computation-aware task scheduling on heterogeneous systems. In this paper, we propose a clustering algorithm that, given a network topology, provides a network partition adapted to the communication requirements of the applications running on the machine. Also, we propose a criterion to measure the quality of each one of the possible mappings of processes to processors based on that network partition. Evaluation results show that these proposals can greatly improve network performance, providing a basis of a communication-aware scheduling technique.
NoC Reconfiguration for CMP Virtualization
2011
At NoC level, the traffic interferences can be drastically reduced by using virtualization mechanisms. An effective strategy to virtualize a NoC consists in dividing the network in different partitions, each one serving different applications and traffic flows. In this paper, we propose a NoC reconfiguration mechanism to support NoC virtualization under real scenarios. Dynamic reassignment of network resources to different partitions is allowed in order to NoC dynamically adapts to application needs. Evaluation results show a good behavior of CMP virtualization.
C<sup>2</sup>SMA/CA: Enabling co-channel concurrency in WLANs using positional information
2013
An attractive approach to overcome capacity limitations in a densely deployed WLAN environment is to enable transmission concurrency. In this paper, we propose a co-channel concurrent transmission scheme, referred to as C2SMA/CA, which determines whether to allow multiple concurrent transmissions based on interference estimation using positional information. A distributed multi-link concurrency scheduling algorithm is implemented, and its performance is evaluated through extensive simulations.
Evaluation of SLA-based decision strategies for VM scheduling in cloud data centers
2016
Service level agreements (SLAs) gain more and more importance in the area of cloud computing. An SLA is a contract between a customer and a cloud service provider (CSP) in which the CSP guarantees functional and non-functional quality of service parameters for cloud services. Since CSPs have to pay for the hardware used as well as penalties for violating SLAs, they are eager to fulfill these agreements while at the same time optimizing the utilization of their resources.In this paper we examine SLA-aware VM scheduling strategies for cloud data centers. The service level objectives considered are resource usage and availability. The sample resources are CPU and RAM. They can be overprovision…
Optimal and Greedy Heuristic Approaches for Scheduling and Mapping of Hardware Tasks to Reconfigurable Computing Devices
2020
Executing real-time tasks on dynamically reconfigurable FPGAs requires us to solve the challenges of scheduling and placement. In the past, many approaches have been presented to address these challenges. Still, most of them rely on idealized assumptions about the reconfigurability of FPGAs and the capabilities of commercial tool flows. In our work, we aim at solving these problems leveraging a practically useful 2D slot-based FPGA area model. We present optimal approaches for reconfigurable slot creation, hardware task assignment, and placement creation. We quantitatively compare optimal and heuristics algorithms through simulation experiments and show that the heuristics are rather close …
A Generic Approach to Scheduling and Checkpointing Workflows
2018
This work deals with scheduling and checkpointing strategies to execute scientific workflows on failure-prone large-scale platforms. To the best of our knowledge, this work is the first to target fail-stop errors for arbitrary workflows. Most previous work addresses soft errors, which corrupt the task being executed by a processor but do not cause the entire memory of that processor to be lost, contrarily to fail-stop errors. We revisit classical mapping heuristics such as HEFT and MinMin and complement them with several checkpointing strategies. The objective is to derive an efficient trade-off between checkpointing every task (CkptAll), which is an overkill when failures are rare events, …
Optimal switches in multi-inventory systems
2007
Given a switched multi-inventory system we wish to find the optimal schedule of the resets to maintain the system in a safe operating interval, while minimizing a function related to the cost of the resets. We discuss a family of instances that can be solved in polynomial time by linear programming. We do this by introducing a set-covering formulation with a totally unimodular constraint matrix.