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

Optimal bi-criterion planning of rescue and evacuation operations for marine accidents using an iterative scheduling algorithm

引用

ANNALS OF OPERATIONS RESEARCH 2021年第1-2期296卷 407-420页

作者： Ng, Chi To Cheng, T. C. E. Levner, Eugene Kriheli, Boris Hong Kong Polytech Univ Logist Res Ctr Dept Logist & Maritime Studies Hong Kong Peoples R China Holon Inst Technol Dept Comp Sci Holon Israel Ashkelon Acad Coll Dept Econ Ashqelon Israel

We consider the problem of real-life evacuation of people at sea. The primary disaster response goal is to minimize the time to save all the people during the evacuation operation, taking into account different groups at risk (children, women, seniors etc.) and the evacuation processing time (including the routing time), subject to a budget constraint. There are different evacuation tools (e.g., lifeboats, salvage ships, sea robots, helicopters etc.) for rescuing groups at risk to some safe points (e.g., hospitals, other ships, police offices etc.). The evacuation processing time of a group at risk depends on the group and the evacuation tool used. The secondary goal is to minimize the cost among all the alternative optimal solutions for the primary goal. We present a new mathematical rescue-evacuation model and design a fast solution method for real-time emergency response for different population groups and different evacuation tools, based on iterative utilization of a modification of the scheduling algorithm introduced by Leung and Ng (Eur J Oper Res 260:507-513, 2017).

关键词： Bi-criterion planning Disaster management Disaster response Accidents at sea scheduling algorithm

来源：评论

学校读者我要写书评

暂无评论

Phase space load balancing priority scheduling algorithm for cloud computing clusters

引用

AUTOMATIKA 2023年第4期64卷 1215-1224页

作者： Zheng, Zhou Wuxi Vocat Inst Arts & Technol Informat Ctr Wuxi Yixing Peoples R China Wuxi Vocat Inst Arts & Technol Informat Ctr Wuxi 214206 Yixing Peoples R China

Due to the development of new technologies such as the Internet and cloud computing, high requirements have been placed on the storage and management of big data. At the same time, new applications in the cloud computing environment also pose new requirements for cloud storage systems, such as strong scalability and high concurrency. Currently, the existing nosql database system is based on cloud computing virtual resources, supporting dynamic addition and deletion of virtual nodes. Based on the study of phase space reconstruction, the necessity of considering traffic flow as a chaotic time series is analyzed. In addition, offline data migration methods based on load balancing are also studied. Firstly, a data migration model is proposed through analysis, and the factors that affect migration performance are analyzed. Based on this, optimization objectives for migration are proposed. Then, the system design of data migration is presented, and optimization research is conducted from two aspects around the migration optimization objectives: optimizing from the data source layer, and proposing the LBS method to convert data sources into distributed data sources, ensuring the balanced distribution of data and meeting the scalability requirements of the system. This paper applies cloud computing technology and phase space reconstruction to load balancing scheduling algorithms to promote their development.

关键词： Cloud computing phase space load balance scheduling algorithm

来源：评论

学校读者我要写书评

暂无评论

A scheduling algorithm for Bursty Traffic: Controlling of Service Rate and Burst

引用

ARABIAN JOURNAL FOR SCIENCE AND ENGINEERING 2014年第6期39卷 4753-4764页

作者： Farzanegan, Mahmoud Daneshvar Saidi, Hossein Mahdavi, Mehdi Isfahan Univ Technol Dept Elect Engn Esfahan Iran

Quality of service (QoS) provisioning in communication networks highly depends on packet scheduling algorithms. In a well-known group of scheduling algorithms, i.e., Rate proportional servers (RPS), service rate of each session is used to isolate service disciplines. Some type of services, e.g., video streaming and interactive gaming not only have a bursty traffic but also need a minimum delay bound to obtain an acceptable QoS. However, unfortunately such applications may impose an unacceptable delay when the RPS scheduling algorithms are applied. In this paper, we propose a scheduling algorithm, which attempts to involve burstiness in addition to service rate, for isolating service disciplines in the scheduler. The proposed algorithm belongs to fluid flow paradigm and assigns a time variable weight that indicates the instantaneous service rate, to each session. The arrival constraint is assumed to be leaky bucket and our algorithm tries to provide a service discipline similar to the arrival constraint. Evaluation of the algorithm is carried out by calculating packet delay through a simulation where various kinds of traffic are scheduled by the proposed algorithm. The simulation results are compared with a well-known RPS scheduling algorithm and show that average, maximum and variance values of delay are more controllable in our algorithm by adjusting the parameters of each session.

关键词： Quality of service scheduling algorithm Traffic management Bursty traffic

来源：评论

学校读者我要写书评

暂无评论

