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

28th ACM Symposium on Parallelism in algorithms and Architectures, SPAA 2016

作者： Im, Sungjin Kulkarni, Janardhan University of California Merced MercedCA95343 United States Microsoft Research RedmondWA98052 United States

ISBN: (纸本)9781450342100

scheduling jobs on multiple machines has numerous applications and has been a central topic of research in the scheduling literature. Recently, much progress has been made particularly in online scheduling with the development of powerful analysis tools. In this line of wok a centralized scheduler typically dispatches jobs to machines to exploit the given resources the best to achieve the best system performance which is measured by a certain global scheduling objective. While this approach has been very successful in attacking scheduling problems of growing complexity, the underlying assumption that jobs follow a centralized scheduler may not be realistic in certain scheduling settings. In this paper we initiate the study of online scheduling for selfish jobs in the presence of multiple machines. Selfish behavior of jobs is a common aspect observed in the absence of a centralized scheduler. We explore this question in the unrelated machines setting, arguably one of the most general multiple machine models. In this model each job can have a completely different processing time on each machine. Motivated by several practical scenarios, we assume that when a job arrives it chooses the machine that completes the job the earliest i.e. minimizes the flow time of the job. The goal is to design a local scheduling algorithm on each machine with the goal of minimizing the total (weighted) flow time. We show that the algorithm Smoothed Latest Arrival Processor Sharing, which was introduced in a recent work by Im et al. [27, 28], yields an O(1/ϵ2)-competitive schedule when given (1 + ϵ) speed. We also extend our result to minimize total flow-time plus energy consumed. To show this result we establish several interesting properties of the algorithm which could be of potential use for other scheduling problems. © 2016 ACM.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Automatic I/O scheduling algorithm selection for parallel file systems

Automatic I/O scheduling algorithm selection for parallel fi...

引用

作者： Boito, Francieli Zanon Kassick, Rodrigo Virote Navaux, Philippe O. A. Denneulin, Yves Porto Alegre Brazil LIG Laboratory INRIA University of Grenoble Grenoble France

This article presents our approach to provide input/output (I/O) scheduling with double adaptivity: to applications and devices. In high-performance computing environments, parallel file systems provide a shared storage infrastructure to applications. In the situation where multiple applications access this shared infrastructure concurrently, their performance can be impaired because of interference. Our work focuses on I/O scheduling as a tool to improve performance by alleviating interference effects. The role of the I/O scheduler is to decide the order in which applications' requests must be processed by the parallel file system's servers, applying optimizations to adjust the resulting access pattern for improved performance. Our approach to improve I/O scheduling results is based on using information from applications' access patterns and storage devices' sensitivity to access sequentiality. We have applied machine learning to provide the ability to automatically select the best scheduling algorithm for each situation. Our approach improves performance by up to 75% over an approach that uses the same scheduling algorithm to all situations, without adaptability. Our results evidence that both aspects - applications and storage devices - are essential to make good scheduling decisions. © 2015 John Wiley & Sons, Ltd.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Decentralized broadcast-based scheduling for dense multi-hop TSCH networks

Decentralized broadcast-based scheduling for dense multi-hop...

引用

2016 ACM Workshop on Mobility in the Evolving Internet Architecture, MobiArch 2016

作者： Municio, Esteban Latré, Steven University of Antwerp iMinds Antwerp Belgium

ISBN: (纸本)9781450342575

Wireless Sensor Networks (WSNs) are becoming more and more popular to support a wide range of Internet of Things (IoT) applications. Time-Slotted Channel Hopping (TSCH) is a technique to enable ultra reliable and ultra low-power wireless multi-hop networks. TSCH consist of a channel hopping scheme for sending link-layer frames in different time slots and frequencies in order to efficiently combat external interference and multi-path fading. The keystone of TSCH is the scheduling algorithm, which determines for every node at which opportunity (a combination of time slots and channels) it is allowed to send. However, current scheduling algorithms are not suited for dense deployments and have important scalability limitations. In this paper, we investigate TSCH's scheduling performance in dense deployments and show how the scheduling can be improved for such environments. We performed an extensive analysis of the scalability for different scheduling approaches showing the performance drops as the number of nodes increases. Moreover, we propose a novel Decentralized Broadcast-based scheduling algorithm called DeBraS, based on selective broadcasting to inform nodes about each other's schedule. Through extensive simulations, we show that DeBraS is highly more scalable than centralized solutions and that it outperforms the current decentralized 6Tisch algorithms in up to 88.5% in terms of throughput for large network sizes. © 2016 ACM.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Security-aware workflow scheduling with selective task duplication in clouds

