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

International Conference on Computer Sciences and Applications (CSA)

作者： Zhang, Mengna Yu, Hongyang UESTC Res Inst Elect Sci & Technol Chengdu Peoples R China

ISBN: (纸本)9780769551258

With the rapid development of the Internet, in the face of the rapid increase of the number of visits and more complex transaction, the network server must have a very strong network computing processing power and functionality to provide a large number of concurrent access to services. The load balancing technology of linux virtual server will undoubtedly become an effective means to solve the bottleneck of the network server's performance. This paper mainly introduces the architecture and basic scheduling algorithm based on the LVS cluster, and also improve the existing load balancing algorithm and put forward a new load balancing algorithm which combines the static and dynamic scheduling algorithm. The simulation test results show that the algorithm has improves the comprehensive performance of the system to some extent and has a good adaption.

关键词： LVS load balancing static and dynamic combination scheduling algorithm

来源：评论

学校读者我要写书评

暂无评论

A Three-Stage Solution algorithm for Chemical Production scheduling

引用

IFAC-PapersOnLine 2019年第1期52卷 838-843页

作者： Hojae Lee Christos T. Maravelias University of Wisconsin-Madison Madison WI 53706 USA

A novel algorithm that exploits the strengths of discrete- and continuous-time scheduling mathematical programming formulations is proposed. It consists of three stages, in which (i) an approximate solution is obtained using a discrete-time mixed-integer programming scheduling model, (ii) the solution is mapped onto continuous-time grids via a mapping algorithm, and (iii) the accuracy of the solution is improved by solving a continuous-time linear programming model. Two types of continuous-time grids are introduced, namely unit- and material-specific grids, to ensure feasible unit utilization and material balance in the model. An extensive computational study is performed, showing that the algorithm is capable of finding high quality solutions orders of magnitudes faster than traditional methods.

关键词： Chemical production scheduling solution method scheduling algorithm network environment

来源：评论

学校读者我要写书评

暂无评论

An Effective List scheduling algorithm for Homogeneous Multi-Core Processor

An Effective List Scheduling Algorithm for Homogeneous Multi...

引用

IEEE International Conference on Anti-Counterfeiting, Security and Identification (ASID)

作者： Li, Long Li, Dongsheng Song, Yukun Wang, Xiang Elect Engn Inst Hefei Hefei Peoples R China Hefei Univ Technol Inst VLSI Design Hefei Peoples R China

ISBN: (纸本)9781479911097

With increasing of the number of processors, the quantity of data and the communication traffic in multi-core parallel systems, data scheduling becomes an important factor to restrict the performance improvement. Based on the classic list scheduling-HEFT algorithm, an improved algorithm has been proposed in this paper to make better result of reordering the same priority level tasks. The presented algorithm improves the quality of scheduling by introducing the sum of communication time and executing time as a new parameter. The experiment results show that the proposed algorithm has good effect on lists derived from a variety of node priority levels.

关键词： DAG List scheduling Communication contention scheduling algorithm Static

来源：评论

学校读者我要写书评

暂无评论

A PROPOSAL OF A NEW PACKET scheduling algorithm AND ITS EVALUATION

A PROPOSAL OF A NEW PACKET SCHEDULING ALGORITHM AND ITS EVAL...

引用

ITU Kaleidoscope Academic Conference - Building Sustainable Communities

作者： Matsuda, Tetsushi Mitsubishi Electr Corp Informat Technol R&D Ctr 5-1-1 Ofuna Kamakura Kanagawa Japan

ISBN: (纸本)9789261140618;9781467346764

ITU and other SDOs have launched oneM2M initiative recently and the standardization of M2M is now accelerating. The current access and core networks built for today's network services will be used as a common network infrastructure for M2M network with some modifications. When the current access and core networks are used for both the current network services and M2M services, communications equipments at the network edge need to handle a large number of communication flows which are a mix of large volume data communication such as web access and M2M data communication at the same time. To satisfy the QoS requirements of many applications including M2M applications, communications equipments at the network edge will need to support both minimum guaranteed rate service and low delay forwarding service for small sized packets. In this paper, we propose a packet scheduling algorithm which can provide minimum guaranteed rate service and which can reduce the scheduling delay of small packets. It can be used in access network communications equipment such as edge router and OLT. We also evaluate the proposed algorithm by simulation.

关键词： scheduling algorithm Quality of service

来源：评论

学校读者我要写书评

暂无评论

Research on task allocation strategy and scheduling algorithm of multi-core load balance

