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

DICSA: Distributed and concurrent link scheduling algorithm for data gathering in wireless sensor networks

AD HOC NETWORKS 2015年第PartA期25卷 54-71页

作者： Dezfouli, Behnam Radi, Marjan Whitehouse, Kamin Abd Razak, Shukor Hwee-Pink, Tan Univ Teknol Malaysia Fac Comp Dept Comp Sci Johor Baharu 81310 Malaysia ASTAR Inst Infocomm Res I2R Networking Protocols Dept Singapore 138632 Singapore Univ Virginia Dept Comp Sci Charlottesville VA 22903 USA

Although link scheduling has been used to improve the performance of data gathering applications, unfortunately, existing link scheduling algorithms are either centralized or they rely on specific assumptions that are not realistic in wireless sensor networks. In this paper, we propose a distributed and concurrent link scheduling algorithm, called DICSA, that requires no specific assumption regarding the underlying network. The operation of DICSA is managed through two algorithms: (i) Primary State Machine (PSM): Enables each node to perform its own slot reservation;(ii) Secondary State Machine (SSM): Enables each node to concurrently participate in the slot reservation of its neighbors. Through these algorithms and a set of forbidden slots managed by them, DICSA provides concurrent and collision-free slot reservation. Our results show that the execution duration and energy consumption of DICSA are at least 50% and 40% less than that of DRAND, respectively. In terms of slot assignment efficiency, while our results show higher spatial reuse over DRAND, the maximum slot number assigned by DICSA is at least 60% lower than VDEC. In data-gathering applications, our results confirm the higher performance of DICSA in terms of throughput, delivery ratio and packet delay. We show that the network throughput achievable by DICSA is more than 50%, 70%, 90% and 170% higher than that of DRAND, SEEDEX, NCR and FPS, respectively. (C) 2014 Elsevier B.V. All rights reserved.

关键词： scheduling algorithm Interference MAC

来源：评论

学校读者我要写书评

暂无评论

A time-sensitive network scheduling algorithm based on improved ant colony optimization

引用

ALEXANDRIA ENGINEERING JOURNAL 2021年第1期60卷 107-114页

作者： Wang, Yang Chen, Jidong Ning, Wei Yu, Hao Lin, Shimei Wang, Zhidong Pang, Guanshi Chen, Chao Shenzhen Polytech Sch Elect & Commun Engn Shenzhen Peoples R China Shenzhen Polytech Sch Artificial Intelligence Shenzhen Peoples R China Shenzhen Polytech Off Technol Dev Shenzhen Peoples R China EVOC Intelligent Technol Co Ltd Shenzhen Peoples R China

Cyber-physical system (CPS) is the core technology of Industry 4.0. The deterministic behaviors of the CPS require real-time deterministic guarantee. Therefore, this paper improves the ant colony optimization (ACO) into a scheduling algorithm for time-triggered flows in time-sensitive network (TSN), a standard developed by the IEEE 802.1 Working Group that fully satisfies the strict end-to-end delay requirements of industrial applications. Simulation results show that the improved ACO (IACO) can schedule the time-triggered flows in the TSN excellently, and outperform the traditional ACO in convergence speed, optimization ability and the proneness to local optimum trap. To sum up, this paper provides an effective real-time guarantee for the TSNs. (C) 2020 The Authors. Published by Elsevier B.V. on behalf of Faculty of Engineering, Alexandria University.

关键词： Cyber-physical system (CPS) Time-sensitive network (TSN) scheduling algorithm

来源：评论

学校读者我要写书评

暂无评论

Performance evaluation of a new scheduling algorithm for distributed systems with security heterogeneity

引用

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING 2007年第10期67卷 1067-1081页

作者： Xie, Tao Qin, Xiao San Diego State Univ Dept Comp Sci San Diego CA 92182 USA Auburn Univ Dept Comp Sci & Software Engn Auburn AL 36849 USA

High quality of security service is increasingly critical for applications running on heterogeneous distributed systems. However, existing scheduling algorithms for heterogeneous distributed systems disregard security requirements of applications. To address this issue, in this paper, we introduce security heterogeneity concept for our scheduling model in the context of distributed systems. Based on the concept, we propose a novel heuristic scheduling algorithm, or SATS, which strives to maximize the probability that all tasks are executed without any risk of being attacked. Extensive experimental studies using real-world traces indicate that the scheduling performance is affected by heterogeneities of security and computational power. Additionally, empirical results demonstrate that with respect to security and performance, the proposed scheduling algorithm outperforms existing approaches under a wide spectrum of workload conditions. (C) 2007 Elsevier Inc. All rights reserved.

