检索结果-内蒙古大学图书馆

FTLLS: A fault tolerant, low latency, distributed scheduling approach based on sparrow

PEER-TO-PEER NETWORKING AND APPLICATIONS 2018年第5期11卷 1129-1140页

作者： Li, Wenzhuo Lin, Chuang Tsinghua Univ Tsinghua Natl Lab Informat Sci & Technol 30 Shuangqing Rd Beijing Peoples R China Tsinghua Univ Dept Comp Sci & Technol 30 Shuangqing Rd Beijing Peoples R China

Big data processing systems are developing towards larger degrees of parallelism and shorter task durations in order to achieve lower response time. scheduling highly parallel tasks that complete in sub-seconds poses a great challenge to traditional centralized schedulers. Taking the challenge, researchers turn to distributed scheduling approaches to avoid the throughput limitation of centralized schedulers, among which Sparrow is a leading design. However, little effort is devoted to the fault tolerance of Sparrow and there are problems with Sparrow's sample-based techniques, which gives rise to incomplete jobs and large scheduling latency. We then present Fault Tolerant, Low Latency Sparrow (FTLLS). It extends Sparrow with an assistant machine to handle worker failures and to make better scheduling decisions. Through simulations, it is proved that FTLLS can detect worker failures more quickly than a naive timeout approach and make better scheduling decisions than native Sparrow. Through implementation, the results show that FTLLS guarantees no incomplete jobs at the presence of worker failures and reduces scheduling latencies by over 1.5 x when compared to native Sparrow. In addition, the simplicity of the idea adopted by FTLLS makes it applicable to a wide variety of distributed scheduling approaches.

关键词： Fault tolerance Low latency distributed scheduling Sparrow Big data

来源：评论

学校读者我要写书评

暂无评论

A hybrid Tabu sample-sort simulated annealing approach for solving distributed scheduling problem

引用

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 2013年第9期51卷 2602-2619页

作者： Chan, Felix T. S. Prakash, Anuj Ma, H. L. Wong, C. S. Hong Kong Polytech Univ Dept Ind & Syst Engn Hong Kong Hong Kong Peoples R China

The distributed scheduling problem has been considered as the allocation of a task to various machines in such a way that these machines are situated in different factories and these factories are geographically distributed. Therefore distributed scheduling has fulfilled various objectives, such as allocation of task to the factories and machines in such a manner that it can utilise the maximum resources. The objective of this paper is to minimise the makespan in each factory by considering the transportation time between the factories. In this paper, to address such a problem of scheduling in distributed manufacturing environment, a novel algorithm has been developed. The proposed algorithm gleans the ideas both from Tabu search and sample sort simulated annealing. A new algorithm known as hybrid Tabu sample-sort simulated annealing (HTSSA) has been developed and it has been tested on the numerical example. To reveal the supremacy of the proposed algorithm over simple SSA and Tabu search, more computational experiments have also been performed on 10 randomly generated datasets.

关键词： Tabu-search sample sort simulated annealing (SSA) distributed scheduling makespan

来源：评论

学校读者我要写书评

暂无评论

distributed scheduling OF ELECTRIC VEHICLES IN A RESIDENTIAL AREA

DISTRIBUTED SCHEDULING OF ELECTRIC VEHICLES IN A RESIDENTIAL...

引用

作者： TUMISANG KEDUETSWE NGUVAUVA THAMMASAT UNIVERSITY

学位级别：硕士

Smart grid technology provides a platform for management of electricity consumption and provision. The management of electricity consumption known as Demand Side Manage- ment (DSM) has received a lot of interests from researchers. As the penetration of Electric Vehicles (EVs) increase in the coming future, this becomes a challenge for the electric grid as uncoordinated charging of EVs may cause power outages or even damage the distribution transformers due to overloading of distribution transformers. Therefore, this provides an op- portunity for better strategies for management of charging of EVs in order to prevent outages to the electric grid, which can come with a greater risk and expense to energy providers. In this thesis, we perform a simulation study of the distributed scheduling algorithm, pro- posed by Chen et al, 2014, in order to coordinate charging of EVs in a residential area. We call the algorithm, Aggregate Power Sharing (APS). We are interested in APS since it pro- vides a distributed EV charging scheduling, requiring minimal message exchanges between a distribution transformer and Energy Management Controller (EMC) in each household and among the EMCs themselves. APS allows EMCs to not violate a pre-specified target aggregate consumption profile. To study APS, we compare it with a well-known Water-Filling scheduling algorithm and without scheduling. To be realistic, we consider a real typical load profile from an area in Pattaya, Thailand. This area is a pilot smart grid project, planned by the Provincial Electricity Authority (PEA). Our simulation results show that APS provides better fairness than water-filling because each EV is essentially charged at the same rate regardless of their independent state of charge of the EV batteries. In addition to the study of APS proposed in Chen et al, 2014, we make an improvement to APS by revising the probabilistic strategy to get closer to the target aggregate profile. This is validated by simulation.

