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

SALSA: A scheduling algorithm for LoRa to LEO Satellites

IEEE ACCESS 2022年 10卷 11608-11615页

作者： Afhamisis, Mohammad Palattella, Maria Rita Luxembourg Inst Sci & Technol L-4362 Esch Sur Alzette Luxembourg Univ Luxembourg Fac Sci Technol & Med L-4362 Esch Sur Alzette Luxembourg

Satellites are going to revolutionize the Internet of Things (IoT) connectivity enabling the ubiquitous coverage targeted by 5G and upcoming 6G networks. While the potentials of satellite IoT are unquestionable, many challenges still remain unsolved. In the present work, we design a Long Range Wide Area Network (LoRaWAN) with mobile gateways (GWs) installed on Low Earth Orbit (LEO) satellites. We address synchronization issues due to intermittent link availability between the End Devices (EDs) and the GW, and we propose a scheduling algorithm for LoRa to LEO Satellites (SALSA). SALSA ensures reliable communication, avoiding packets drops and packet collisions, by using a Time Division Multiple Access (TDMA) approach, rather than classic ALOHA-based LoRa. The uplink transmissions of the EDs are scheduled considering the satellite availability period, the satellite footprint, and the specific visit time for each ED. Two different policies are proposed: a First Come First Served (FCFS), and a FAIR policy. Simulation results, obtained in real conditions, with real satellites visibility, demonstrate the better performance achievable with SALSA (regardless of the policy) compared to standard LoRa. The FAIR policy outperforms the FCFS policy by giving all the EDs an equal chance to transmit, even to those that are visited last by the satellite. The performance of SALSA can be further improved considering larger constellations of LEO satellites.

关键词： Satellites Low earth orbit satellites Logic gates Satellite broadcasting Uplink Downlink scheduling algorithms Satellite communication Internet of Things performance evaluation optimization methods scheduling algorithm LoRaWAN synchronization fairness

来源：评论

学校读者我要写书评

暂无评论

SLA-aware resource scheduling algorithm for cloud storage

引用

EURASIP JOURNAL ON WIRELESS COMMUNICATIONS AND NETWORKING 2020年第1期2020卷 1-10页

作者： Wang, Yong Tao, Xiaoling Zhao, Feng Tian, Bo Sai, Akshita Maradapu Vera Venkata Guilin Univ Elect Technol Guangxi Coll & Univ Key Lab Cloud Comp & Complex Guilin Peoples R China Xidian Univ State Key Lab Integrated Serv Networks ISN Xian Peoples R China Guilin Univ Elect Technol Guangxi Cooperat Innovat Ctr Cloud Comp & Big Dat Guilin Peoples R China Georgia State Univ Dept Comp Sci Atlanta GA 30303 USA

Cloud computing is a novel computing paradigm, which connects plenty of computing resources and storage resources via Internet. Cloud computing provides a number of high-quality services, such as cloud storage, outsourcing computing, and on-demand self-service, which have been widely accepted by the public. In cloud computing, by submitting their tasks to cloud, plenty of applications share huge computation and storage resources. However, how to schedule resource efficiently is a big challenge in cloud *** this paper, we propose a SLA-aware resource algorithm to enable cloud storage more efficiently. In our scheme, we take advantage of the back-end node space utilization and I/O throughput comprehensively simultaneously. We compare and contrast the existing scheduling storage policies by implementing those algorithms. The extensive tests show that our algorithm achieves a considerable improvement in terms of violation rate and the number of used hosts.

关键词： Cloud storage SLA scheduling algorithm Weight algorithm OpenStack

来源：评论

学校读者我要写书评

暂无评论

Coflow scheduling algorithm based density peaks clustering

引用

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE 2019年 97卷 805-813页

作者： Li, Chenghao Zhang, Huyin Zhou, Tianying Wuhan Univ Sch Comp Sci Wuhan Hubei Peoples R China