Security-aware workflow scheduling with selective task dupli...

引用

24th High Performance Computing Symposium, HPC 2016, Part of the 2016 Spring Simulation Multi-Conference, SpringSim 2016

作者： Zhu, Xiaomin Jiao, Peng Zha, Yabing Chen, Huangke College of Information Systems and Management National University of Defense Technology Changsha Hunan410073 China

ISBN: (纸本)9781510824256

High quality of security service is increasingly critical for cloud workflow applications. Unfortunately, most existing scheduling strategies disregard security requirements for workflows and do not adequately exploit idle time resulting in long makespan. To address this issue, in this paper, we firstly make comprehensive analysis to minimize tasks' start time and generate useful time slots for task duplications to further reduce makespan. Based on the analysis, we devise a novel security-aware workflow scheduling algorithm SAWS including two important phases: 1) task scheduling with selectively duplicating tasks to idle time slots, and 2) intermediate data encrypting by effectively exploiting tasks' slack times. Simulation experiments injecting randomly generated workfows and some real-world workflow traces are conducted to validate the superiority of our SAWS by comparing it with some baselines. The experimental results show that SAWS outperforms others in terms of makespan (up to 21%), monetary costs (up to 40%) and resource utilization (up to 35%). © 2016 Society for Modeling & Simulation International (SCS).

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Bringing Distributed Energy Storage to Market

引用

IEEE TRANSACTIONS ON POWER SYSTEMS 2016年第1期31卷 173-186页

作者： Goebel, Christoph Jacobsen, Hans-Arno Tech Univ Munich Dept Comp Sci D-80290 Munich Germany Tech Univ Munich D-80290 Munich Germany

Spatially distributed energy storage devices can provide additional flexibility to system operators, which is needed to transition from primarily fossil fuel based electricity generation to variable renewable generation. Aggregators in charge of controlling distributed energy storage can take advantage of existing economic incentives for more flexibility. However, controlling large numbers of energy storage devices with individual constraints in accordance with the strict rules of existing energy and reserve markets is challenging. The purpose of this paper is to investigate the design and performance of a system that enables aggregators to bring large numbers of dedicated and fully controllable energy storage devices to multiple markets concurrently. In particular, we propose algorithms and heuristic optimization methods that allow aggregators to control such energy resources in accordance with arbitrary market rules and participation strategies. Our evaluation is based on a realistic dual market (reserve and intra-day energy) use case. We find that effective market-conform control of large numbers of energy storage devices using the proposed algorithms is feasible, even on short time scales. Furthermore, our results also indicate that the scalability of the proposed system design can be further improved via parallelization without limiting the reserve/energy brought to market.

关键词： Electricity markets energy management energy storage optimization methods scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Dispatching rule-based scheduling algorithm for a dynamic flexible flow shop with time-dependent process defect rate 46

Dispatching rule-based scheduling algorithm for a dynamic fl...

引用

46th International Conferences on Computers and Industrial Engineering, CIE 2016

作者： Joo, B.J. Chua, T.J. Cai, T.X. Singapore Singapore

This paper focuses on a dynamic scheduling problem in a multi-product three-stage flexible flow shop where new jobs continuously arrive over time. Each of the parallel machines in the second stage requires a setup to changeover job types. As soon as a setup is done at a machine, its defect rate becomes stable. However, after unknown time periods, the machine's defect rate becomes unstable due to some technical reasons. Jobs are inspected at the final stage to send quality feedback to the previous stage when the average quality rate becomes lower than a predetermined tolerance. A new dispatching rule-based scheduling algorithm (DRSA) is developed to achieve better quality and tardiness-related performance by extending the previous research of Joo et al. [1]. Results of computational experiments show that the new DRSA outperforms previous algorithms.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

scheduling algorithm considering response time for mixed tasks on multiprocessor systems 16

Scheduling algorithm considering response time for mixed tas...

引用

31st Annual ACM Symposium on Applied Computing, SAC 2016

作者： Kuo, Chin-Fu Huang, Yu-Hao Lu, Yung-Feng Chou, Shih-Chun Department of Computer Science and Information Engineering National University of Kaohsiung Kaohsiung Taiwan Department of Computer Science and Information Engineering National Taichung University of Science and Technology Taichung Taiwan Innovative DigiTech-Enabled Applications and Services Institute Institute for Information Industry Taipei Taiwan

ISBN: (纸本)9781450337397

