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

21st IEEE International Conference on Ubiquitous Computing and Communications / 5th IEEE International Conference on Data Science and Computational Intelligence / 21st IEEE International Conference on Computer and Information Technology

作者： Hei, Xinhong Liu, YiFan Wang, Yichuan Wu, Dan Ji, Wenjiang Zhu, Lei Xian Univ Technol Sch Comp Sci & Engn Xian Peoples R China Xian Univ Technol Sch Comp Sci & Engn Shaanxi Key Lab Network Comp & Secur Technol Xian Peoples R China

ISBN: (纸本)9781665477260

With the emergence of CaaS, a cloud service model that can quickly build a production environment, this model has been widely used in the industry. However, the degree of loose coupling of various containers in the cluster and the fine-grained level of function division are often difficult to achieve people's expectations. In addition, it is difficult to achieve the desired effect in terms of cloud cluster security. Therefore, this paper takes container-based cloud computing clusters as the main research object, and proposes a fine-grained, loosely coupled cloud cluster model based on containers, is called Pervasive-container computing. The experimental results show that Pervasive-container computing not only meets the fine-grained loose coupling characteristics required by microservices, but also adopts the strategy of "created with time" and "destroy after use", which provides guarantees in terms of endogenous security. In addition, the proposed scheduling algorithm based on Pervasive-container calculation reduces the time consumption of file transfer by 20% compared to the time consumption without the algorithm.

关键词： Cloud Computing Microservices Container scheduling algorithm

来源：评论

学校读者我要写书评

暂无评论

A Heuristic Batch Flow Line Dynamic scheduling algorithm for the Job-Shop Problem

A Heuristic Batch Flow Line Dynamic Scheduling Algorithm for...

引用

2014 International Conference on Information Technology and Management Engineering(ITME 2014)

作者： Wen-feng PENG Zhong-jun DU Yu WEN College of Computer Science Sichuan University

This paper proposed a new scheduling algorithm combined with the greedy algorithm, batch scheduling algorithm and dynamic scheduling on an extended job-shop model. The algorithm is divided into three parts: main algorithm, key node algorithm and emergency dispatch. The priority rule in the greedy algorithm is composed of three priority variables including product value, time urgency and processing remaining time. The simulation shows that this strategy can achieve better results.

关键词： scheduling algorithm Job-shop Greedy algorithm

来源：评论

学校读者我要写书评

暂无评论

Quality-Assured Synchronized Task Assignment in Crowdsourcing

引用

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 2021年第3期33卷 1156-1168页

作者： Tu, Jiayang Cheng, Peng Chen, Lei Hong Kong Univ Sci & Technol Dept Comp Sci & Engn Hong Kong Peoples R China Lenovo Machine Intelligence Ctr Hong Kong Peoples R China East China Normal Univ Sch Comp Sci & Software Engn Shanghai 200062 Peoples R China

With the rapid development of crowdsourcing platforms that aggregate the intelligence of Internet workers, crowdsourcing has been widely utilized to address problems that require human cognitive abilities. Considering great dynamics of worker arrival and departure, it is of vital importance to design a task assignment scheme to adaptively select the most beneficial tasks for the available workers. In this paper, in order to make the most efficient utilization of the worker labor and balance the accuracy of answers and the overall latency, we a) develop a parameter estimation model that assists in estimating worker expertise, question easiness, and answer confidence;b) propose a quality-assured synchronized task assignment scheme that executes in batches and maximizes the number of potentially completed questions (MCQ) within each batch. We prove that MCQ problem is NP-hard and present two greedy approximation solutions to address the problem. The effectiveness and efficiency of the approximation solutions are further evaluated through extensive experiments on synthetic and real datasets. The experimental results show that the accuracy and the overall latency of the MCQ approaches outperform the existing online task assignment algorithms in the synchronized task assignment scenario.

关键词： Task analysis Synchronization Crowdsourcing Parameter estimation Optimization Approximation algorithms Crowdsourcing scheduling algorithm task assignment

来源：评论

学校读者我要写书评

暂无评论

A Three-Stage Solution algorithm for Chemical Production scheduling 12

A Three-Stage Solution Algorithm for Chemical Production Sch...

引用

12th International-Federation-of-Automatic-Control (IFAC) Symposium on Dynamics and Control of Process Systems including Biosystems (DYCOPS)

作者： Lee, Hojae Maravelias, Christos T. Univ Wisconsin 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. (C) 2019, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.

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

来源：评论

学校读者我要写书评

暂无评论

On the scheduling algorithm for Adapting to Dynamic Changes of User Task in Cloud Computing Environment

引用

INTERNATIONAL JOURNAL OF GRID AND DISTRIBUTED COMPUTING 2014年第3期7卷 31-40页