关键词： Load Control demand response electric vehicle distributed scheduling demand side management

来源：评论

学校读者我要写书评

暂无评论

The Ergodic Capacity of the Multiple Access Channel Under distributed scheduling - Order Optimality of Linear Receivers

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2018年第8期64卷 5898-5919页

作者： Kampeas, Joseph Cohen, Asaf Gurewitz, Omer Ben Gurion Univ Negev Dept Commun Syst Engn IL-84105 Beer Sheva Israel

Consider the problem of a multiple-input multiple-output multiple-access channel at the limit of large number of users. Clearly, in practical scenarios, only a small subset of the users can be scheduled to utilize the channel simultaneously. Thus, a problem of user selection arises. However, since solutions which collect channel state information from all users and decide on the best subset to transmit in each slot do not scale when the number of users is large, distributed algorithms for user selection are advantageous. In this paper, we analyze a distributed user selection algorithm, which selects a group of users to transmit without coordinating between users and without all users sending CSI to the base station. This threshold-based algorithm is analyzed for both zero-forcing and minimum mean square error receivers, and its expected sum rate in the limit of large number of users is investigated. It is shown that for large number of users, it achieves the same scaling laws as the optimal centralized scheme.

关键词： Ergodic capacity distributed scheduling multi-access channel zero-forcing and MMSE detection

来源：评论

学校读者我要写书评

暂无评论

Optimal distributed scheduling in Wireless Networks Under the SINR Interference Model

引用

IEEE-ACM TRANSACTIONS ON NETWORKING 2016年第4期24卷 2033-2045页

作者： Chaporkar, Prasanna Magureanu, Stefan Proutiere, Alexandre Indian Inst Technol Dept Elect Engn Bombay 400076 Maharashtra India Royal Inst Technol Dept Elect Engn KTH S-10044 Stockholm Sweden

In wireless networks, the design of radio resource sharing mechanisms is complicated by the complex interference constraints among the various links. In their seminal paper (IEEE Trans. Autom. Control, vol. 37, no. 12, pp. 1936-1948), Tassiulas and Ephremides introduced Maximum Weighted scheduling, a centralized resource sharing algorithm, and proved its optimality. Since then, there have been extensive research efforts to devise distributed implementations of this algorithm. Recently, distributed adaptive CSMA scheduling schemes have been proposed and shown to be optimal, without the need of message passing among transmitters. However, their analysis relies on the assumption that interference can be accurately modeled by a simple interference graph. In this paper, we consider the more realistic and challenging signal-to-interference-plus-noise ratio (SINR) interference model. We present distributed scheduling algorithms that: 1) are optimal under the SINR interference model;and 2) do not require any message passing. These algorithms are based on a combination of a simple and efficient power allocation strategy referred to as Power Packing and randomization techniques. The optimality of our algorithms is illustrated in various traffic scenarios using numerical experiments.

关键词： Power control distributed scheduling throughput optimality SINR interference model

来源：评论

学校读者我要写书评

暂无评论

Leveraging Physical-Layer Capabilites: distributed scheduling in Interference Networks With Local Views

引用

IEEE-ACM TRANSACTIONS ON NETWORKING 2016年第1期24卷 368-382页

作者： Santacruz, Pedro E. Aggarwal, Vaneet Sabharwal, Ashutosh Rice Univ Dept Elect & Comp Engn Houston TX 77005 USA Univ Texas Austin Dept Elect & Comp Engn Austin TX 78712 USA AT&T Labs Res Florham Pk NJ 07932 USA

In most wireless networks, nodes have only limited local information about the state of the network, which includes connectivity and channel state information. With limited local information about the network, each node's knowledge is mismatched;therefore, they must make distributed decisions. In this paper, we pose the following question: If every node has network state information only about a small neighborhood, how and when should nodes choose to transmit? While link scheduling answers the above question for point-to-point physical layers that are designed for an interference-avoidance paradigm, we look for answers in cases when interference can be embraced by advanced PHY-layer design, as suggested by results in network information theory. To make progress on this challenging problem, we propose a constructive distributed algorithm that achieves rates higher than link scheduling based on interference avoidance, especially if each node knows more than one hop of network state information. We compare our new aggressive algorithm to a conservative algorithm we have presented in a 2013 conference paper. Both algorithms schedule subnetworks such that each subnetwork can employ advanced interference-embracing coding schemes to achieve higher rates. Our innovation is in the identification, selection, and scheduling of subnetworks, especially when subnetworks are larger than a single link.

关键词： distributed scheduling graph coloring interference channel local view normalized sum-rate

来源：评论

学校读者我要写书评

暂无评论

A shuffled frog-leaping algorithm with memeplex quality for bi-objective distributed scheduling in hybrid flow shop

引用

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 2021年第18期59卷 5404-5421页

作者： Cai, Jingcao Lei, Deming Li, Ming Wuhan Univ Technol Sch Automat Wuhan Peoples R China