The purpose of this paper is to study the scheduling problem of mixed task sets on multiprocessor systems. We propose a scheduling framework to improve the average response time of aperiodic jobs in mixed tasks. Our proposed scheduling framework consists of two phases: In the first phase, we considers how to assign each periodic task to a proper processor by different task allocation heuristics. Then, on a processor the unused capacity left by periodic tasks is set as the size of the Total Bandwidth (TB) Server. In the second phase, at run time when an aperiodic job arrives in the system, it will be assigned to a proper TB Server with the minimal virtual deadline and scheduled with periodic jobs on the same processor under Earliest Deadline First (EDF). A series of experiments were conducted to evaluate the proposed framework. © 2016 ACM.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Rate-distorsion based cross-layer scheduling for real time video communication 16

Rate-distorsion based cross-layer scheduling for real time v...

引用

2016 International Conference on Big Data and Advanced Wireless Technologies, BDAW 2016

作者： Azni, Mohamed LIMED Laboratory Department of Electrical Engineering University of Bejaia Algeria

ISBN: (纸本)9781450347792

This article proposes a novel idea of downlink scheduling for real time video communication over LTE cellular networks. The technique is based on cross-layer coding where a scheduling algorithm uses rate-distorsion characteristics produced by video source encoder at application level. The scheduling algorithm is currently under development. Simulation results presented here concern partial performances evaluation of existing scheduling algorithms designed for real time communication over LTE cellular networks. Three candidate algorithms: proportional fair (PF), exponential proportional fair (EXP-PF) and modified largest weighted delay first (M-LWDF) algorithms are considered. Open source LTE-Sim was used as simulation tool. Tests have been conducted using a single cell scenario without interference in which we consider a mixture of real time video, voice over IP and best effort applications. However, only results for real time video are compared. We conjecture then that, by exploiting rate-distorsion curves of typically encoded video to modify accordingly exponent in the EXP-PF algorithm, performance improvements may be attained. © 2016 ACM.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

A heterogeneous multiprocessor task scheduling algorithm based on SFLA

A heterogeneous multiprocessor task scheduling algorithm bas...

引用

2016 World Automation Congress, WAC 2016

作者： Yun, Deng Cheng, Xiao-Hui College of Information Science and Engineering Guilin University of Technology Guilin China

ISBN: (纸本)9781889335513

Multiprocessor task scheduling is vital for a high performance in multiprocessor system. To make the full use of the heterogeneous multiprocessor, a task scheduling algorithm is proposed which based on Shuffled Frog-Leaping Algorithm (SFLA). This SFLA algorithm improved the local interaction and the global exchange of information, and then finally compared with the GA algorithm in five classical experiments. The result demonstrates that the SFLA algorithm is better than GA algorithm. © 2016 TSI Enterprise Inc (TSI Press).

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Validation study on descent trajectory optimization and scheduling improvement using actual operation data

Validation study on descent trajectory optimization and sche...

引用

AIAA Modeling and Simulation Technologies Conference, 2016

作者： Takeichi, Noboru Ishihara, Jun’Ichi Abumi, Yosuke Tokyo Metropolitan University HinoTokyo191-0065 Japan Nagoya University NagoyaAichi464-8603 Japan Department of Aerospace Engineering 6-6 Asahigaoka Japan Department of Aerospace Engineering Furo-cho Chikusa-ku Japan

ISBN: (数字)9781624103872

ISBN: (纸本)9781624103872

The effectiveness of the four-dimensional descent trajectory application and the scheduling algorithms in the arrival management are discussed. A descent trajectory configuration that is capable of arrival time control with possible minimum fuel consumption is proposed. Through the fuel consumption comparison between the current actual operation data and the four-dimensional descent trajectory, it is revealed that the application of the proposed descent trajectory reduces the fuel consumption more than 30% from the current operation on average. In addition, a scheduling algorithm is proposed that uses the time advance to minimize the operation cost. Through the arrival management simulation using the actual traffic data for its initial condition, the advantages of the proposed scheduling algorithm compared to a conventional one, that delays the following aircraft to create the safe separation, are investigated. It is clarified that the proposed algorithm including the time advance is able to reduce both the operation cost and the delay accumulation. The cruise traffic streams in the current operation are usually subject to large disturbances on cruise routes. The analyses in this study clearly demonstrated the effectiveness of the scheduling algorithm including the time advance even for such a largely disordered traffic stream. When some four-dimensional management are introduced into the cruise route, the effectiveness of the scheduling including the time advance is expected to be enhanced further. © 2016, American Institute of Aeronautics and Astronautics Inc. All rights reserved.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：