作者： Li, Taoshen Zhang, Xixiang Guangxi Univ Sch Comp Elect & Informat Nanning 530004 Peoples R China Hunan Univ Coll Informat Sci & Technol Changsha 4100075 Hunan Peoples R China

Focusing on the problem that users would remove or delete the task at any time in cloud computing environment, a new scheduling algorithm for adapting to dynamic changes of user task is proposed. At first, the algorithm uses directed acyclic graph (DAG) to describe the association relation of cloud computing tasks. When a task needs to be removed, the algorithm utilizes a cost function to determine whether to cancel this task, and then updates the DAG according to its dependence on removed task. Finally, it uses a heuristic algorithm to perform scheduling. Experimental results show that this algorithm can better avoid scheduling execution of revoked tasks and improve the executive efficiency of cloud computing resource. Its performance is better than Min-Min and Max-Min in executive time span.

关键词： cloud computing scheduling algorithm cancel task dynamic change directed acyclic graph (DAG)

来源：评论

学校读者我要写书评

暂无评论

A low-time-delay scheduling algorithm for Video on Demand service over P2P networks

A low-time-delay scheduling algorithm for Video on Demand se...

引用

2014 International Conference on Information and Communications Technologies (ICT 2014)

作者： Zhuo Xu Shengyong Guan Institute of Communications Engineering PLA University of Science and Technology Nanjing 210007 China Nanjing Telecommunication Technology Institute 210007 China

ISBN: (纸本)9781634392785

We are interested in providing Video-on-Demand (VoD) streaming service to a large population of clients using peer-to-peer (P2P) approach. One of the drawbacks of the current P2P architectures is that which have long start-up delays. In this paper, a novel scheme is envisioned to effectively provide a Video-on-Demand (VoD) over P2P networks. The scheme covers three main methods, namely first copying, grouping based on parts and priority scheduling. In fact, all above phases work synchronously to achieve a good performance. Extensive simulation results demonstrate that this new scheduling algorithm not only achieves low start-up time and high streaming continuity but also keeps a good network throughput even in hard network conditions.

关键词： Network coding Peer-to-Peer scheduling algorithm Video on Demand

来源：评论

学校读者我要写书评

暂无评论

Exploration on the Load Balancing Technique for Platform of Internet of Things

引用

Computer Systems Science & Engineering 2021年第9期38卷 339-350页

作者： Donglei Lu Dongjie Zhu Yundong Sun Haiwen Du Xiaofang Li Rongning Qu Yansong Wang Ning Cao Helen Min Zhou School of Artificial Intelligence Wuxi Vocational College of Science and TechnologyWuxi214028China School of Computer Science and Technology Harbin Institute of TechnologyWeihai264209China School of Astronautics Harbin Institute of TechnologyHarbin150001China Department of Mathematics Harbin Institute of TechnologyWeihai264209China School of Engineering Manukau Institute of TechnologyAuckland2241New Zealand

In recent years,the Internet of Things technology has developed rapidly,and smart Internet of Things devices have also been widely popularized.A large amount of data is generated every *** we are in the era of big data in the Internet of *** rapid growth of massive data has brought great challenges to storage technology,which cannot be well coped with by traditional storage *** demand for massive data storage has given birth to cloud storage *** balancing technology plays an important role in improving the performance and resource utilization of cloud storage ***,it is of great practical significance to study how to improve the performance and resource utilization of cloud storage systems through load balancing *** the basis of studying the read strategy of Swift,this article proposes a reread strategy based on load balancing of storage resources to solve the problem of unbalanced read load between interruptions caused by random data copying in *** storage asynchronously tracks the I/O conversion to select the storage with the smallest load for asynchronous *** experimental results indicate that the proposed strategy can achieve a better load balancing state in terms of storage I/O utilization and CPU utilization than the random read strategy index of Swift.

关键词： The Internet of Things cloud storage Swift load balancing scheduling algorithm

来源：评论

学校读者我要写书评

暂无评论

Improving the energy-efficiency of virtual machines by I/O compensation

引用

JOURNAL OF SUPERCOMPUTING 2021年第10期77卷 11135-11159页

作者： Xiao, Peng Ni, Zhenyu Liu, Dongbo Hu, Zhigang Hunan Inst Engn Sch Comp & Commun Xiangtan 411104 Peoples R China Cent South Univ Sch Software Changsha 410083 Peoples R China

