Through the advancement of the Internet of Things (IoT), the development of devices for task automation, data extraction, and communication between devices has become increasingly easy. But as a result, tens of zettab...
详细信息
Full-dimension multiple-input multiple-output (FD-MIMO) systems, in which base stations are equipped with a large number of antennas in a two-dimensional panel, has received considerable attention from academia resear...
详细信息
This work presents a comparative analysis of fog and edge computing scheduling algorithms, focusing on their impact on IoT workload optimization. The analysis considers task allocation, load balancing, energy efficien...
详细信息
This work investigates which algorithm of scheduling algorithm will provide the best QoS for which type of application in addition to how stationary nodes and mobile nodes affect the network in terms of mobility and t...
详细信息
This work investigates which algorithm of scheduling algorithm will provide the best QoS for which type of application in addition to how stationary nodes and mobile nodes affect the network in terms of mobility and time. We used variable scheduling algorithms Weighted Fair Queuing (WFQ), Priority Queuing (PQ),First In First Out (FIFO) for different applications including real-time and non-real-time, in the context of mobility and stationery to investigate which algorithm of scheduling will provide the best quality of service with presenting a HetNet based LTE-A architecture including macrocell, picocells and femtocells.
This paper proposes a scheduling approach for mobile uplink WiMAX system that provides a trade-off between delay requirement satisfaction and throughput maximization. The paper starts by introducing three scheduling a...
详细信息
This paper proposes a scheduling approach for mobile uplink WiMAX system that provides a trade-off between delay requirement satisfaction and throughput maximization. The paper starts by introducing three scheduling algorithms each with a different objective. The first aim is to maximize the throughput of the system, while maintaining the user fairness. The second aim is to satisfy the delay requirements and the third focuses mainly on user fairness while maintaining an acceptable delay. These three uplink scheduling algorithms are based on an Alternative Factor parameter that selects the best channel of each user for the system throughput maximization while providing the fairness among users. The trade-off proposed in this paper is achieved using Alternative Factor with Mix of SNR and Queue Aware (AFMSQA) scheduling algorithm. AFMSQA combines the features of these three algorithms. The paper uses NS2 to analyze the three algorithms and to compare them to the new proposed AFMSQA approach. The results show that AFMSQA provides the transaction between high throughput performance and good delay results.
Shingled recording has recently emerged as one promising candidate to sustain the historical growth of magnetic recording storage areal density. However, since the convenient update-in-place feature is no longer avail...
详细信息
Shingled recording has recently emerged as one promising candidate to sustain the historical growth of magnetic recording storage areal density. However, since the convenient update-in-place feature is no longer available in shingled recording, many sectors must be read and written back in order to update one sector. This leads to a significant update-induced latency overhead and makes conventional hard disk drive scheduling algorithms perform poorly. This paper concerns with the development of appropriate scheduling algorithms for shingled recording based hard disk drives. We first present a simple partial-update scheduling algorithm that can naturally embrace the update latency issue and achieves significant gains over conventional scheduling algorithms. We enhance this algorithm by incorporating a shortest update first policy, which can further reduce the update response time on an average by 70%. Finally, motivated by abundant workload spatial and temporal locality, we develop a spatio-temporal band coalescing scheme that can achieve an additional reduction of update response time of up to 96.8%.
The scheduling algorithm used in a network switch significantly impacts the switch's performance and thereby the performance of the entire network. To keep up with the ongoing demands for higher network performanc...
详细信息
ISBN:
(纸本)9781728102153
The scheduling algorithm used in a network switch significantly impacts the switch's performance and thereby the performance of the entire network. To keep up with the ongoing demands for higher network performance, a myriad of scheduling algorithms have been investigated. We propose that FPGAs can be outstanding candidates for benchmarking scheduling algorithms, and that it can be beneficial to have customized scheduling algorithms which are enabled by FPGA based switches due to their reconfigurable architectures. This paper presents the first FPGA targeted survey on high performance scheduling algorithms used in the most popular switch architecture, input-buffered crossbars, with the aim of guiding future research on high performance network switching.
The Elastic Mixed-Criticality (E-MC) task model and an Early-Release EDF (ER-EDF) scheduling algorithm have been studied to address the service interruption problem for low-criticality tasks in uniprocessor systems. I...
详细信息
The Elastic Mixed-Criticality (E-MC) task model and an Early-Release EDF (ER-EDF) scheduling algorithm have been studied to address the service interruption problem for low-criticality tasks in uniprocessor systems. In this paper, focusing on multicore systems, we first investigate the schedulability of E-MC tasks under partitioned-EDF (P-EDF) by considering various task-to-core mapping heuristics. Then, with and without task migrations being considered, we study both global and local early-release schemes. Compared to the state-of-the-art Global EDF-VD scheduler, the superior performance of the proposed schemes in terms of improving the service levels of low-criticality tasks is confirmed through extensive simulations.
In the paper we consider tree-based L-level convergecast networks, in which leaf nodes correspond to data sources (DS), a root node - to a base station (BS), and other nodes - to intermediate repeaters (IR). At a star...
详细信息
In the paper we consider tree-based L-level convergecast networks, in which leaf nodes correspond to data sources (DS), a root node - to a base station (BS), and other nodes - to intermediate repeaters (IR). At a startup phase each DS generates a random number of messages for transmission to a BS. For such a model a lower bound for an average duration of collision-free convergecast is given. Also we propose a collision-free messages transmission scheduling algorithms for which the lower bound is achieved at L → ∞.
Recently, a novel class of high-performance multi-round MU-MIMO schemes were developed in [1] for the practically attractive scenario in which the transmitter has available partial channel state information (CSI) rega...
详细信息
ISBN:
(纸本)9781467363365
Recently, a novel class of high-performance multi-round MU-MIMO schemes were developed in [1] for the practically attractive scenario in which the transmitter has available partial channel state information (CSI) regarding the current state of the channel, but also full delayed CSI. We study methods for combining user scheduling with these multi-round transmission schemes, in order to realize some of their multiplexing gains in the form of high-rates in the SNR regime of practical interest. In these multi-round schemes several differently encoded signals are transmitted to each user over many time-dispersed slots. The challenge in designing schedulers is that certain signals intended for a given user are transmitted in different forms and combinations with other-user signals over multiple slots, occurring at distinctly different times with distinctly different channels. We develop a simple and novel scheduling framework based on appropriate resource division between transmission rounds and round-specific scheduling criteria. Simulation-based performance analysis of the proposed scheduling algorithms, operated on the 2-user transmission scheme in [1] and a 3-user extension suggest that these schemes can harvest significant scheduling benefits in some scenarios.
暂无评论