关键词： scheduling algorithm heterogeneous distributed system computational heterogeneity security heterogeneity security overhead risk-free probability degree of security deficiency

来源：评论

学校读者我要写书评

暂无评论

Robust Frequency Regulation Capacity scheduling algorithm for Electric Vehicles

引用

IEEE TRANSACTIONS ON SMART GRID 2017年第2期8卷 984-997页

作者： Yao, Enxin Wong, Vincent W. S. Schober, Robert Univ British Columbia Dept Elect & Comp Engn Vancouver BC V6T IZ4 Canada Peking Univ Beijing Peoples R China Univ British Columbia Dept Elect & Comp Engn Vancouver BC Canada Univ Manitoba Winnipeg MB Canada Univ Waterloo Waterloo ON Canada Univ Erlangen Nuermberg Neuendettelsau Germany Univ Toronto Toronto ON Canada Friedrich Alexander Univ Erlangen Germany

Electric vehicles (EVs) have the potential to provide frequency regulation service to an independent system operator (ISO) by changing their real-time charging or discharging power according to an automatic generation control (AGC) signal. Recently, the Federal Energy Regulatory Commission has issued Order 755 to ISOs to introduce a performance-based compensation scheme in the frequency regulation market. The goal is to provide economic incentives for fast ramping resources such as EVs to participate in the market. In this paper, we model the EV frequency regulation service under the performance-based compensation scheme. Thereby, a robust optimization framework is adopted for the formulation of a frequency regulation capacity scheduling problem. Our problem formulation takes into account the performance-based compensation scheme, the random AGC signal, and the dynamic arrival and departure times of the EVs. We propose an efficient algorithm to solve the formulated problem. Simulation results show that the proposed algorithm improves the revenue under the performance-based compensation scheme compared with a benchmark algorithm.

关键词： Electric vehicles frequency regulation robust optimization scheduling algorithm

来源：评论

学校读者我要写书评

暂无评论

The i-QOCF (iterative quasi-oldest-cell-first) scheduling algorithm for input-queued ATM switches

引用

IEICE TRANSACTIONS ON COMMUNICATIONS 2000年第2期E83B卷 182-189页

作者： Nabeshima, M Yamanaka, N NTT Network Serv Syst Labs Musashino Tokyo 1808585 Japan

This paper proposes the iterative quasi-oldest-cell-first (i-QOCF) scheduling algorithm, a new scheduling algorithm for input-queued ATM switches with virtual output queuing (VOQ). In the i-QOCF scheduling algorithm, each input port and each output port maintains its own list. The length of the list can be N, 2 x N,..., B x N, where B is the size of the separate queue for an output port at input ports, and N is the number of output ports. The list maintained by an input port contains the identifiers for those output ports to which that input port will send a cell. The list maintained by an output port contains the identifiers for input ports that have a cell destined for that output port. Ii we use a list whose length is B x N, then the identifiers in the list appear in the oldest order, and i-QOCF gives preference to cells that have been waiting for the longest time. If we use a list whose length is less than B x N, then the identifiers in the list appear in the quasi-oldest order, and i-QOCF gives preference to cells that have been waiting for the quasi-longest time. We determine the performance of i-QOCF in a comparison with i-OCF in terms of cell delay time. We find that an input-queued ATM switch with i-QOCF and VOQ can achieve 100% throughput for independent arrival processes. Under uniform traffic, 3-QOCF is enough to achieve convergence during one cell time. If we use 3-QOCF, the list length is 3 x N, then its cell delay time is almost the same as that of 4-OCF (Oldest-Cell-First).

关键词： imput-queued ATM switch scheduling algorithm throughput cell delay time

来源：评论

学校读者我要写书评

暂无评论

PARALLEL TESTING FOR SYSTEM DIAGNOSIS AND A scheduling algorithm

MICROPROCESSING AND MICROPROGRAMMING

引用

MICROPROCESSING AND MICROPROGRAMMING 1987年第4-5期20卷 283-286页

作者： NI, P HUANG, KY CHONGQING UNIV DEPT COMP SCICHONGQINGPEOPLES R CHINA

