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

IEEE Pacific Rim Conference on Communications, Computers and Signal Processing

作者： Y. Nakaki K. Okazaki K. Sakamoto Y. Nishino I. Sasase Department of Information and Computer Science Keio University Japan

In the input buffered ATM (asynchronous transfer mode) switches, HoL (head of line) blocking can be eliminated entirely by VOQ (virtual output queuing), in which each input port maintains a separate buffer for each output port. On the other hand, the IP (Internet protocol) traffic has increased explosively, therefore to manage IP packets over ATM, IP-PIM (IP-parallel iterative matching) has been proposed. However, the queue length of other buffers increases with IP-PIM, since the cells of some packets are switched consecutively. Therefore, IP-PIM causes degradation of the packet loss probability. In this paper, by defining the buffer at which cells that belong to a packet arrive in a certain time slot as an active buffer, we propose a new scheduling algorithm that gives priority to an active buffer so that cells which belong to packets can be switched effectively without increasing the queue length. We evaluate the packet loss probability and the mean packet delay by computer simulations. As a result, it is shown that the proposed scheme can improve the packet loss probability with negligible degradation of the mean packet delay.

关键词： scheduling algorithm Asynchronous transfer mode Packet switching Degradation Delay Switches Internet Protocols Traffic control Computer simulation

来源：评论

学校读者我要写书评

暂无评论

scheduling algorithm for the Job Shop scheduling Problem

Scheduling Algorithm for the Job Shop Scheduling Problem

引用

Electronics, Robotics and Automotive Mechanics Conference

作者： Marco Antonio Cruz-Chavez Martin G. Martinez-Rangel J.A. Hernandez Jose Crispin Zavala-Diaz Ocotlan Diaz-Parra CIICAP Autonomous University of Morelos Cuernavaca Morelos Mexico FCAeI Autonomous University of Morelos Cuernavaca Morelos Mexico

This paper presents an algorithm that applies a new mechanism in order to generate scheduling which allows for evaluation of the quality of solutions that are obtained in the job shop scheduling problem (JSSP). In this research, the quality of the solution is evaluated by using the makespan as an objective function. It is demonstrated experimentally that the proposed algorithm has better efficiency and efficacy when compared to the classic form of scheduling generation used to evaluate the quality of the solution in the JSSP. The efficiency and efficacy obtained by the proposed algorithm make it possible to generate and evaluate a greater number of better quality solutions in less time, so a greater exploration of the solution space for the JSSP can be conducted.

关键词： scheduling algorithm Job shop scheduling Polynomials Robots Automotive engineering Complexity theory Acceleration Simulated annealing Genetic algorithms Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

A scheduling algorithm for vehicular application specific embedded operating systems

A scheduling algorithm for vehicular application specific em...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Yuan Sun Fei-Yue Wang Zhi-Xue Wang Xin Qiao Kun-Feng Wang Inst Automat Chinese Acad Sci Key Lab Complex Syst & Intelligence Sci Beijing Peoples R China Univ Arizona Dept Ind & Syst Engn Tucson AZ 85721 USA

ISBN: (纸本)9781424400997

In this paper, a feedback algorithm based on the Constant Bandwidth Server (CBS) is designed to support and meet the quality of service requirements of soft real-time tasks in Vehicular Application Specific Embedded Operating Systems (vASOS). Moreover, it realizes the temporal isolation of hard and soft real-time tasks and guarantees the reliability and safety of vehicles in vASOS. A Proportional Integrative Derivative (PID) controller is applied to control the fraction of CPU bandwidth allocated to these tasks, and a precise mathematical model is provided. Finally, the system stability is analyzed and its effectiveness of our method is verified by simulation.

关键词： scheduling algorithm Operating systems Bandwidth Vehicle safety PD control Proportional control Feedback algorithm design and analysis Quality of service Real time systems

来源：评论

学校读者我要写书评

暂无评论

scheduling algorithm Based on Task Priority in Heterogeneous Computing Environment

Scheduling Algorithm Based on Task Priority in Heterogeneous...

引用

International Conference on Computer Science and Information Technology (CSIT)

作者： Yu Zhenxia Meng Fang Shangming Sheng Chengdu Univ. of Inf. Technol. Chengdu