Research on task allocation strategy and scheduling algorith...

引用

7th International Conference on Complex, Intelligent, and Software Intensive Systems (CISIS)

作者： Wu, Chao Wang, Yifu Zhao, Aoyang Qiu, Tie Dalian Univ Technol Sch Software Dalian 116620 Peoples R China

ISBN: (纸本)9780769549927

Based on the research of multi-core load balancing's task scheduling and allocation, we proposed the static task graphs stratification algorithm, the static task group scheduling algorithm, and the minimum dynamic link algorithm, aiming at the characteristics of multi-core processors. When these algorithms allocate tasks, they are expected to complete multi-core load balancing. Firstly, the task allocation is divided into two stages: It needs to break dependencies among tasks and relatively independent tasks will be in the same group at the first stage. It conducts static allocation for the principle of load balancing and it allocates initial tasks which have almost the same time for the system hardware threads in the second stage. It allocates tasks which come from system's running for each hard ware thread with processor's speed as a standard in the third stage. From the verification of simulation experiment, the algorithms can achieve better load balancing and minimum completion time.

关键词： multi-core scheduling algorithm load balance task allocation

来源：评论

学校读者我要写书评

暂无评论

SEQUENCING GREY GAMES

引用

JOURNAL OF DYNAMICS AND GAMES 2020年第1期7卷 21-35页

作者： Ergun, Serap Palanci, Osman Gok, Sirma Zeynep Alparslan Nizamoglu, Sule Weber, Gerhard Wilhelm Isparta Univ Appl Sci Fac Technol Dept Comp Engn Isparta Turkey Suleyman Demirel Univ Fac Econ & Business Adm Dept Business Adm Isparta Turkey Suleyman Demirel Univ Fac Arts & Sci Dept Math Isparta Turkey Poznan Univ Tech Chair Mkt & Econ Engn Poznan Poland

The job scheduling problem is a notoriously difficult problem in combinatorial optimization and Operational Research. In this study, we handle the job scheduling problem by using a cooperative game theoretical approach. In the sequel, sequencing situations arising grom grey uncertainty are considered. Cooperative grey game theory is applied to analyze these situations. Further, grey sequencing games are constructed and grey equal gain splitting (GEGS) rule is introduced. It is shown that cooperative grey games are convex. An application is given based on Priority Based scheduling algorithm. The paper ends with a conclusion.

关键词： Sequencing games grey data grey games cooperative game theory scheduling algorithm

来源：评论

学校读者我要写书评

暂无评论

An Efficient Fault-tolerant scheduling algorithm for Periodic Real-time Tasks in Heterogeneous Platforms 16

An Efficient Fault-tolerant Scheduling Algorithm for Periodi...

引用

16th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing (ISORC)

作者： Qiu, Weiwei Zheng, Zibin Wang, Xinyu Yang, Xiaohu Zhejiang Univ Coll Comp Sci & Technol Hangzhou 310027 Zhejiang Peoples R China Chinese Univ Hong Kong Shenzhen Res Inst Shenzhen Peoples R China

ISBN: (纸本)9781479921133

Fault-tolerant real-time scheduling algorithm is one of the most important means to ensure the timeliness and high availability characteristics of fault-tolerant real-time systems. Existing scheduling models for periodic real-time task in heterogeneous platforms typically require the number of processors in the systems to be determined in advance;hence prohibit the scalability and the performance of distributed systems. The algorithms based on these models also require a large number of schedubility tests which lead to long execution time. To address these problems, we propose a primary and backup replica partition based fault-tolerant scheduling algorithm (PBPFT) based on a scalable scheduling model using heterogeneity that does not have to determine the scale of the distributed system in advance. The PBPFT approach also takes advantage of backup copy overlapping and phasing delay techniques to minimize system redundancy, and adopts the processor grouping technique to simplify algorithm complexity. Comprehensive experiments are conducted, and the results validate high resource utilization and commendable performance of our proposed approach.

关键词： scheduling algorithm Fault-tolerant Real-time task Primary and backup copy Heterogeneous distributed system

来源：评论

学校读者我要写书评

暂无评论

A Hybrid Task scheduling Scheme for Heterogeneous Vehicular Edge Systems

引用

IEEE ACCESS 2019年 7卷 117088-117099页

