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

4th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT 2003)

作者： Li, QH Ruan, YL Yang, SD Jiang, TY Huazhong Univ Sci & Technol Dept Comp Sci & Technol Wuhan 430074 Peoples R China

ISBN: (纸本)0780378407

The task duplication based scheduling is a new approach to the scheduling problems. This is known as an NP-Complete problem. Although some algorithms are able to find an optimal schedule under certain conditions, they ignored to economize processors and minimize the total completion time. In this paper, we presents a Task Duplication based Balance scheduling (TDBS) algorithm which can schedule a class of fork-join task graph with a complexity of of O(\V\(2)), where \V\ is the number of tasks. The proposed algorithm generates an optimal schedule with high speedup and efficiency. Simulation results showed that our algorithm has better scheduling length, less completion time and less number of processors than any of compared algorithms.

关键词： optimal scheduling algorithm task duplication fork-join task graph

来源：评论

学校读者我要写书评

暂无评论

An optimal scheduling algorithm based on task duplication

引用

Journal of Systems Engineering and Electronics 2005年第2期16卷 445-450页

作者： RuanYoulin LiuCan ZhuGuangxi LuXiaofeng NationalLaboratoryofOptoelectronics HuazhongUniversityofScienceandTechnologyWuhan430074P.R.China

When the communication time is relatively shorter than the computation time for every task, the task duplication based scheduling (TDS) algorithm proposed by Darbha and Agrawal generates an optimal schedule. Park and Choe also proposed an extended TDS algorithm whose optimality condition is less restricted than that of TDS algorithm, but the condition is very complex and is difficult to satisfy when the number of tasks is large. An efficient algorithm is proposed whose optimality condition is less restricted and simpler than both of the algorithms, and the schedule length is also shorter than both of the algorithms. The time complexity of the proposed algorithm is O(v2), where v represents the number of tasks.

关键词： optimal scheduling algorithm task duplication optimality condition.

来源：评论

学校读者我要写书评

暂无评论

An optimal scheduling algorithm in Spatial TDMA Mobile Ad Hoc Network

An Optimal Scheduling Algorithm in Spatial TDMA Mobile Ad Ho...

引用

4th Microwave and Radar Week (MRW)/18th International Conference on Microwaves, Radar and Wireless Communications (MIKON)

作者： Guo Zhong-hai Chen Yong-guang Acad Equipment Command & Technol Beijing Beijing 101416 Peoples R China Ordnance Engn Coll Hebei 050003 Peoples R China

ISBN: (纸本)9781424459148

Spatial TDMA (STDMA) is a "conflict-free" MAC protocol so that concurrent communication among the connected nodes. Therefore it can enable high spectral utilization, if optimal scheduling algorithm is achieved. As directional antenna technology developed, point to point transmission to other node could generate higher data transmission rate at the same time, lower interference with other nodes than omnidirectional antenna. Therefore an optimal scheduling algorithm needs to design to allocate the right slot to the right node in order to achieve high efficiency spatial reuse. To achieve this aim, we propose a new optimal scheduling algorithm: Max Spatial Reuse scheduling algorithm (MARSA). By using of directional antenna, it allows 1-hop distance neighbor node communication with other node in same slot unless one node connect to two node. Thus this concurrent scheduling algorithm allows more node communication with other nodes in one slot. Our method based on communication graph can be achieved with low complexity.

关键词： Spatial TDMA optimal scheduling algorithm MANET MARSA

来源：评论

学校读者我要写书评

暂无评论

An optimal scheduling algorithm for Fork-Join Task Graphs

An Optimal Scheduling Algorithm for Fork-Join Task Graphs

引用

The Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies

作者： Qinghua LI Youlin RUAN Shida YANG Tingyao JIANG Department of Computer Science and Technology HuaZhong University of Science and Technology

The task duplication based scheduling is a new approach to the scheduling *** is known as an NP-Complete *** some algorithms are able to find an optimal schedule under certain conditions,they ignored to economize processors and minimize the total completion *** this paper,we presents a Task Duplication based Balance scheduling (TDBS) algorithm which can schedule a class of fork-join task graph with a complexity of of 0(|V|), where |V| is the number of *** proposed algorithm generates an optimal schedule with high speedup and *** results showed that our algorithm has better scheduling length,less completion time and less number of processors than any of compared algorithms.

关键词： optimal scheduling algorithm Task Duplication Fork-Join Task Graph

来源：评论

学校读者我要写书评

暂无评论

An optimal scheduling algorithm for Fork-Join Task Graphs

