Hyperparameter optimization (HPO), the process of searching for optimal hyperparameter configurations for a model, is becoming increasingly important with the rise of automated machine learning. Using HPO can be incre...
详细信息
As the development of innovative automotive software continues to progress, the architecture and solutions required for automotive software become more complex. It is challenging to cope with these issues with a singl...
详细信息
Server less computing solutions within the cloud presentsan exceptional opportunity for corporations to gain progressed scalability, availability, and fee efficiency. To reap such blessings, establishments need to uti...
详细信息
This paper proposes a new scheduling scheme based on priority table design by integrating two or more characteristic parameters of a task. Two real-time scheduling algorithms from the scheme are presented: EDV (earlie...
详细信息
Every IT-enabled service is intended to be provided as a utility by cloud computing. It is dedicated to providing all needs related to compute, storage, development, etc., in an economical and effective manner, whethe...
详细信息
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 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.
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.
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 → ∞.
暂无评论