Recently, there are many applications using coflow-based scheduling to improve performance in a cluster. However, most applications implement coflow-based scheduling by modifying their API. These applications also need to modify the third-party libraries. This is very complicated and inefficient. Therefore, prior work has proposed a coflow-based scheduling algorithm CODA, which can automatically identify coflows. CODA does not have to design the API for each application and it is transparent for the application. But CODA performs poorly on the unstable traffic and rapid traffic in datacenter. In this paper, we propose a coflow scheduling algorithm named CS-DP to solve this problem. First, we employ the density peak clustering algorithm to implement a fast, application-transparent coflow identifier. Then we employ MLFQ (multi-level feedback scheduling queues) for scheduling. Moreover, we add a threshold calculation module on MLFQ The key point of threshold calculation is to get the appropriate threshold by historical traffic. Thus, CS-DP can accommodate the current traffic quickly and effectively. Finally, the simulation results show CS-DP enabling communication stages to complete 1.11x (1.17 x ) and 2.6x(3.0x) faster on average(95-th percentile) compared to CODA algorithm and per-flow fairness on normal traffic. (C) 2019 Elsevier B.V. All rights reserved.

关键词： Coflow Datacenter networks scheduling algorithm Multi-level feedback scheduling queues

来源：评论

学校读者我要写书评

暂无评论

LOAD BALANCING scheduling algorithm FOR CONCURRENT WORKFLOW

引用

COMPUTING AND INFORMATICS 2018年第2期37卷 311-326页

作者： Singhal, Sunita Patel, Jemin Manipal Univ Jaipur Sch Comp & Informat Technol Jaipur 303007 Rajasthan India Birla Inst Technol & Sci Pilani Rajasthan India Dept Comp Sci & Informat Syst Pilani Campus Pilani 333031 Rajasthan India

Concurrent workflow scheduling algorithm works in three phases, namely rank computation, tasks selection, and resource selection. In this paper, we introduce a new ranking algorithm that computes the rank of a task, based on its successor rank and its predecessors average communication time, instead of its successors rank. The advantage of this ranking algorithm is that two dependent tasks are assigned to the same machine and as a result the scheduled length is reduced. The task selection phase selects a ready task from each workflow and creates a task pool. The resource selection phase initially assigns tasks using min-min heuristic, after initial assignment, tasks are moved from the highly loaded machines to the lightly loaded machines. Our resource selection algorithm increases the load balance among the resources due to tasks assignment heuristic and reassignment of tasks from the highly loaded machines. The simulation results show that our proposed scheduling algorithm performs better over existing approaches in terms of load balance, makespan and turnaround time.

关键词： Rank computation multiple workflow scheduling algorithm task allocation concurrent workflow

来源：评论

学校读者我要写书评

暂无评论

AN EFFICIENT HYDROTHERMAL scheduling algorithm

引用

IEEE TRANSACTIONS ON POWER SYSTEMS 1987年第3期2卷 537-542页

作者： CARVALHO, MF SOARES, S UNIV ESTADUAL CAMPINAS FAC ENGENHARIABR-13100 CAMPINASSPBRAZIL

In this paper a Hydrothermal scheduling algorithm (HSA) for deterministic inflows is presented. A nonlinear network flow model representing the hydrothermal scheduling problem is used. By exploiting the special network structure, a temporally expanded arborescence [1], the HSA code attains important computational savings in processing time and memory requirements allowing the use of microcomputers even for large scale problems. The main feature of the HSA code is a dynamic base choice that enables the decision maker to improve the convergence of the optimization procedure by the use of his practical experience. The performance of the algorithm is tested on the Southeast Brazilian Power System.

关键词： scheduling algorithm Power system dynamics Processor scheduling Costs Convergence Computer networks Large-scale systems System testing Power system planning Reservoirs

来源：评论

学校读者我要写书评

暂无评论

A Task scheduling algorithm With Improved Makespan Based on Prediction of Tasks Computation Time algorithm for Cloud Computing

引用

IEEE ACCESS 2019年 7卷 160916-160926页