In this paper, a scheduling algorithm suitable for independent heterogeneous tasks on heterogeneous computing has been studied. With the objective to find the best point between matching and load balancing , the concept of task priority has been used to improve the existing algorithm, and the simulation of our algorithm has been performed .The results demonstrated that through prioritizing tasks, a balance between load balancing and shortest execution time has been reached, and better scheduling performance has been achieved.

关键词： Processor scheduling scheduling Schedules Complexity theory scheduling algorithm Computational modeling Load management

来源：评论

学校读者我要写书评

暂无评论

MIN-MIN GRID scheduling algorithm BASED ON SEGMENT METHOD

MIN-MIN GRID SCHEDULING ALGORITHM BASED ON SEGMENT METHOD

引用

2007中国宁波国际计算机科学与技术学术大会

作者： Hu Jinzhu Chen Zhiwei Du Zhiqiang Shu Jiangbo Department of Computer Science Central China Normal University

ISBN: (纸本)9780972147903

Based on the present task scheduling algorithms in grid computation,the most classical Min-Min algorithm is analyzed deeply in this *** flaw of load unbalance in the Min-Min algorithm is pointed *** solve the flaw,an improved algorithm using segment method is *** the same time,the Sect-Min algorithm is also ***,the simulation using Matlab toolbox is done,which has confirmed the rationality and validity of the improved algorithm.

关键词： Grid scheduling algorithm Min-Min algorithm Segment method

来源：评论

学校读者我要写书评

暂无评论

A timeliness assurance scheduling algorithm for distributed publish/subscribe system

引用

CHINESE JOURNAL OF ELECTRONICS 2007年第4期16卷 603-607页

作者： Ma Jiangang Huang Tao Xu Gang Wang Jinling Ye Dan Chinese Acad Sci Inst Software Technol Ctr Software Engn Beijing 100080 Peoples R China Chinese Acad Sci Grad Sch Beijing 100049 Peoples R China

The publish/subscribe (pub/sub) communication paradigm will be used widely due to its asynchronous, many-to-many and loosely-coupled communication properties. But existing pub/sub systems can't satisfy application delay requirement under a dynamic distributed computing environment. So we extend the pub/sub system syntax, and set up the delay model, and propose a pricebased timeliness assurance scheduling algorithm named as MTEP (Maximum total earning priority). The algorithm satisfies the specified delay requirement of both publisher and subscriber, and makes use of available bandwidth efficiently, and adapts to the dynamic network environment. The experimental results show that our algorithm can make subscribers receive many more valid events and improve system earning significantly comparing with the classical FCFS, fixed priority and least remaining time priority algorithms.

关键词： publish/subscribe delay model scheduling algorithm priority

来源：评论

学校读者我要写书评

暂无评论

Low-delay scheduling algorithm that considers fairness between ports

引用

ELECTRONICS AND COMMUNICATIONS IN JAPAN PART I-COMMUNICATIONS 2007年第6期90卷 43-52页

作者： Kawakami, Hirotada Asatani, Koichi eAccess Ltd Tokyo 1050001 Japan Kogakuin Univ Grad Sch Elect & Elect Engn Tokyo 1638677 Japan

A Virtual Output Queuing (VOQ) input buffer type switch provided with a buffer in each input port is proposed in this paper as an input buffer type switch that avoids Head-of-Line (HoL) blocking. A scheduling algorithm for a multiple VOQ input buffer type switch is also proposed. As a representative algorithm we use a Two-Dimensional Round Robin (2DRR) scheduling algorithm that achieves low-delay and has iSLIP to avoid starvation as well as high fairness between ports. This paper also proposes a layered scheduling algorithm for a VOQ input buffer type switch with an objective of fairness between ports and switching with lowerdelay. The frequency of packets notbeing output is reduced regardless of whether an output port is empty by using up patterns of all I/O pairs in N input N output switches. The N input N output switching is divided into smaller units. Fairness between the units is achieved by successively shifting the order of priority of each unit that will be switched. Simulations were used to evaluate the effectiveness of the proposed scheduling algorithm. (c) 2007 Wiley Periodicals, Inc.

关键词： VOQ scheduling algorithm mean waiting time fairness between ports

来源：评论

学校读者我要写书评

暂无评论

A scheduling algorithm for applications in a cloud computing system with communication changes

引用

EXPERT SYSTEMS 2019年第2期36卷 e12356-e12356页

作者： Shao, Xia Xie, Zhiqiang Harbin Univ Sci & Technol Coll Comp Sci & Technol Harbin Heilongjiang Peoples R China

