Cloud computing delivers a computing environment where different resources are delivered as a service to the customer or multiple tenants over the internet. Task scheduling is an essential and most important part in a...
详细信息
ISBN:
(纸本)9781467397452
Cloud computing delivers a computing environment where different resources are delivered as a service to the customer or multiple tenants over the internet. Task scheduling is an essential and most important part in a cloud computing environment. The task scheduling mainly focuses to enhance the efficient utilization of resources and hence reduction in task completion time. Task scheduling is used to allocate certain tasks to particular resources at a particular time instance. Many different techniques have been proposed to solve the problems of task scheduling. Task scheduling improves the efficient utilization of resource and yields less response time so that the execution of submitted tasks takes place within a possible minimum time. This paper discusses about the study of various scheduling algorithms in a cloud computing environment.
Various embedded systems are used in a smart city and the required functionalities of real-time operating systems (RTOS) are different depending on applications. Most RTOSs adopt just fixed priority scheduling. Some a...
详细信息
ISBN:
(纸本)9781509018932
Various embedded systems are used in a smart city and the required functionalities of real-time operating systems (RTOS) are different depending on applications. Most RTOSs adopt just fixed priority scheduling. Some applications, however, require dynamic scheduling algorithms. The paper presents a method to customize the scheduling algorithm and the resource access protocol of an OSEK OS using aspect-oriented programming (AOP). We define aspects to replace the fixed priority scheduling mechanism of the OSEK OS with an Earliest Deadline First (EDF) scheduling mechanism or a Rate Monotonic Critical Laxity (RMCL) scheduling mechanism. We also define aspects to customize the resource access protocol for EDF scheduling and RMCL scheduling. By using the aspects, we can customize the scheduling algorithm and the resource access protocol without modifying the original source code. This improves the maintainability of the RTOS family. The evaluation results show that the overhead of AOP is small enough.
Network navigation is a promising paradigm for providing accurate location-awareness in wireless environments, where mobile nodes estimate their locations based on inter-and intra-node measurements. In the presence of...
详细信息
ISBN:
(纸本)9781509013289
Network navigation is a promising paradigm for providing accurate location-awareness in wireless environments, where mobile nodes estimate their locations based on inter-and intra-node measurements. In the presence of limited wireless resources, only a subset rather than all of the node pairs can perform inter-node measurements. Therefore, it is crucial to design efficient scheduling algorithms for selecting node pairs at different times for inter-node measurements. This paper develops a framework for the design of scheduling algorithms based on random access for network navigation. The proposed algorithms are suitable for practical operation of wireless navigation networks due to their distributed nature, and the optimized access probabilities of the agents lead to significant performance improvement.
It is the need of an era to store and process big data and its applications. To process these applications, it is inevitable to use heterogeneous distributed computing systems (HeDCS). The heterogeneous distributed sy...
详细信息
ISBN:
(纸本)9789811046032;9789811046025
It is the need of an era to store and process big data and its applications. To process these applications, it is inevitable to use heterogeneous distributed computing systems (HeDCS). The heterogeneous distributed systems facilitate scalability, an essential characteristic for big data processing. However, to implement the scalable model, it is essential to handle performance, efficiency, optimal resource utilization and several other key constraints. scheduling algorithms play a vital role in achieving better performance and high throughput in heterogeneous distributed computing systems. Hence, selection of a proper scheduling algorithm, for the specific application, becomes a critical task. Selection of an appropriate scheduling algorithm in heterogeneous distributed computing systems require the consideration of various parameters like scheduling type, multi-core processors, and heterogeneity. The paper discusses broadly the hierarchical classification of scheduling algorithms implemented in heterogeneous distributed computing systems and presents a comparative study of these algorithms, thus providing an insight into the significance of various parameters that play a role in the selection of a scheduling algorithm.
This paper focuses on researching and visualizing the differences of the quality of network connections between several network applications using popular scheduling algorithms. The aim of this work is to examine and ...
详细信息
ISBN:
(纸本)9781510630666
This paper focuses on researching and visualizing the differences of the quality of network connections between several network applications using popular scheduling algorithms. The aim of this work is to examine and compare the impact of application of scheduling algorithms for FIFO, DWRR, WFQ, PQ packets in IPv4 and IPv6 networks on the quality of data transmission. Using Riverbed Modeler Academic Edition version 17.5 software there was developed 10 research scenarios with different scheduling algorithms and IP protocols implemented on routers. Scenarios based on IP protocols in the fourth and sixth versions with implemented FIFO, PQ, DWRR and WFQ scheduling algorithms has been developed. Each scenario includes the operation of real-time VoIP and video conferencing applications as well as HTTP, FTP and e-mail applications. The research showed that there are significant differences in the quality of packet transmission of the tested applications using different configurations of the scheduling algorithms and network protocols.
High-performance input queued switches achieve good performance with low cost. However, with the appearance of optical techniques, the line rate is much higher than before. scheduling algorithms require not only good ...
详细信息
ISBN:
(纸本)076951961X
High-performance input queued switches achieve good performance with low cost. However, with the appearance of optical techniques, the line rate is much higher than before. scheduling algorithms require not only good performance in delay and stability but fast speed and simple implementation as well. A variety of scheduling algorithms for Virtual Output Queuing (VOQ) packet switch architecture are proposed Round-robin scheduling algorithms are fast and simple to implement in hardware. In particular, a group of fully desynchronized round-robin scheduling algorithms- SRR (static round robin matching), proposed recently, achieve pretty good delay performance while easy to implement. However, they are not stable under non-uniform traffic. Randomized algorithms are stable under any admissible traffic, however their delay is high and hardware implementation is complex. Based on the concept of randomized algorithms and SRR, we propose a group of new scheduling algorithms, DRDSRR, the improved version of DRDSRR, ARDSRR and the variations of ARDSRR. They not only ensure stability but also have good performance and simple implementation. We have proved stability in the paper.
LoRa-based transmissions suffer from extensive collisions due to the ALOHA-style transmission policy. As a consequence, delivering a high number of packets in a short amount of time becomes an unfeasible task. To tack...
详细信息
ISBN:
(纸本)9781538649800
LoRa-based transmissions suffer from extensive collisions due to the ALOHA-style transmission policy. As a consequence, delivering a high number of packets in a short amount of time becomes an unfeasible task. To tackle this problem we propose to schedule node transmissions in slots of different size depending on the Spreading Factor (SF). Transmissions with the same SF are scheduled in different slots to avoid collisions while those with different SF can occur in parallel. In this paper, we propose two algorithms executed in an offline manner to allocate SFs to nodes aimed at minimising the total data collection time while respecting the radio duty cycle restriction. The examined simulation scenarios and our comparison with LoRaWAN show an up to 101% improvement in terms of data collection time and an up to 250% improvement in terms of energy consumption combined with a nearly 100% packet delivery ratio.
Currently, a new type of wireless sensor network (WSN) named as battery-free network (BF-WSN), has been proposed and widely studied. Compared with traditional battery-powered WSN (BP-WSN), nodes in BF-WSN can harvest ...
详细信息
ISBN:
(纸本)9781728146010
Currently, a new type of wireless sensor network (WSN) named as battery-free network (BF-WSN), has been proposed and widely studied. Compared with traditional battery-powered WSN (BP-WSN), nodes in BF-WSN can harvest energy from ambient environment, prolonging the lifetime of the network greatly. Multicast is an important way for data dissemination in WSNs. The problem of minimum latency multicast scheduling (MLMS) that seeks a fast schedule without collision for data multicast has been studied extensively in BP-WSNs. However, existing algorithms are not suitable in BF-WSNs. In this paper we study the MLMS problem in BF-WSNs (BF-MLMS). To reduce latency, we investigate how to compute the end-to-end transmission delay. By considering both energy supply and collision, we propose centralized and distributed algorithms for constructing collision-free multicast trees in BF-WSNs. To the best of our knowledge, this is the first work to consider the BF-MLMS problem. Simulation results verify our protocols have high performance in terms of multicast latency and message volume.
Hadoop is an open-source framework developed by Apache software foundation. It works on large datasets, as the data is been stored and processed across cluster in distributed environment. It consist of two components ...
详细信息
ISBN:
(纸本)9781509007745
Hadoop is an open-source framework developed by Apache software foundation. It works on large datasets, as the data is been stored and processed across cluster in distributed environment. It consist of two components - HDFS and MapReduce. HDFS is used for storing the data and MapReduce is used to process those stored datasets. In current era large amount of data is generated by many websites, the data generated is enormous which is simply stated as "big data". These datasets are then processed in Hadoop framework. As the processing is done parallely in Hadoop framework appropriate scheduling of the resources is required to process large datasets in-order to gain better performance. Mainly scheduling algorithms are used to minimize completion time of a parallel application. Among users the resource allocation will be guaranteed by schedulers. In this paper we study about the performance of various scheduling algorithms like fair, fifo, capacity of Hadoop platform.
Optical switching fabrics (OSF) are receiving increasing attention in the design of high speed packet switches, due to their excellent properties in terms of available bandwidth and reduced power consumption. However,...
详细信息
ISBN:
(纸本)0780395697
Optical switching fabrics (OSF) are receiving increasing attention in the design of high speed packet switches, due to their excellent properties in terms of available bandwidth and reduced power consumption. However, most optical devices suffer a reconfiguration latency each time input/output connections are modified;unfortunately, this latency may not be negligible with respect to the packet transmission time, and can adversely affect performance, especially delay and throughput. The multi-hop approach, i.e., sending packets to the final destination port exploiting transmission to intermediate ports, was shown to be a promising way to control the tradeoff between delay and throughput. In this paper, we examine the multi-hop approach when using a logical interconnections based on multidimensional regular topologies. We discuss not only the scheduling problem for these topologies, but also the design of routing and queueing schemes. Performance are analyzed by simulation.
暂无评论