An Optimal Scheduling Algorithm for Fork-Join Task Graphs

引用

Proceedings of The Fourth International Conference on Parallel and Distribyted Computing,Applications and Technologies(第四届并行与分布式计算应用与技术国际会议)

作者： Qinghua LI Youlin RUAN Shida YANG Tingyao JIANG Department of Computer Science and Technology HuaZhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)0780378407

The task duplication based scheduling is a new approach to the scheduling problems. This is known as an NP-Complete problem. Although some algorithms are able to find an optimal schedule under certain conditions, they ignored to economize processors and minimize the total completion time. In this paper, we presents a Task Duplication based Balance scheduling (TDBS) algorithm which can schedule a class of fork-join task graph with a complexity of of O(| V|2),where |V| is the number of tasks. The proposed algorithm generates an optimal schedule with high speedup and efficiency. Simulation results showed that our algorithm has better scheduling length, less completion time and less number of processors than any of compared algorithms.

关键词： optimal scheduling algorithm Task Duplication Fork-Join Task Graph

来源：评论

学校读者我要写书评

暂无评论

AN optimal algorithm FOR scheduling REQUESTS ON INTERLEAVED MEMORIES FOR A PIPELINED PROCESSOR

引用

IEEE TRANSACTIONS ON COMPUTERS 1981年第10期30卷 787-799页

作者： RAMAMOORTHY, CV WAH, BW UNIV CALIF BERKELEY ELECTR RES LABBERKELEYCA 94720 PURDUE UNIV SCH ELECT ENGNW LAFAYETTEIN 47907

In this paper an optimal algorithm for scheduling requests on interleaved memories is presented. With this algorithm the average completion time for servicing a finite set of randomly generated requests is proved to be minimum. Performance of this algorithm for nonrandom requests has not been proved. However, it is compared with alternate algorithms using simulations. A pipelined processor is used as an example for the generation of nonrandom requests to the memories. Nonetheless, the source could have been a vector processor or a multiprocessor system. Two alternative organizations are investigated, one with a common set of fixed size buffers to store conflicting requests and one with individual fixed size buffers for each module. These two organizations are shown to be equivalent as far as the average utilization and waiting cycles are concerned. An intelligent scheduler determines the order of initiation of the memory modules. An alternative design with separate instruction and data modules is investigated. It is found that separation gains very little in performance because of the unequal rates of access to the instruction and the data modules. The basic assumptions for the analysis are that the dependency effects are ignored and the request rate is very high so that any empty buffers can be filled immediately. The degradation in memory utilization due to dependency effects is studied in a separate paper in this ❉.

关键词： Data modules instruction modules intelligent buffers interleaved memories memory bandwidth optimal scheduling algorithm pipelined processor

来源：评论

学校读者我要写书评

暂无评论

Heuristic scheduling algorithms designed based on properties of optimal algorithm for soft real-time tasks 07

Heuristic scheduling algorithms designed based on properties...

引用

Proceedings of the 2007 Summer Computer Simulation Conference

作者： Arezou Mohammadi Selim G. Akl Queen's University Kingston Ontario Canada

ISBN: (纸本)9781565553163

A soft real-time task is one whose completion time is recommended by a specific deadline. However, should the deadline be missed, such a task is not considered to have failed; only the later it finishes, the higher the penalty that is paid. For a set of soft real-time tasks that are to be scheduled on a single machine, our objective is to minimize the total penalty paid. Since the problem is NP-hard, it is not known whether an optimal schedule can be found in polynomial time. We prove four properties of any optimal scheduling algorithm for the problem. Then, we derive a number of heuristic algorithms which hold the properties obtained herein. The heuristic algorithms differ in the way that the tasks priorities are assigned. These algorithms assign priorities by using functions of task execution times, penalty factors or deadlines. Numerical simulations are presented to compare the penalty to be paid by each algorithm.

关键词： simulation results optimal scheduling algorithm heuristic algorithms soft real-time tasks penalty minimization

来源：评论

学校读者我要写书评

暂无评论

On optimal scheduling algorithms for Well-Structured Workflows in the Cloud with Budget and Deadline Constraints

引用

PARALLEL PROCESSING LETTERS 2016年第2期26卷 1650009-1650009页

作者： Wang, Yang Shi, Wei Kent, Kenneth B. Chinese Acad Sci Shenzhen Inst Adv Technol Ctr Cloud Comp Beijing 100864 Peoples R China Univ Western Ontario Inst Technol Fac Business & IT Oshawa ON Canada Univ New Brunswick Fac Comp Sci Fredericton NB E3B 5A3 Canada