This paper proposes a scheduling algorithm to solve the problem of task scheduling in a cloud computing system with time-varying communication conditions. This algorithm converts the scheduling problem with communication changes into a directed acyclic graph (DAG) scheduling problem for existing fuzzy communication task nodes, that is, the scheduling problem for a communication-change DAG (CC-DAG). The CC-DAG contains both computation task nodes and communication task nodes. First, this paper proposes a weighted time-series network bandwidth model to solve the indefinite processing time (cost) problem for a fuzzy communication task node. This model can accurately predict the processing time of a fuzzy communication task node. Second, to address the scheduling order problem for the computation task nodes, a dynamic pre-scheduling search strategy (DPSS) is proposed. This strategy computes the essential paths for the pre-scheduling of the computation task nodes based on the actual computation costs (times) of the computation task nodes and the predicted processing costs (times) of the fuzzy communication task nodes during the scheduling process. The computation task node with the longest essential path is scheduled first because its completion time directly influences the completion time of the task graph. Finally, we demonstrate the proposed algorithm via simulation experiments. The experimental results show that the proposed DPSS produced remarkable performance improvement rate on the total execution time that ranges between 11.5% and 21.2%. In view of the experimental results, the proposed algorithm provides better quality scheduling solution that is suitable for scientific application task execution in the cloud computing environment than HEFT, PEFT, and CEFT algorithms.

关键词： CC-DAG cloud computing DPSS network time series scheduling algorithm

来源：评论

学校读者我要写书评

暂无评论

An online scheduling algorithm for assigning jobs in the computational grid

引用

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 2006年第2期E89D卷 597-604页

作者： Weng, CL Li, ML Lu, XD Shanghai Jiao Tong Univ Dept Comp Sci & Engn Shanghai 200030 Peoples R China

The computational grid provides a promising platform for the deployment of various high-performance computing applications. Problem in implementing computational grid environments is how to effectively use various resources in the system, such as CPU cycle, memory, communication network, and data storage. There are many effective heuristic algorithms for scheduling in the computational grid, however most scheduling strategies have no theoretical guarantee at all. In this paper, a cost-based online scheduling algorithm is presented for job assignment in the grid environment with theoretical guarantee. Firstly, a scheduling framework is described, where the grid environment is characterized, and the online job model is defined. Secondly, the cost-based online scheduling algorithm is presented where costs of resources are exponential functions of their loads, and the performance of this algorithm is theoretically analyzed against the performance of the optimal offline algorithm. Finally, we implement the algorithm in the grid simulation environment, and compare the performance of the presented algorithm with the other three algorithms, and experimental results indicate that the cost-based online scheduling algorithm can outperform the other three online algorithms.

关键词： computational grid scheduling algorithm online scheduling cost-based method simulation

来源：评论

学校读者我要写书评

暂无评论

A Distributed TDMA scheduling algorithm Using Topological Ordering for Wireless Sensor Networks

引用

IEEE ACCESS 2020年 8卷 145316-145331页

作者： Nguyen, Thanh-Tung Kim, Taejoon Kim, Taehong Chungbuk Natl Univ Sch Informat & Commun Engn Cheongju 28644 South Korea

In distributed wireless sensor networks (WSNs), TDMA protocols are a widely applied solution when a reliable data-transferring mechanism is in demand. However, to produce a TDMA schedule is not an easy task. During the scheduling, there can be a large number of conflicts due to the nature of radio access, which leads to a waste of operating time and energy. In this paper, we first present and discuss the concept of Topological Ordering, which is based mainly on the local neighborhood size. It is aimed to create an order of scheduling that helps reduce the competition and conflicts. Next, we propose a fast and effective distributed scheduling algorithm using Topological Ordering, called DSTO, to create a collision-free TDMA schedule. This algorithm is promising in terms of reducing running time and message collisions during the scheduling phase, which in turn reduces overall message overhead. At the same time, efficient time slot allocation, which translates to a shorter frame, is guaranteed. We implement DSTO together with two other distributed scheduling algorithms on OPNET Network Modeler and thoroughly analyze the comparative results to prove its validity and effectiveness.

关键词： scheduling algorithms Time division multiple access Wireless sensor networks scheduling Schedules Resource management Protocols Distributed DSTO scheduling algorithm TDMA topological ordering wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：