Hybrid architectures with electronic buffering/processing and optical switching fabric are receiving a lot of attention as potential candidates for the design of scalable high-performance switches/routers. However, th...
详细信息
ISBN:
(纸本)0780377109
Hybrid architectures with electronic buffering/processing and optical switching fabric are receiving a lot of attention as potential candidates for the design of scalable high-performance switches/routers. However, the reconfiguration overhead of optical fabrics introduces new challenges for the traffic scheduling across these switches. Existing algorithms proposed for this architecture can be classified as either batch-scheduling or single-scheduling. This paper is the first which analyzes and compares the performance of these two scheduling classes. The comparison is based on speedup requirement, average and worst-case delay and algorithm efficiency. Moreover, analytical models for the stability and average delay of single-scheduling algorithms are introduced in this paper. We will demonstrate that these results are helpful in determining the right type of algorithm and choosing the appropriate algorithm parameters for a given switch system.
With dramatically increasing demand for data usage in the LTE Heterogeneous Networks (HetNets), traffic offloading techniques have been used to balance the load among the network tiers in order to enhance the overall ...
详细信息
ISBN:
(纸本)9781728107295
With dramatically increasing demand for data usage in the LTE Heterogeneous Networks (HetNets), traffic offloading techniques have been used to balance the load among the network tiers in order to enhance the overall system performance. The Cell Range Expansion (CRE) and Almost Blank Subframe (ABS) are the two major techniques under the enhanced Inter-Cell Interference Coordination (eICIC), which are aimed at increasing overall system performance while keeping low interference toward cell edge users. In general, a scheduling algorithm is also one major issue affecting the system efficiency. In this paper, different scheduling schemes, i.e. Round Robin (RR), Proportional Fairness (PF), Best-Channel Quality Identification (Best-CQI), Maximum Throughput (Max-TP) and Resource Fairness (RF), are investigated. The study focuses on the comparison of the system performance when operating with different schedulers as well as under different CRE and ABS parameters. The results are observed through the system level simulation in terms of average throughput, peak throughput, edge throughput, and fairness.
Cloud computing is a technology that uses web and the clients can access the information by means of web programs. Rather than storing data on the desktop, it is stored on the cloud. Cloud as the name alludes is an ab...
详细信息
ISBN:
(纸本)9789811027505;9789811027499
Cloud computing is a technology that uses web and the clients can access the information by means of web programs. Rather than storing data on the desktop, it is stored on the cloud. Cloud as the name alludes is an abstraction of some complex infrastructure. scheduling of tasks with minimum usage of resources and achieving maximum profit is an important concern in cloud computing. Load balancing is an important mechanism taken into account to handle the load on various dependent nodes in distributed environment. Due to large number of tasks in distributed environment, workflows are used for scheduling the tasks. In this paper, Scientific workflows are used to carry out the simulation on task scheduling algorithms with cloud resources. This review paper compares various scheduling algorithms on the basis of parameters like execution time and total cost that includes communication cost for input and output the data and computation cost. From simulation results, it is concluded that all algorithms shows different results depending upon the specific workflow due to varying size of their tasks.
In cloud computing, resources are provided as a public utility and the user can lease and release those resources via the Internet by an on-demand fashion. Since cloud resources are meant to be utilized properly, the ...
详细信息
ISBN:
(纸本)9781538681251
In cloud computing, resources are provided as a public utility and the user can lease and release those resources via the Internet by an on-demand fashion. Since cloud resources are meant to be utilized properly, the role of scheduling algorithms is vital to ensure an appropriate resource is available to every request. In this paper, major cloud computing scheduling algorithms are reviewed, and discussion is made accordingly. This paper also compares cloud computing scheduling from the perspective of makespan, load balancing, CPU utilization, deadline, response time, and allocation cost. In addition, the paper proposes an abstract model to integrate desirable features the of algorithm suitable to cloud environment. Future research opportunities are highlighted and the end of the paper.
In this paper we suggest a strategy to design job scheduling systems. To this end, we first split a scheduling system into three components: scheduling policy, objective function and scheduling algorithm. After discus...
详细信息
ISBN:
(纸本)3540666761
In this paper we suggest a strategy to design job scheduling systems. To this end, we first split a scheduling system into three components: scheduling policy, objective function and scheduling algorithm. After discussing the relationship between those components we explain our strategy with the help of a simple example. The main focus of this example is the selection and the evaluation of several scheduling algorithms.
Industrial Internet-of-Things, automation, and process control applications require communication networks with a high degree of reliability, low energy expenditure, and low latency. Convergecast communication wherein...
详细信息
ISBN:
(纸本)9781728191270
Industrial Internet-of-Things, automation, and process control applications require communication networks with a high degree of reliability, low energy expenditure, and low latency. Convergecast communication wherein all nodes in the network transmit data to a common base station is a common paradigm for such applications. Time slotted networks which support deterministic scheduling, such as 802.15.4e Time Slotted Channel Hopping (TSCH) multiple access (MAC) protocol, are well suited for such applications. In this paper, we consider a joint relay selection and scheduling problem for convergecast on a multihop wireless network using single channel TSCH MAC protocol. The objective of the problem is to reduce both the number of relay nodes required for network connectivity as well as the slot-frame duration for a periodic deterministic convergecast schedule. For tree networks with half-duplex constraints we obtain a lower bound on the minimum slot-frame duration and show that the relay selection and scheduling problem can be decoupled. We propose a heuristic scheduling algorithm which is shown to achieve the above lower bound using simulations. For the NP-hard relay selection problem, we propose a polynomial time relay selection algorithm with an improved approximation ratio. The performance of our relay selection and scheduling algorithms are studied via simulations on randomly generated graphs.
Air travel has increased dramatically and the construction of new airports and runways has not kept pace with the increase in air traffic. The development and the implementation of effective optimization methods for a...
详细信息
ISBN:
(纸本)9780735412873
Air travel has increased dramatically and the construction of new airports and runways has not kept pace with the increase in air traffic. The development and the implementation of effective optimization methods for air traffic control requires great attention to scheduling problems. In fact, air traffic controllers can be seen as real-time systems. In this paper the problem of flights scheduling (landings and takeoffs) is addressed. Timeline scheduling, First Come First Served and Earliest Deadline First algorithms have been compared in order to assess which of the three obtain better performance in the context of optimizing the flights scheduling.
This paper studies the performance of a large class of scheduling algorithms, and investigates the interaction between the application and the network to improve performance under congestion. The following key ideas a...
详细信息
ISBN:
(纸本)0818685387
This paper studies the performance of a large class of scheduling algorithms, and investigates the interaction between the application and the network to improve performance under congestion. The following key ideas are presented in this paper: (a) we show the performance and scalability trade-offs between providing separation and multiplexing among flows;(b) we show that a bounded buffer FIFO scheduler performs approximately as well as a WRR scheduler with per-flow queues in most practical situations, but requires significantly less overhead ill terms of per-flow stare;and (c) we show how link layer schedulers can use application-level hints in order to increase the perceived goodness of connections at higher layers.
In this paper impact of resource scheduling algorithms on the average user throughput, average cell's capacity and the quality of provided services in the microcellular 4G environment has been analyzed. Well known...
详细信息
ISBN:
(纸本)9789536114979
In this paper impact of resource scheduling algorithms on the average user throughput, average cell's capacity and the quality of provided services in the microcellular 4G environment has been analyzed. Well known scheduling algorithms such as Round Robin, MaxSNR and Fair Rate have been compared with the algorithms proposed for fading channels in [1]. A simple modification of the scheduling has been proposed for all examined algorithms and its impact on the users and system performance has been analyzed. Presented results have been obtained for both uplink and downlink OFDMA transmission in the MIMO channels.
This paper applies the technique of systematic (or structured) programming for programming scheduling algorithms as encountered in operating system design. Monitors are used for structuring scheduling algorithms and a...
详细信息
暂无评论