作者： Al-Maytami, Belal Ali Fan, Pingzhi Hussain, Abir Baker, Thar Liatsist, Panos Southwest Jiaotong Univ Inst Mobile Commun Chengdu 611756 Sichuan Peoples R China Ibb Univ Fac Sci Ibb 740005 Yemen Liverpool John Moores Univ Dept Comp Sci Liverpool L3 3AF Merseyside England Khalifa Univ Sci & Technol Dept Elect Engn & Comp Sci Abu Dhabi U Arab Emirates

Cloud computing is extensively used in a variety of applications and domains, however task and resource scheduling remains an area that requires improvement. Put simply, in a heterogeneous computing system, task scheduling algorithms, which allow the transfer of incoming tasks to machines, are needed to satisfy high performance data mapping requirements. The appropriate mapping between resources and tasks reduces makespan and maximises resource utilisation. In this contribution, we present a novel scheduling algorithm using Directed Acyclic Graph (DAG) based on the Prediction of Tasks Computation Time algorithm (PTCT) to estimate the preeminent scheduling algorithm for prominent cloud data. In addition, the proposed algorithm provides a significant improvement with respect to the makespan and reduces the computation and complexity via employing Principle Components Analysis (PCA) and reducing the Expected Time to Compute (ETC) matrix. Simulation results confirm the superior performance of the algorithm for heterogeneous systems in terms of efficiency, speedup and schedule length ratio, when compared to the state-of-the-art Min-Min, Max-Min, QoS-Guide and MiM-MaM scheduling algorithms.

关键词： Task analysis Cloud computing scheduling scheduling algorithms Quality of service Heuristic algorithms scheduling algorithm task scheduling resource utilization cloud computing

来源：评论

学校读者我要写书评

暂无评论

A hierarchical reliability-driven scheduling algorithm in grid systems

引用

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING 2012年第4期72卷 525-535页

作者： Tang, Xiaoyong Li, Kenli Qiu, Meikang Sha, Edwin H. -M. Hunan Univ Sch Informat Sci & Engn Natl Supercomp Ctr Changsha Changsha 410082 Hunan Peoples R China Univ Kentucky Lexington KY 40506 USA Univ Texas Dallas Dept Comp Sci Dallas TX 75230 USA

In a Grid computing system, many distributed scientific and engineering applications often require multi-institutional collaboration, large-scale resource sharing, wide-area communication, etc. Applications executing in such systems inevitably encounter different types of failures such as hardware failure, program failure, and storage failure. One way of taking failures into account is to employ a reliable scheduling algorithm. However, most existing Grid scheduling algorithms do not adequately consider the reliability requirements of an application. In recognition of this problem, we design a hierarchical reliability-driven scheduling architecture that includes both a local scheduler and a global scheduler. The local scheduler aims to effectively measure task reliability of an application in a Grid virtual node and incorporate the precedence constrained tasks' reliability overhead into a heuristic scheduling algorithm. In the global scheduler, we propose a hierarchical reliability-driven scheduling algorithm based on quantitative evaluation of independent application reliability. Our experiments, based on both randomly generated graphs and the graphs of some real applications, show that our hierarchical scheduling algorithm performs much better than the existing scheduling algorithms in terms of system reliability, schedule length, and speedup. (C) 2011 Elsevier Inc. All rights reserved.

关键词： Grid computing Hierarchical scheduling algorithm Reliability Application

来源：评论

学校读者我要写书评

暂无评论

Concurrent push - A scheduling algorithm for push-based parallel video servers

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY 1999年第3期9卷 467-477页

作者： Lee, JYB Hong Kong Univ Sci & Technol Dept Comp Sci Clear Water Bay NT Peoples R China