In this paper, we consider optimal scheduling algorithms for scientific workflows with two typical structures, fork&join and tree, on a set of provisioned (virtual) machines under budget and deadline constraints in cloud computing. First, given a total budget B, by leveraging a bi-step dynamic programming technique, we propose optimal algorithms in pseudo-polynomial time for both workflows with minimum scheduling length as a goal. Our algorithms are efficient if the total budget B is polynomially bounded by the number of jobs in respective workflows, which is usually the common case in practice. Second, we consider the dual of this optimization problem to minimize the cost when the deadline of the computation D is fixed. We change this problem into the standard multiple-choice knapsack problem via a parallel transformation.

关键词： Workflow scheduling budget and deadline constraints optimal scheduling algorithm dynamic programming cloud

来源：评论

学校读者我要写书评

暂无评论

An Approximate optimal Solution to GPU Workload scheduling

引用

COMPUTING IN SCIENCE & ENGINEERING 2018年第5期20卷 63-76页

作者： Wang, Yanhua Qiao, Jianzhong Lin, Shukuan Zhao, Tinglei Northeastern Univ Shenyang Liaoning Peoples R China

One of the hot topics in graphic processing unit (GPU) research is workload scheduling. For parallel workloads with a large scale, the scheduling strategy can affect seriously system performance. To address this, the authors carry out scheduling of data transfer before workload execution scheduling, and propose an optimal scheduling algorithm for GPU workload. By hiding data transfer in workload execution to the maximum extent, the algorithm can reduce wait time, thus achieving a small timespan. They attribute the problem of hiding data transfer in workload execution to the 0-1 knapsack problem, and propose the pseudo-polynomial time algorithm based on the Dyer-Zemel algorithm. The authors then deduce the fully polynomial-time algorithm scheme for PPTA. By testing on cloud platform equipped with Nvidia Geforce GTX 750, they show that their scheduling algorithm estimates the optimal schedule sequence effectively.

关键词： Computational Complexity Graphics Processing Units Knapsack Problems Optimisation scheduling GPU Workload scheduling Graphic Processing Unit optimal scheduling algorithm Hiding Data Transfer Pseudopolynomial Time algorithm Dyer Zemel algorithm Knapsack Problem Cloud Platform Fully Polynomial Time algorithm Scheme PPTA Data Transfer Graphics Processing Units optimal scheduling optimal Matching scheduling algorithms GPU Workload scheduling Data Transfer Timespan Knapsack Problems FPTAS

来源：评论

学校读者我要写书评

暂无评论

optimal operation scheduling of electric water heaters under dynamic pricingVassilis

引用

SUSTAINABLE CITIES AND SOCIETY 2017年 31卷 109-121页

作者： Kapsalis, Vassilis Hadellis, Loukas Technol Educ Inst Western Greece Patras 26334 Greece

This paper presents an optimal operation scheduling algorithm and evaluates its performance under adayahead real- time pricing (DA- RTP) tariff as well as under a combination of a DA- RTP and a time varyingbound on power consumption (demand limit). The scheduling algorithm is based on Dijkstra's algorithm and can be applied to continuously controlled loads (e. g., electric water heaters -EWHs, heating, ventilation and air conditioning systems - HVACs), which belong to the category of thermostatically controlled devices (TCAs). In this paper, the algorithm deals with the operation scheduling of EWHs, which are devices with a lot of flexibility as they possess high nominal power ratings and can be used as thermalenergy buffers. User's preferences regarding the preferred water temperature, the to lerable temperature range and the acceptable deviation from the minimum energy cost are mapped to the relative weightsof energy and comfort cost of the objective function, which is strived to be minimized by the scheduling algorithm, in order to optimize energy cost as well as user's comfort. Simulation results that verify the performance of the scheduling algorithm are presented under various realistic scenarios which study the effect of the upper temperature set point and the rated power on both the energy cost and the perceived comfort level. Any deviations between the real- time and the predicted hot water demand due to forecasting errors trigger a real- time adjustment of the operation scheduling. Regarding the implementation issue, the algorithm may be used for the control of smart EWHs by optimally adjusting the temperatureset point at each time slot as well as for the direct ON/OFF control of the heating element of legacy EWHs. (C) 2017 Elsevier Ltd. All rights reserved.

关键词： optimal scheduling algorithm Electric water heater Demand response Dynamic pricing Smart grida

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：