With the development and application of cloud computing, virtualization technology has been widely applied in modern data centers to provide performance isolation and elastic resource provision. Although the performance overheads of resource virtualization have been extensively studied, the energy-efficiency loss caused in virtualization layer are seldom mentioned in previous studies. In this paper, we firstly analyze the VM scheduling model and I/O virtualization model from the perspective of energy-efficiency optimization;then, we propose a power-fairness credit scheduling model, which introduces a novel I/O compensation mechanism for achieving quick I/O response and better energy-efficiency at the same time. To investigate the performance and effectiveness of the proposed scheduling model, extensive experiments are conducted by using variety of benchmarks as workloads. The experimental results show that the proposed power-fairness credit scheduling model can significantly reduce the energy-efficiency loss caused by scheduling delay and I/O virtualization. In addition, it also exhibits better robustness and adaptiveness when a virtualized system is facing I/O-intensive workloads or mixed workloads.

关键词： Cloud computing Energy-efficiency Virtual machine scheduling algorithm

来源：评论

学校读者我要写书评

暂无评论

An optimal algorithm for 2-bounded delay buffer management with lookahead

引用

THEORETICAL COMPUTER SCIENCE 2021年 896卷 65-78页

作者： Kobayashi, Koji M. Univ Tokyo Meguro Ku 3-8-1 Komaba Tokyo 1138902 Japan

The bounded delay buffer management problem, which was proposed by Kesselman et al. (STOC 2001 and SIAM Journal on Computing 33(3), 2004), is an online problem focusing on buffer management of a switch supporting Quality of Service (QoS). The problem definition is as follows: Packets arrive to a buffer over time and each packet is specified by the release time, deadline and value. An algorithm can transmit at most one packet from the buffer at each integer time and can gain its value as the profit if transmitting the packet by its deadline after its release time. The objective of this problem is to maximize the gained profit. We say that an instance of the problem is s-bounded if for any packet, an algorithm has at most s chances to transmit it. For any s >= 2, Hajek (CISS 2001) showed that the competitive ratio of any deterministic algorithm is at least (1 + root 5)/2 >= 1.618. Recently, Vesely et al. (SODA 2019) designed an online algorithm matching the lower bound. Bohm et al. (ISAAC 2016 and Theoretical Computer Science, 2019) introduced the lookahead ability to an online algorithm. At a time t, the algorithm obtains information about packets arriving at time t + 1, and showed that for s = 2, there is an algorithm which achieves the competitive ratio of (-1 + root 13)/2 <= 1.303. Also, they showed that the competitive ratio of any deterministic algorithm is at least (1 + root 17)/4 >= 1.280. In this paper, for the 2-bounded model with lookahead, we design an algorithm with a matching competitive ratio of (1 + root 17)/4. (C) 2021 Elsevier B.V. All rights reserved.

关键词： Online buffer management Competitive analysis scheduling algorithm Lookahead Quality of service

来源：评论

学校读者我要写书评

暂无评论

Critical Offset Optimizations for Overlapping-Based Time-Triggered Windows in Time-Sensitive Network

引用

IEEE ACCESS 2021年 9卷 130484-130501页

作者： Shalghum, Khaled M. Noordin, Nor K. Sali, Aduwati Hashim, Fazirulhisyam Univ Putra Malaysia Dept Comp & Commun Engn Serdang 43400 Malaysia Azzaytuna Univ Dept Elect & Elect Engn Tarhuna Libya Univ Putra Malaysia Fac Engn Wireless & Photon Networks Res Ctr Excellence WiP Serdang 43400 Malaysia

Deterministic and low latency communications are increasingly becoming essential requirements for several safety-critical applications, such as automotive and automation industries. Time-sensitive networking (TSN) is an element of the new IEEE 802.1 standards that introduced Ethernet-based amendments to support these applications. One of these enhancements was presented in IEEE 802.1Qbv to define the time-aware shaping (TAS) technique for time-triggered (TT) traffic scheduling. The TAS mechanism is window-based scheduling using a gating system controlled by the gate control list (GCL) schedules in all nodes. Although several scheduling algorithms have been proposed to investigate the effects of window-related parameters on network performance, the offset difference (OD) between the same-class windows in the adjoining nodes has not been optimized yet. These optimizations are extremely crucial to implement less pessimistic latency schedules. This paper proposes an optimized flexible window-overlapping scheduling (OFWOS) algorithm that optimizes TT window offsets based on latency evaluations considering the overlapping between different priority windows at the same node. First, we formulate the GCL timings as mathematical forms under variable ODs between the same-priority windows. Then, an analytical model is implemented using the network calculus (NC) approach to express the worst-case end-to-end delay (WCD) for TT flows and evaluated using a realistic vehicular use case. The OFWOS model optimizes OD under all overlapping situations between TT windows at the same node. Compared with the latest works of 3-hop and 30-hop TSN connections, the OFWOS reduces the WCD bounds by 8.4% and 32.6%, respectively, accomplishing less pessimistic end-to-end latency bounds.

关键词： Network calculus safety-critical real-time systems scheduling algorithm time-sensitive network (TSN) worst-case latency performance

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：