The problem of scheduling inter-subsystem tests is addressed in this paper. The notion of parallel testing is introduced. It is shown that the minimum number of parallel tests which cover all the inter-subsystem tests may range from Δ (the maximum vertex degree of the test graph) to Δ + 2. An O (Δ·|V|·|E|) scheduling algorithm dedicated to systems without mutual tests is presented. It can be guaranteed that all the inter-subsystem tests can be accomplished through at most Δ + 1 parallel tests by virtue of this algorithm.

关键词： System diagnosis Parallel test Test graph scheduling algorithm

来源：评论

学校读者我要写书评

暂无评论

Research on Cluster Load Balancing scheduling algorithm

引用

AGRO FOOD INDUSTRY HI-TECH 2017年第3期28卷 585-588页

作者： Wen Siqin Hohhot Mnzu Coll Comp Dept Hohhot 010051 Peoples R China

Due to the development of the times, people are getting more and more dependent on the Internet, so that there is a large amount of information and data;the arrival of the era of big data makes the processing of information data become a very important issue. Whether it is a wide area network or LAN, a large amount of data and information is produced, which makes the network configuration can't carry such a large amount of data, therefore, it is necessary to do some research on the allocation of data processing in network equipment, so as to avoid the phenomenon of network paralysis caused by unreasonable task assignment. Therefore, load balancing technology arises at the historic moment. In this paper, a detailed discussion of the technology was made, which has very important practical significance for the development of the computer.

关键词： cluster load balancing scheduling algorithm

来源：评论

学校读者我要写书评

暂无评论

A Proposed Approach for Motif Finding Problem Solved on Heterogeneous Cluster with Best scheduling algorithm

引用

INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS 2023年第5期14卷 1016-1022页

作者： Barghash, Abdullah Harbaoui, Ahmed King Abdulaziz Univ Dept Comp Sci Jeddah Saudi Arabia

Motif Finding Problem (MFP) is the problem of finding patterns in sequences of DNA. This paper discusses and presents an enhanced scheduling approach to solve the motif problem on the Heterogeneous Cluster by making a comparison between exact algorithms. The method that was followed is to analyze several exact algorithms, compare them within specific points to measure, and improve performance by comparing the number of devices and peripheral units used in every situation and running time in every method. Our experimental results show that the use of the scheduling approach that use different algorithms on Heterogeneous Cluster make a significant difference in the speed of completing the problem and in a shorter record time with less resources, and that this proposed approach is more effective than the traditional method of distributing tasks to solve the motif problem.

关键词： Motif finding problem scheduling algorithm heterogeneous high-performance computing

来源：评论

学校读者我要写书评

暂无评论

Swap-Based Frequency-Domain Packet scheduling algorithm for Small-Queue Condition in OFDMA

引用

IEEE COMMUNICATIONS LETTERS 2013年第5期17卷 1028-1031页

作者： Lee, Suk-Bok Hanyang Univ Dept Comp Sci & Engn Ansan South Korea

We propose an efficient frequency-domain packet scheduling (FDPS) for situations where some of the queues have a small amount of data available for transmission in downlink OFDMA-based systems. Under such small-queue condition, we first show that current FDPS proposals result in sub-optimal outcome, suffering from their isolated resource-assignment strategies. With our simple algorithmic solution, we demonstrate that better performance is achieved in terms of system throughput as well as fairness perspective, which is evaluated using 3GPP LTE system model simulations.

关键词： scheduling algorithm frequency-domain scheduling OFDMA LTE cellular networks

来源：评论

学校读者我要写书评

暂无评论

Makespan and reliability driven scheduling algorithm for independent tasks in Grids

引用

High Technology Letters 2007年第4期13卷 407-412页

作者：王树鹏 Yun Xiaochun Yu Xiangzhan Intelligent Software Division Institute of Computing Technology Chinese Academy of Sciences Beijing 100080 P.R. China School of Computer Science and Technology Harbin Institute of Technology Harbin 150001 P.R. China

In the dynamic, complex and unbounded Grid systems, failures of Grid resources caused by malicious attacks and hardware failures are inevitable and have an adverse effect on the execution of tasks. To mitigate this problem, a makespan and reliability driven （MRD） sufferage scheduling algorithm is designed and implemented. Different from the traditional Grid scheduling algorithms, the algorithm addresses the makespan as well as reliability of tasks. The simulation experimental results show that the MRD sufferage scheduling algorithm can increase reliability of tasks and can trade off reliability against makespan of tasks by adjusting the weighting parameter in its cost function. So it can be applied to the complex Grid computing environment well.

关键词： grid scheduling algorithm makespan reliability independent task

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：