作者： Chen, Xiao Thomas, Nigel Zhan, Tianming Ding, Jie Beihang Univ State Key Lab Software Dev Environm Beijing 100191 Peoples R China Univ Edinburgh Sch Informat Edinburgh EH8 9AB Midlothian Scotland Newcastle Univ Sch Comp Sci Newcastle Upon Tyne NE4 5TG Tyne & Wear England Nanjing Audit Univ Sch Informat Engn Nanjing 211815 Jiangsu Peoples R China Shanghai Maritime Univ Inst FTZ Supply Chain Shanghai 201306 Peoples R China

Enhanced wireless communication improves the connectivity of vehicular networks in which vehicles are utilized as infrastructures for communication and computation. Thus, a new concept ''Vehicular Edge Computing (VEC)'' is formed. As VEC utilizes a collaborative multitude of near-user edge resources (i.e. vehicles) in the Internet of Vehicles, the capability of these joint resources becomes heterogeneous especially in their movements. Therefore, one critical problem is how to efficiently schedule each task under such mobile environments. For the reason, we propose a hybrid dynamic scheduling scheme (HDSS) that has the ability to optimize the task scheduling dynamically based on the changeable system environments. HDSS provides a decision function (DF) to select a better-performed scheduling algorithm from two provided candidates: the queue-based dynamic scheduling (QDS) algorithm and the time-based dynamic scheduling (TDS). QDS coincides with the Join-the-Shortest Queue scheme, which decides the scheduling by sorting out a server with the shortest queue-length;nevertheless, TDS is novel scheme that is designed to implement task allocation by estimating the waiting time of each server in order to select a server with the fastest response. Finally, this research generates formal models of each scheduling algorithm and the hybrid scheduling scheme to conduct performance evaluation with a fluid flow approximation technique. The analysis results in a superior performance of HDSS in the unstable VEC environments.

关键词： Internet of vehicles edge computing scheduling algorithm formal modelling

来源：评论

学校读者我要写书评

暂无评论

Linear and dynamic programming algorithms for real-time task scheduling with task duplication

引用

JOURNAL OF SUPERCOMPUTING 2019年第2期75卷 494-509页

作者： Zhang, Weizhe Hu, Yao He, Hui Liu, Yawei Chen, Allen Harbin Inst Technol Sch Comp Sci & Technol Harbin 150001 Heilongjiang Peoples R China Lynbrook High Sch San Jose CA 95129 USA

A real-time task scheduling system model was analyzed under a heterogeneous multiprocessor platform with task duplication. This analysis focused on the designs and performances of linear and dynamic programming algorithms for real-time task scheduling under a heterogeneous platform with task duplication. Moreover, experimental analyses were performed to evaluate the performances of different algorithms under different conditions. The advantages of the two proposed algorithms were compared under the same situations to discover which one achieves a higher task scheduling efficiency for a heterogeneous real-time system.

关键词： Heterogeneous multiprocessor Real-time system Fault tolerance Task duplication scheduling algorithm

来源：评论

学校读者我要写书评

暂无评论

Flit scheduling for Cut-Through Switching: Towards Near-Zero End-to-End Latency

引用

IEEE ACCESS 2019年 7卷 66369-66383页

作者： Shin, Kyubo Choi, Seokwoo Kim, Hyoil Ulsan Natl Inst Sci & Technol Sch ECE Ulsan 44919 South Korea

Achieving low end-to-end latency with high reliability is one of the key objectives for future mission-critical applications, like the Tactile Internet and real-time interactive Virtual/Augmented Reality (VR/AR). To serve the purpose, cut-through (CT) switching is a promising approach to significantly reduce the transmission delay of store-and-forward switching, via flit-ization of a packet and concurrent forwarding of the flits belonging to the same packet. CT switching, however, has been applied only to well-controlled scenarios like network-on-chip and data center networks, and hence flit scheduling in heterogeneous environments (e.g., the Internet and wide area network) has been given little attention. This paper tries to fill the gap to facilitate the adoption of CT switching in the general-purpose data networks. In particular, we first introduce a packet discarding technique that sheds the packet expected to violate its delay requirement and then propose two flit scheduling algorithms, fEDF (flit-based Earliest Deadline First) and fSPF (flit-based Shortest Processing-time First), aiming at enhancing both reliability and end-to-end latency. Considering packet delivery ratio (PDR) as a reliability metric, we performed extensive simulations to show that the proposed scheduling algorithms can enhance PDR by up to 30.11% (when the delay requirement is 7 ms) and the average end-to-end latency by up to 13.86% (when the delay requirement is 10 ms), against first-in first-out (FIFO) scheduling.

关键词： Computer networks cut-through switching end-to-end latency packet switching performance evaluation scheduling algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：