This paper reports on the development and evaluation of scheduling algorithms that allow an adequate distribution of applications in opportunistic computational grid elements. This grid can group computing resources o...
详细信息
The efficiency of scheduling algorithms is essential in order to attain optimal performances from parallel programming systems. In this paper we use a portable parallel programming environment we have implemented, the...
详细信息
Advances in networks and the availability of low-cost PCs and workstations has resulted in PC/workstation clusters being used as a computer environment that replaces parallel computers. These clusters recently compris...
详细信息
ISBN:
(纸本)0769507719
Advances in networks and the availability of low-cost PCs and workstations has resulted in PC/workstation clusters being used as a computer environment that replaces parallel computers. These clusters recently comprise different kinds of nodes and are connected over different kinds of networks, such as Ethernet and Myrinet. They are called distributed heterogeneous systems, and efficient collective communication operations for them have been studied. In this paper we propose heuristic scheduling algorithms for efficient gather operations in distributed heterogeneous systems, and cue present the results of simulations evaluating their performance. These results show that gather operations scheduled by these algorithms are more efficient than sequential gather operations in these systems. They also show that, the efficiency of gather operations scheduled by the algorithms depends on the ratio of the cost that depends on message size in point-to-point communication to the cost that does not depend on message size in point-to-point communication.
In this article we consider a set of scheduling problems for wireless data systems, including the single-carrier model motivated by CDMA technologies and the multi-carrier model motivated by OFDM technologies. We surv...
详细信息
ISBN:
(纸本)9781605600864
In this article we consider a set of scheduling problems for wireless data systems, including the single-carrier model motivated by CDMA technologies and the multi-carrier model motivated by OFDM technologies. We survey a number of single-carrier scheduling algorithms together with the assumptions on traffic patterns and channel conditions under which the algorithms perform well. We also present recent work that adapts some of the single-carrier algorithms to the multi-carrier environment. The challenge in adapting these algorithms partially lies in the NP-hard nature of handling resource wastage, which happens when multiple carriers collectively overallocate resources to the same useR. We present solutions based on the greedy approach for maximizing submodular functions over a matroid, We conclude with several open issues in multi-carrier scheduling.
Over the last few years, the usefulness and maturity of artificial intelligence technologies, and in particular of knowledge-based systems, have been demonstrated by the ever growing number of commercial applications ...
详细信息
For cellular wireless networks carrying real-time traffic, it is in the interest of both network operators and customers that throughput guarantees can be offered. In this paper, we formulate an optimization problem w...
详细信息
We consider the stability region of a mmWave integrated access and backhaul (IAB) network with stochastic arrivals and time-varying link rates. In the scheduling of links, we consider a limit on the number of RF chain...
详细信息
We consider the stability region of a mmWave integrated access and backhaul (IAB) network with stochastic arrivals and time-varying link rates. In the scheduling of links, we consider a limit on the number of RF chains, and the half-duplex constraint which occurs due to the wireless backhaul links. We characterize the stability region, and propose a back-pressure policy for the IAB network under the RF chains and half-duplex constraints. To implement the back-pressure policy, it is required to compute the maximum weighted schedule, which is a complex problem in general. For the IAB network, we present a distributed message passing scheme to compute the maximum weighted schedule, with almost linear complexity. We also investigate a class of local scheduling policies for the IAB network, which have a smaller stability region in general, but require no message passing. We characterize the stability region for the local class, and show that it is same as the global stability region, if the link rates are un-varying. We provide a bound on the gap between local and global regions when the links are time varying. We propose a local max-weight algorithm which achieves the stability region for the local class, and we present numerical results.
In this paper, we have considered the distributed scheduling problem for channel access in TDMA wireless mesh networks. The problem is to assign time-slot(s) for nodes to access the channels, and it is guaranteed that...
详细信息
In this paper, we have considered the distributed scheduling problem for channel access in TDMA wireless mesh networks. The problem is to assign time-slot(s) for nodes to access the channels, and it is guaranteed that nodes can communicate with all their one-hop neighbors in the assigned time-slot(s). And, the objective is to minimize the cycle length, i.e., the total number of different time-slots in one scheduling cycle. In single-channel ad hoc networks, the best known result for this problem is proved to be K-2 in arbitrary graphs (Chlamtac and Pinter in IEEE Trans. Comput. C-36(6):729-737, 1987) and 25K in unit disk graphs (http://***/en/ds/***) with K as the maximum node degree. There are multiple channels in wireless mesh networks, and different nodes can use different control channels to reduce congestion on the control channels. In this paper, we have considered two scheduling models for wireless mesh networks. The first model is that each node has two radios, and the scheduling is simultaneously done on the two radios. We have proved that the upper bound of the cycle length in arbitrary graphs can be 2K. The second model is that the time-slots are scheduled for the nodes regardless of the number of radios on them. In this case, we have proved that the upper bound can be (4K-2). We also have proposed greedy algorithms with different criterion. The basic idea of these algorithms is to organize the conflicting nodes by special criterion, such as node identification, node degree, the number of conflicting neighbors, etc. And, a node cannot be assigned to a time-slot(s) until all neighbor nodes, which have higher criterion and might conflict with the current node, are assigned time-slot(s) already. All these algorithms are fully distributed and easy to realize. Simulations are also done to verify the performance of these algorithms.
As an environment-friendly substitute for conventional fuel-powered vehicles, EVs and their components have been widely developed and deployed worldwide. The large-scale integration of EVs into power grid brings both ...
详细信息
As an environment-friendly substitute for conventional fuel-powered vehicles, EVs and their components have been widely developed and deployed worldwide. The large-scale integration of EVs into power grid brings both challenges and opportunities to the system performance. On one hand, the load demand from EV charging imposes a heavey impact on the stability and efficiency of power grid. On the other hand, EVs could potentially act as mobile energy storage systems to improve the power network performance, such as load flattening, fast frequency control, and facilitating renewable energy integration. Evidently, uncontrolled EV charging could lead to inefficient power network operation or even security issues. This has spurred on enormous research interest in designing charging coordination mechanisms. A key design challenge here lies in the lack of complete knowledge of events that occur in the future. Indeed, the amount of knowledge of future events significantly impacts the design of efficient charging control algorithms. This article focuses on introducing online EV charging scheduling techniques that deal with different degrees of uncertainty and randomness of future knowledge. In addition, we highlight the promising future research directions for EV charging control.
Recent trends in big data have shown that the amount of data continues to increase at an exponential rate. This trend has inspired many researchers over the past few years to explore new research direction of studies ...
详细信息
Recent trends in big data have shown that the amount of data continues to increase at an exponential rate. This trend has inspired many researchers over the past few years to explore new research direction of studies related to multiple areas of big data. The widespread popularity of big data processing platforms using MapReduce framework is the growing demand to further optimize their performance for various purposes. In particular, enhancing resources and jobs scheduling are becoming critical since they fundamentally determine whether the applications can achieve the performance goals in different use cases. scheduling plays an important role in big data, mainly in reducing the execution time and cost of processing. This paper aims to survey the research undertaken in the field of scheduling in big data platforms. Moreover, this paper analyzed scheduling in MapReduce on two aspects: taxonomy and performance evaluation. The research progress in MapReduce scheduling algorithms is also discussed. The limitations of existing MapReduce scheduling algorithms and exploit future research opportunities are pointed out in the paper for easy identification by researchers. Our study can serve as the benchmark to expert researchers for proposing a novel MapReduce scheduling algorithm. However, for novice researchers, the study can be used as a starting point.
暂无评论