A scheduling algorithm for Optimizing Electric Vehicle Charging Infrastructure in Parking Lots

引用

INTERNATIONAL JOURNAL OF ENGINEERING 2024年第11期37卷 2239-2255页

作者： Firouzjah, K. Gorgani Bandpey, M. Fattahi Ghasemi, J. Univ Mazandaran Dept Elect Engn Babolsar Iran

Sufficient public parking lots (PLs) are essential for developing of sustainable cities. Different factors such as location, accessibility, safety, and environmental effects must be considered to ensure PLs stability. New technologies such as intelligent parking systems, electric vehicle (EV) charging stations (CSs), and green infrastructure make PLs more sustainable and efficient. In addition to providing parking spaces for ordinary cars (OCs), PLs provide charging services for EVs. After completing charging, EVs can be transferred to another place in the PL to provide charging service for more EVs. This problem is a motivation to present an optimization process for park scheduling in this paper. The proposed process is based on minimizing the number of required chargers. The considered constraints in the optimal scheduling process include providing the requested charging service and parking space for all EVs and OCs. The required parking space is determined based on the available databases and the simultaneous presence of vehicles in the PL. Statistical simulations produce different scenarios of vehicles in PL. The findings demonstrate that the suggested approach enhances the utilization of EV charging infrastructure in PLs. It can address the issue of random parking in public places and determine the parking routine.

关键词： Electric Vehicle scheduling algorithm Public Parking Lots Charging Infrastructure

来源：评论

学校读者我要写书评

暂无评论

EFFICIENT scheduling algorithm FOR DEMAND-ASSIGNED TDMA SATELLITE SYSTEMS

引用

IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS 1989年第2期25卷 259-267页

作者： DURRANI, SH JO, KY NASA GODDARD SPACE FLIGHT CTRGREENBELTMD 20771

An efficient scheduling algorithm (stations burst plan) for demand-assigned time-division multiple-access (TDMA) satellite network systems is introduced. The total demand for transmitting data through a transponder may exceed the available bit-rate capacity, and a scheduler of the system wishes to utilize the system with minimum changes of slot allocations while maximizing throughputs. By implementing such a burst-plan algorithm, transmission of all demanded data traffic can be completed with minimum unused resources (idle slots). The underlying ideas adopted for the algorithm are that jobs with shorter remaining processing times should have higher priorities and that as many jobs are processed at a time as possible. The algorithm is particularly useful for deriving smooth burst plans for a satellite system with a large number of ground stations.< >

关键词： scheduling algorithm Time division multiple access Transponders Throughput Telecommunication traffic Satellite ground stations

来源：评论

学校读者我要写书评

暂无评论

MUS: a novel deadline-constrained scheduling algorithm for Hadoop

引用

INTERNATIONAL JOURNAL OF COMPUTATIONAL SCIENCE AND ENGINEERING 2015年第4期11卷 360-367页

作者： Teng, Fei Yang, Hao Li, Tianrui Magoules, Frederic Fan, Xiaoliang Southwest Jiaotong Univ Sch Informat Sci & Technol Chengdu 610031 Peoples R China Ecole Cent Paris F-92295 Chatenay Malabry France Lanzhou Univ Sch Informat Sci & Engn Lanzhou 730000 Gansu Peoples R China

Hadoop is a popular framework to process growing volumes of data across clusters of computers, and has achieved great success both in industry and academic researches. Although Hadoop has powerful batch processing capabilities, it can not support the real-time services, such as online payment or monitoring sensor data. These real-time services have strict deadlines in common, where service response after the deadline is considered useless. Current researches on time-constrained scheduling algorithms generally aim at shortening the completion time, rather than guaranteeing the specific latency for the real-time services. In this paper, we study the deadline-constrained scheduling problem on Hadoop, where service requests arrive randomly and no prior information is available. A maximum urgency scheduling (MUS) algorithm is proposed, and then implemented as a pluggable scheduler on Hadoop. This novel algorithm can be applied in heterogeneous environments with a low computation complexity. Experiments indicate that the MUS algorithm maximises the number of jobs meeting their deadlines while maintains the fairness among different types of jobs.

关键词： deadline constraint scheduling algorithm MapReduce cloud computing

来源：评论

学校读者我要写书评

暂无评论

On priority scheduling algorithm at ATM switches with multi-class output buffers

引用

IEICE TRANSACTIONS ON COMMUNICATIONS 1999年第1期E82B卷 34-38页

作者： Shim, KH Nho, JM Lim, JT Korea Adv Inst Sci & Technol Fac Elect Engn Taejon 305701 South Korea