Most existing commercial video servers are designed for a single server. Consequently, the capacity of the system in terms of maximum sustainable concurrent sessions is limited by the performance of the video server hardware. This paper proposes and analyzes the performance of a novel parallel video server architecture where video data are striped across an array of autonomous servers. The architecture allows one to build incrementally scalable video servers without video data replication. The proposed concurrent-push scheduling algorithm allows the system to integrate with quality of service guarantees provided by today's switching networks. In this paper, the striping policy, the service model, and the concurrent-push scheduling algorithm are presented. A system model is constructed to quantify three performance metrics, namely, server buffer requirement, client buffer requirement, and system response time. Results show that a simple extension of the server-push service model does not perform well under the parallel video server architecture. To improve system performance, a novel extension of the grouped sweeping scheme called the asynchronous grouped sweeping scheme (AGSS) is introduced. To further increase the scalability of the architecture, a new subschedule striping scheme (SSS) is introduced. With the proposed AGSS and SSS, our parallel video server architecture can be scaled up to more than 10 000 concurrent users.

关键词： concurrent push grouped sweeping scheme (GSS) parallel video server performance analysis scheduling algorithm server push server striping video on demand

来源：评论

学校读者我要写书评

暂无评论

Security aware dynamic scheduling algorithm (SADSA) for real-time applications on grid

引用

CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS 2020年第2期23卷 989-1005页

作者： Singh, Surendra Batabyal, Suvadip Tripathi, Sachin ISM IIT Dept Comp Sci & Engn Dhanbad Bihar India BITS Pilani Dept Comp Sci & Informat Syst Hyderabad Campus Pilani Rajasthan India

Security is a major concern of modern real-time applications, besides requiring stringent latency bound. However, encryption algorithms are computation intensive task which impacts the timeliness of the real-time applications. Therefore, there exists a trade-off between the desired level of security and the service guarantee. In this paper, we propose a security-aware dynamic scheduling algorithm (SADSA) using a grid of computational elements (CEs) which performs this trade-off and tries to maximize the instantaneous average security level of the packets besides providing a guaranteed service. As packets arrive, we first assign them to the CEs based on the utilization value of a CE, which is the ratio of completion time and a deadline of the last packet in a CE. The security level of all the packets is then dynamically adjusted to meet the minimum required security level while maximizing the average security level of all the packets in that CE. We first show that the proposed assignment algorithm is NP-hard, is 2-competitive to the optimal solution, and that the proposed algorithm provides a sub-optimal solution. Further, using extensive simulation, we show that the proposed SADSA algorithm performs better in terms of guarantee ratio, average security level and overall performance compared to the existing algorithms.

关键词： Grid computing scheduling algorithm Real-time applications Security

来源：评论

学校读者我要写书评

暂无评论

ROBOT CONTROL COMPUTATION IN MICROPROCESSOR SYSTEMS WITH MULTIPLE ARITHMETIC-PROCESSORS USING A MODIFIED DF IHS scheduling algorithm

引用

IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS 1989年第5期19卷 1167-1178页

作者： AHMAD, S LI, B LUOYANG INST TRACKING & TELECOMMUN TECHNOL HENANPEOPLES R CHINA

The problem of designing a high-performance robot controller with multiple arithmetic processing units (APUs) is addressed. One attractive feature of the controller is that a minimum number of special-purpose hardware components are needed, and off-the-shelf components can be used. One main processor unit (MPU) schedules a number of APUs to produce the computational throughput. The depth-first/initial-heuristic-search (DF/IHS) algorithm is an efficient algorithm that solves the difficult nonpolynomial- (NP-) complete problem of scheduling a set of ordered computational tasks onto a multiprocessor system. When interprocessor communication overheads are appreciable, however it is not very effective in providing a practical near-optimum schedule, it fails to consider the problem of contention for shared resources. A multiprocessor scheduling algorithm which minimizes the effects of overhead and thus reduces the effect of contention is presented. The algorithm is used to derive the operational instructions for the APUs and the MPU for a multiple-APU-based robot controller. Simulations show that six MC68881 APUs can be used to generate the robot control computations in approximately 2.5 ms.< >

关键词： Robot control Microprocessors Arithmetic MODIS scheduling algorithm Processor scheduling Kinematics Job shop scheduling Service robots Feedback control

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：