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

An integer-valued threshold autoregressive process based on negative binomial thinning

STATISTICAL PAPERS 2018年第3期59卷 1131-1160页

作者： Yang, Kai Wang, Dehui Jia, Boting Li, Han Jilin Univ Inst Math Changchun 130012 Jilin Peoples R China Jilin Univ Finance & Econ Sch Stat Changchun 130117 Jilin Peoples R China

In this paper, we introduce an integer-valued threshold autoregressive process, which is driven by independent negative-binomial distributed random variables and based on negative binomial thinning. Basic probabilistic and statistical properties of this model are discussed. Conditional least squares and conditional maximum likelihood estimators and corresponding iterative algorithms are investigated for both the cases that the threshold variable is known or not. Also, the asymptotic properties of the estimators are obtained. Finally, some numerical results of the estimates and a real data example are presented.

关键词： Integer-valued thresholdmodels min-min algorithm Negative binomial thinning Estimation

来源：评论

学校读者我要写书评

暂无评论

LBSR: Load balance over slow resources 1

LBSR: Load balance over slow resources

引用

1st International Conference on Computer Applications and Information Security (ICCAIS)

作者： Saber, Walaa E. Rizk, Rawya Y. Moussa, Walid M. Ghonem, Atef M. Port Said Univ Elect Engn Dept Port Said Egypt Suez Canal Univ Elect Engn Dept Ismailia Egypt

ISBN: (纸本)9781538644270

Cloud provides convenient and on demand network access for computing resources available over internet. There are many tasks required to be executed by the available resources to achieve the best performance, reduce response time and utilize resources. Load balancing algorithms that based only on load balancing, improve resource utilization. However these algorithms don't take resource speed and task length in their consideration. On the other hand, load balancing algorithms that based on completion time of tasks and speed of resources to reduce makespan don't take the resource load into their consideration. In this paper, Load Balance over Slow Resources (LBSR) algorithm is proposed. It assigns tasks to resources in a way that results in high load balancing over all resources including very slow ones. The performance of LBSR algorithm is evaluated against three well known load balancing algorithms: min-min, LBIMM, and Optimized TSA algorithms. The simulation results show that LBSR outperforms the other algorithms significantly in terms of makespan, resource utilization, and load deviation. The enhancement reaches more than 50% in some situations.

关键词： component Cloud Computing Load Balance min-min algorithm Makespan Load deviation Utilization

来源：评论

学校读者我要写书评

暂无评论

Grouped tasks scheduling algorithm based on QoS in cloud computing network

引用

EGYPTIAN INFORMATICS JOURNAL 2017年第1期18卷 11-19页

作者： Ali, Hend Gamal El Din Hassan Saroit, Imane Aly Kotb, Amira Mohamed Cairo Univ Fac Comp & Informat Dept Informat Technol Giza Egypt

This paper proposes the grouped tasks scheduling (GTS) algorithm that is used to schedule tasks in cloud computing network by applying quality of service to satisfy user's needs. The proposed algorithm distributes tasks into five categories;each category has tasks with similar attributes (user type, task type, task size, and task latency). After adding tasks into right category, it starts scheduling these tasks into available services. Scheduling is done in two steps: first step is deciding which category will be scheduled first. This depends on the attributes of the tasks that belong to each category so the category that has tasks with high value of attributes will be scheduled first. Second step is deciding which task inside the chosen category will be scheduled first. This depends on the execution time of task so the task that has minimum execution time will be scheduled first. (C) 2016 Production and hosting by Elsevier B.V. on behalf of Faculty of Computers and Information, Cairo University. This is an open access article under the CC BY-NC-ND license.

关键词： Cloud computing min-min algorithm QoS Task scheduling algorithm

来源：评论

学校读者我要写书评

暂无评论

Load Balancing Heuristic for Tasks Scheduling in Cloud Environment 19

Load Balancing Heuristic for Tasks Scheduling in Cloud Envir...

引用

19th International Conference on Enterprise Information Systems (ICEIS)

作者： Bey, Kadda Beghdad Benhammadi, Farid Boudaren, Mohamed El Yazid Khamadja, Salim Ecole Mil Polytech Informat Syst Lab Algiers 16111 Algeria Ecole Mil Polytech Algiers 16111 Algeria

ISBN: (纸本)9789897582479

Distributed systems, a priori intended for applications by connecting distributed entities, have evolved into supercomputing to run a single application. Currently, Cloud Computing has arisen as a new trend in the world of IT (Information Technology). Cloud computing is an architecture in full development and has become a new computing model for running scientific applications. In this context, resource allocation is one of the most challenging problems. Indeed, assigning optimally the available resources to the needed cloud applications is known to be an NP complete problem. In this paper, we propose a new task scheduling strategy for resource allocation that minimizes the completion time (makespan) in cloud computing environment. To show the interest of the proposed solution, experiments are conducted on a simulated dataset.

关键词： Cloud Computing Task Scheduling Resource Allocation Makespan Optimization min-min algorithm

来源：评论

学校读者我要写书评

暂无评论

An integer-valued threshold autoregressive process based on negative binomial thinning

An integer-valued threshold autoregressive process based on ...

引用

第十届海峡两岸统计与概率研讨会