In this paper, we present a priority scheduling algorithm at ATM switches with multi-class output buffers in which the service rate of each class buffer is dynamically adjusted. The service rate is computed periodically by a control scheme. We derive the design Formulas of the control scheme tc, ensure that each class buffer occupancy converges to its desired operating point related to QoS requirement. Moreover, through dynamic service rate control in the proposed scheduling algorithm. the available channel capacity can be estimated exactly. it may be used for rate control of ABR traffic and call admission control of the other real-time traffic (CBR, VER, etc.).

关键词： ATM switch scheduling algorithm service rate control priority

来源：评论

学校读者我要写书评

暂无评论

Downlink scheduling algorithm for WiMAX Protocol to Improve QoS

引用

ARABIAN JOURNAL FOR SCIENCE AND ENGINEERING 2018年第8期43卷 4105-4114页

作者： Sreenivasulu, Ummiti Naganjaneyulu, P. V. Giriprasad, M. N. Geethanjali Inst Sci & Technol Dept ECE Nellore AP India MVR Coll Engn & Technol Vijayawada AP India JNTUCE Dept ECE Anantapur AP India

The growing demand for multimedia communication has resulted in tougher requirements of quality of service (QoS). Today, QoS necessitates the deployment of powerful and efficient networks. Worldwide Interoperability for Microwave Access (WiMAX) is regarded as a promising technology in the field of wireless communication. In fact, WiMAX network is considered the best network to support real-time as well as non-real-time applications in varied conditions of a simulated environment. Wireless communication requires uplink and downlink scheduling for communication among base station subscribers. scheduling is still a challenging task for researchers. In this work, we propose an evolutionary computational scheme for downlink scheduling that brings in substantial improvisations in the QOS of a network system. The proposed approach simplifies the scheduling scheme for varied service schemes such as UGS, rtPS, nrtPS. We extend some improved computational strategies to our proposed approach in order to control data communication as well as route formation in signal information. We also use a computational approach, i.e., passage relocation admission control to perform automatic selection of base station with similar data operations. We further seek to analyze the role of data communication and packet dropping in wireless network communication. Our experimental study shows an improved performance of the proposed model in terms of slot/success ratio, throughput and energy consumption. As it happens, we succeed in recording 7% improvement in throughput performance, 10.34% improvement in slot/success ratio performance, and quite significantly, a 28% reduction in energy consumption based on the simulation time.

关键词： Wireless networks Worldwide Interoperability for Microwave Access Quality of service Admission control algorithm scheduling algorithm

来源：评论

学校读者我要写书评

暂无评论

Profit-oriented task scheduling algorithm in Hadoop cluster

引用

EURASIP JOURNAL ON EMBEDDED SYSTEMS 2016年第6期2016卷 1页

作者： Chai, Xu-qing Dong, Yong-liang Li, Jun-fei Henan Normal Univ Network Ctr Xinxiang City 453000 Henan Province Peoples R China Henan Normal Univ XinLian Coll Zhengzhou 453000 Henan Province Peoples R China Shanghai Jing Sheng Commun Technol Co Ltd Shanghai 021 Peoples R China

Nowadays, many enterprises provide cloud services based on their own Hadoop clusters. Because the resources of a Hadoop cluster are limited, the Hadoop cluster must select some specific tasks to allocate limited resources in order to get the maximal profit. In this paper, we study the maximal profit problem for a given candidate task set. We describe the candidate task set with a valid sequence and propose a sequence-based scheduling strategy. In order to improve the efficiency of finding a valid sequence, we design some pruning strategies and give the corresponding scheduling algorithm. Finally, we propose a timeout handling algorithm when some task runs timeout. Experiments show that the total profit of the proposed algorithm is very close to the ideal maxima and is obviously bigger than related scheduling algorithms under different experimental settings.

关键词： MapReduce scheduling algorithm Profit Big data

来源：评论

学校读者我要写书评

暂无评论

A Throughput-Driven scheduling algorithm of Differentiated Service for Web Cluster

引用

Wuhan University Journal of Natural Sciences 2006年第1期11卷 88-92页

作者： YAN Cai-rong SHEN Jun-yi PENG Qin-ke WAN Yong-quan Software Institute Xi＇ an Jiaotong University Xi＇ an 710049 Shaanxi China

Requests distribution is an key technology for Web cluster server. This paper presents a throughput-driven scheduling algorithm （TDSA）. The algorithm adopts the throughput of cluster back-ends to evaluate their load and employs the neural network model to predict the future load so that the scheduling system features a self-learning capability and good adaptability to the change of load. Moreover, it separates static requests from dynamic requests to make full use of the CPU resources and takes the locality of requests into account to improve the cache hit ratio. Experimental re suits from the testing tool of WebBench^TM show better per formance for Web cluster server with TDSA than that with traditional scheduling algorithms.

关键词： Web cluster server throughput-driven scheduling algorithm differentiated service

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：