Hybrid flow shop scheduling problem has been extensively considered in single factory;however, distributed hybrid flow shop scheduling problem (DHFSP) is seldom investigated in multiple factories and should be studied fully with the applications of distributed manufacturing. In this study, DHFSP with sequence-dependent setup times is considered, in which factory assignment and machine assignment of first stage are integrated together. A new shuffled frog-leaping algorithm with memeplex quality (MQSFLA) is proposed to minimise total tardiness and makespan simultaneously. Solution quality of memeplex is measured and new search process is implemented according to solution quality. Evolution quality is evaluated for each memeplex and adopted for dynamically selecting memeplexes in a novel memeplex shuffling. A number of experiments are conducted to test the new strategies and performances of MQSFLA. The computational results demonstrate the effectiveness of the new strategies and the promising advantages of MQSFLA.

关键词： Hybrid flow shop distributed scheduling shuffled frog-leaping algorithm memeplex quality multi-objective optimisation

来源：评论

学校读者我要写书评

暂无评论

Unified Collision-Free 3889 Coordinated distributed scheduling (CF-CDS) in IEEE 802.16 Mesh Networks

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2008年第10期7卷 3889-3903页

作者： Zhu, Hua Tang, YatKwan Chlamtac, Imrich San Diego Res Ctr San Diego CA 92121 USA

IEEE 802.16 mesh networking has attracted significant commercial interests recently. In this paper, we propose a unified Collision-Free Coordinated distributed scheduling (CF-CDS) algorithm for both control and data transmissions in IEEE 802.16 Mesh mode. Compared to corresponding algorithms defined by the standard [1][3], CF-CDS has two major advantages: (i) CF-CDS truly achieves collision-free control scheduling while the standards CDS algorithm does not, although it claims to;(ii) in addition to periodic scheduling for the control subframe, CF-CDS can be applied to on-demand data scheduling in the data sub-frame, where it outperforms the CDS-based 3-way handshakes approach adopted by the standard. We provide performance comparison between standard algorithms and CF-CDS through extensive simulation.

关键词： IEEE 802.16 WiMax mesh network distributed scheduling TDMA

来源：评论

学校读者我要写书评

暂无评论

On the Achievable Degrees-of-Freedom by distributed scheduling in (N, K)-User Interference Channels

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2013年第6期61卷 2568-2579页

作者： Chae, Seong Ho Jung, Bang Chul Choi, Wan Korea Adv Inst Sci & Technol Dept Elect Engn Taejon 305701 South Korea Gyeongsang Natl Univ Dept Informat & Commun Engn Tongyeong 650160 South Korea Gyeongsang Natl Univ Inst Marine Ind Tongyeong 650160 South Korea

We investigate achievable degrees-of-freedom (DoF) of an (N, K)-user interference channel where only K user (transmitter-receiver) pairs among N user pairs are allowed to simultaneously communicate in a dense network (N >> K). Each node is assumed to have M antennas and to be randomly located. We propose a distributed scheduling protocol to achieve the maximum DoF (i.e., MK), which sequentially and opportunistically selects a user pair causing/receiving interference lower than a pre-determined threshold to/from already selected user pairs in each step. It is proven that the proposed protocol achieves the maximum DoF, MK, in the (N, K)-user interference channel with less stringent network size N, compared with the conventional centralized protocol which has been known as the best. With zero-forcing detector at receiver, we prove that it is sufficient that the network size N scales at least as. omega(SNR (M2K(K-1))) to achieve the maximum number of DoF MK, where SNR denotes the received signal-to-noise ratio. We also investigate the required feedback overheads of the proposed protocol and show that it is quite small when the network is strongly interference-limited because only a small number of users are required to transmit their signaling. Our numerical results show that our proposed scheme controls interference more effectively than the centralized protocol.

关键词： Interference channel wireless ad hoc network distributed scheduling multi-user diversity degrees-of-freedom

来源：评论

学校读者我要写书评

暂无评论

A modified genetic algorithm for distributed scheduling problems

引用

JOURNAL OF INTELLIGENT MANUFACTURING 2003年第3-4期14卷 351-362页

作者： Jian, HZ Nee, AYC Fuh, JYH Zhang, YF Natl Univ Singapore Dept Mech Engn Singapore 119260 Singapore

Genetic algorithms (GAs) have been widely applied to the scheduling and sequencing problems due to its applicability to different domains and the capability in obtaining near-optimal results. Many investigated GAs are mainly concentrated on the traditional single factory or single job-shop scheduling problems. However, with the increasing popularity of distributed, or globalized production, the previously used GAs are required to be further explored in order to deal with the newly emerged distributed scheduling problems. In this paper, a modified GA is presented, which is capable of solving traditional scheduling problems as well as distributed scheduling problems. Various scheduling objectives can be achieved including minimizing makespan, cost and weighted multiple criteria. The proposed algorithm has been evaluated with satisfactory results through several classical scheduling benchmarks. Furthermore, the capability of the modified GA was also tested for handling the distributed scheduling problems.

关键词： genetic algorithms distributed production distributed scheduling

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：