作者： Kai Yang Dehui Wang Bating Jia Han Li School of Mathematics Jilin University

关键词： Integer-valued threshold models min-min algorithm Negative binomial thinning Estimation

来源：评论

学校读者我要写书评

暂无评论

An Analysis of the Load Scheduling algorithms in the Cloud Computing Environment: A Survey 9

An Analysis of the Load Scheduling Algorithms in the Cloud C...

引用

9th Int Conf Ind Information Syst (ICIIS2014)

作者： Chaudhary, Divya Kumar, Bijendra Netaji Subhas Inst Technol Dept Comp Engn Sect 3 New Delhi 110078 India

ISBN: (纸本)9781479964994

Cloud Computing is a recent developmental paradigm in the field of computing offering huge power to next generation computers. The dynamic provisioning acts as a base for cloud computing facilitating and supporting the network services. It focuses on making the vision of utility computing a reality with pay-as-you-go. It offers immense potential to bloom the world with applications and products focussing on greater resource utilization and scalability. This paper presents the basic cloud computing fundamentals and the concepts of load balancing i.e., scheduling of load in the cloud. It elaborates the existing load scheduling algorithms with their merits/demerits and suitability in the cloud and heterogeneous computing environment and proposes a new perspective for better results as per desired parameters.

关键词： Cloud Computing Load Balancing Scheduling min-min algorithm A* algorithm

来源：评论

学校读者我要写书评

暂无评论

Research of load balancing scheduling under grid computing

Research of load balancing scheduling under grid computing

引用

3rd International Conference on Mechanical, Control, and Electronic Information (ICMCEI)

作者： Cai, Chengyu Lou, Yuansheng Hohai Univ Coll Comp & Informat Nanjing 210000 Jiangsu Peoples R China

ISBN: (纸本)9783038351559

In order to make up for the shortage of min-min in load balancing, a new task scheduling algorithm T-Max-Int Under the grid computing has been proposed in this paper. In T-Max-Int, the Loss Degree of Max-Int has been brought into min-min. T was in the form of percentage, which represents the proportion of selected tasks that have loss degree in the total tasks. Then, experiments of T have been taken to make Makespan the minimum. Finally, T-Max-Int, Max-min, min-min were compared, which proved that T-Max-min is better than the other two algorithms in aspects of Makespan and load balancing.

关键词： task scheduling load balance min-min algorithm Max-Int algorithm time loss

来源：评论

学校读者我要写书评

暂无评论

Analytical Study of Load Scheduling algorithms in Cloud Computing 3

Analytical Study of Load Scheduling Algorithms in Cloud Comp...

引用

International Conference Parallel Distributed Grid Computing

作者： Chaudhary, Divya Kumar, Bijendra Netaji Subhas Inst Technol Dept Comp Engn Sect 3 New Delhi 110078 India

ISBN: (纸本)9781479976836

Scheduling enables the cloud in balancing the large amount of load present in the system for faster computation. It plays a vital and significant part in the execution of the load in the various heterogeneous systems. The scheduling portrays a selection of resources for the tasks for better resource utilization. This paper differentiates the various load scheduling algorithms applied in the various heterogeneous systems in detail. It plays a key role in larger resource utilization and handling. This paper defines the basic cloud computing fundamentals and the concept of load balancing i.e., scheduling of load in cloud. The applied load scheduling algorithms are elaborated and surveyed extensively.

关键词： Cloud Scheduling min-min algorithm A(star) algorithm MET MCT Genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

Grid-based Task Scheduling PMTS algorithm

Grid-based Task Scheduling PMTS Algorithm

引用

2nd International Conference on Frontiers of Manufacturing and Design Science (ICFMD 2011)

作者： Qiu, Jianlin Chen, Li Chen, Jianping Gu, Xiang Chen, Yanyun Nantong Univ Sch Comp Sci & Technol Nantong 226019 Jiangsu Peoples R China

ISBN: (纸本)9783037852828

This paper analyses the min-min algorithm and its improved algorithms through the performances of load balance, time span, quality of service and economic principle. Based on the analysis of the merits of these algorithms, we propose an improved algorithm as PMTS (Priority-based maximum time-span algorithm) by integrating. In the instance of the application, we analyse and compare the performances of these algorithms, and experimental results show that, PMTS algorithm is better than other algorithms in the comprehensive performance of load-balance, time-span, quality of service and other aspects.

关键词： min-min algorithm load balance time span PMTS

来源：评论

学校读者我要写书评

暂无评论

An Improved min-min Grid Tasks Scheduling algorithm Based on QoS Constraints

An Improved MIN-MIN Grid Tasks Scheduling Algorithm Based on...

引用

2010 International Conference on Optics, Photonics and Energy Engineering (OPEE 2010)

作者： Juefu Liu1 East China Jiao Tong University Nanchang,Jiangxi,ChinaGang Li1,* East China Jiao Tong University Nanchang,Jiangxi,China

Building upon the existing researches on grid scheduling algorithm,a priority model which improves the min-min algorithm based on Qos constraints is introduced and high-priority tasks can be implemented first on condition that high QoS tasks get high QoS resources,so that the shortage of tasks with special requirements on resources can be made up and customers' need could be satisfied more compeletely.

关键词： min-min algorithm QoS Priority

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：