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

International Conference on Innovation and Challenges in Cyber Security (ICICCS-INBUSH)

作者： Punit Gupta Satya Prakash Ghrera Computer Science and Engineering Department Jypee University of Information Technology Himachal Pradesh India

ISBN: (纸本)9781509020850

Cloud computing is now trending and more popular in these days for the computation and adopted by many companies like Google, Amazon, Microsoft etc., As the cloud size increases with increase in number of data center power consumption over a data center increases. As number of request over the data center increase with increase in load and power consumption of the data center. So the requests need to be balanced in such manner which having more effective strategy for utilization of resources and reduction in power consumption. Request balancing in such manner without having knowledge of load over server maximize resource utilization but also increasing power consumption at server. So to overcome these issues in cloud Infrastructure as a service (IaaS), we have proposing a trust based scheduling algorithm using ant colony to minimize the load, OoS of the system. Proposed algorithm has proven to have better performance in term of load and reduced request failure as compared to previously proposed scheduling balancing algorithm for cloud IaaS.

关键词： Cloud computing scheduling algorithms Servers Resource management Power demand Algorithm design and analysis Schedules

来源：评论

学校读者我要写书评

暂无评论

UDS: A Novel and Flexible scheduling Algorithm for Deterministic Multithreading

UDS: A Novel and Flexible Scheduling Algorithm for Determini...

引用

Reliable Distributed Systems

作者： Franz J. Hauck Gerhard Habiger Jörg Domaschka Institute of Distributed Systems Ulm University Germany Institute of Information Resource Management Ulm University Germany

Active replication requires deterministic execution in each replica in order to keep them consistent. Debugging and testing need deterministic execution in order to avoid data races and "Heisenbugs". Beside input, multi-threading constitutes a major source of nondeterminism. Several deterministic scheduling algorithms exist that allow concurrent but deterministic executions. Yet, these algorithms seem to be very different. Some of them were even developed without knowing the others. In this paper, we present the novel and flexible Unified Deterministic scheduling algorithm (UDS) for weakly and fully deterministic systems. Compared to existing algorithms, UDS has a broader parameter set, allowing for many configurations that can be used to adapt to a given work load. For the first time, UDS defines reconfiguration of a deterministic scheduler at run-time. Further, we informally show that existing algorithms can be imitated by a particular configuration of UDS, demonstrating its importance.

关键词： Instruction sets Timing scheduling algorithms Hardware Algorithm design and analysis Debugging

来源：评论

学校读者我要写书评

暂无评论

A scheduling algorithm in the randomly heterogeneous multi-core processor

A scheduling algorithm in the randomly heterogeneous multi-c...

引用

International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)

作者： Yan Liu Yongwei Li Yihong Zhao Xiaoming Chen College of Computer Science and Electronic Engineering Key Laboratory for Embedded and Network Computing of Hunan Province Changsha China

ISBN: (纸本)9781509040940

The increasing scale of multi-core processors are likely to be randomly heterogeneous by design or because of diversity and flaws. The latter type of heterogeneity introduced by some unforeseen variable factors such as the manufacturing process variation is especially challenging because of its unpredictability. In this environment, thread scheduler and global power manager must handle such randomly heterogeneous. Furthermore, these algorithms must supply high efficiency, scalability and low overhead because future multi-core processors may have a number of cores on a single die. This paper presents a variation-aware scheduling algorithm for application scheduling and power management. Thread switching and sampling among different cores in the multi-core processor introduce obvious overhead than previous many-core scheduling algorithms. Proposed scheme records the information of swapped thread of preferential core and uses tabu search-based randomly heterogeneous scheduling algorithm(TSR) to avoid the occurrence of repeated sampling and reduce the migration frequency and sampling frequency of a thread. The experimental results show that TSR algorithm has decreased 45.7% of thread migration and 42.2% of the sampling time as compared with local search algorithm. This paper regards the transcendental Hungarian offline scheduling algorithm as the baseline. ED2 of TSR only decrease by 8.58% as compared with that of Hungarian offline scheduling algorithm, but compared with the random search scheduling algorithm, ED2 of TSR decreased by 39.4%.

关键词： scheduling algorithms scheduling Multicore processing Algorithm design and analysis Heuristic algorithms Optimal scheduling Schedules

来源：评论

学校读者我要写书评

暂无评论

An Optimized Task scheduling Algorithm in Cloud Computing

An Optimized Task Scheduling Algorithm in Cloud Computing

引用

IEEE International Advance Computing Conference, IACC

作者： Shubham Mittal Avita Katal Graphic Era Hill University Dehradun India

ISBN: (纸本)9781467382878

Cloud provides convenient and on demand network access for computing resources available over internet. Individuals and organizations can access the software and hardware such as network, storage, server and applications which are located remotely easily with the help of Cloud Service. The tasks/jobs submitted to this cloud environment needs to be executed on time using the resources available so as to achieve proper resource utilization, efficiency and lesser makespan which in turn requires efficient task scheduling algorithm for proper task allocation. In this paper, we have introduced an Optimized Task scheduling Algorithm which adapts the advantages of various other existing algorithms according to the situation while considering the distribution and scalability characteristics of cloud resources.

关键词： scheduling algorithms scheduling Cloud computing Schedules Resource management Load management

来源：评论

学校读者我要写书评

暂无评论

Decentralized Traffic Aware scheduling in 6TiSCH Networks: Design and Experimental Evaluation

引用

IEEE INTERNET OF THINGS JOURNAL 2015年第6期2卷 455-470页

作者： Accettura, Nicola Vogli, Elvis Palattella, Maria Rita Grieco, Luigi Alfredo Boggia, Gennaro Dohler, Mischa Univ Calif Berkeley Berkeley Sensor & Actuator Ctr Berkeley CA 94720 USA Politecn Bari Dipartimento Elettrotecn & Elettron I-7015 Bari Italy Univ Luxembourg Ctr Secur Reliabil & Trust SnT L-2721 Esch Sur Alzette Luxembourg Kings Coll London Dept Informat London WC2R 2LS England

This paper capitalizes on two emerging trends, i.e., the growing use of wireless at the edge of industrial control networks and the growing interest to integrate IP into said networks. This is facilitated by recent design contributions from the IEEE and the IETF, where the former developed a highly efficient deterministic time-frequency scheduled medium access control protocol in the form of IEEE 802.15.4e timeslotted channel hopping (TSCH) and the latter IPv6 networking paradigms in the form of 6LoWPAN/ROLL, and scheduling approaches in the form of 6TiSCH. The focus of the present work is on advancing the state-of-the-art of deterministic 6TiSCH schedules toward more flexible but equally reliable distributed approaches. In addition, this paper aims to introduce the first implementation of 6TiSCH networks for factory automation environments: it outlines the challenges faced to overcome the scalability issues inherent to multihop dense low-power networks;the experimental results confirm that the naturally unreliable radio medium can support time-critical and reliable applications. These developments pave the way for wireless industry-grade monitoring approaches.

关键词： IEEE 802.15.4e scheduling algorithms 6TiSCH timeslotted channel hopping (TSCH)

来源：评论

学校读者我要写书评

暂无评论

Preference-oriented real-time scheduling and its application in fault-tolerant systems

引用

JOURNAL OF SYSTEMS ARCHITECTURE 2015年第2期61卷 127-139页

作者： Guo, Yifeng Su, Hang Zhu, Dakai Aydin, Hakan Univ Texas San Antonio Dept Comp Sci San Antonio TX 78249 USA George Mason Univ Dept Comp Sci Fairfax VA 22030 USA

In this paper, we consider a set of real-time periodic tasks where some tasks are preferably executed as soon as possible (ASAP) and others as late as possible (AMP) while still meeting their deadlines. After introducing the idea of preference-oriented (PO) execution, we formally define the concept of PO-optimality. For fully-loaded systems (with 100% utilization), we first propose a PO-optimal scheduler, namely ASAP-Ensured Earliest Deadline (SEED), by focusing on ASAP tasks where the optimality of ALAP tasks' preference is achieved implicitly due to the harmonicity of the PO-optimal schedules for such systems. Then, for under-utilized systems (with less than 100% utilization), we show the discrepancies between different PO-optimal schedules. By extending SEED, we propose a generalized Preference-Oriented Earliest Deadline (POED) scheduler that can obtain a PO-optimal schedule for any schedulable task set. The application of the POED scheduler in a dual-processor fault-tolerant system is further illustrated. We evaluate the proposed PO-optimal schedulers through extensive simulations. The results show that, comparing to that of the well-known EDF scheduler, the scheduling overheads of SEED and POED are higher (but still manageable) due to the additional consideration of tasks' preferences. However, SEED and POED can achieve the preference-oriented execution objectives in a more successful way than EDF. (C) 2014 Elsevier B.V. All rights reserved.

关键词： Periodic real-time tasks Preference-oriented execution scheduling algorithms Fault-tolerant systems

来源：评论

学校读者我要写书评

暂无评论

A robust algorithm for deadline-constrained task scheduling in small satellite clusters

A robust algorithm for deadline-constrained task scheduling ...

引用

World Congress on Intelligent Control and Automation (WCICA)

作者： Jin Wu Lixiang Liu Xiaohui Hu Science and Technology on Integrated Information System Laboratory Chinese Academy of Sciences Beijing

ISBN: (纸本)9781467384155

Task scheduling is one of the core steps to efficiently complete space missions with limited resources in small satellite clusters. This problem becomes more complicated when taking various uncertainties into consideration. In this paper, a heuristic robust task scheduling algorithm (RTSA) that handles performance variations of small satellites and task failures has been proposed. An initial solution is obtained by grouping tasks into partial critical paths (PCPs). Then three heuristic strategies and an evaluation function are introduced to improve the schedule iteratively. During this process, the robustness of RTSA is achieved by adding slack time and duplicating critical tasks judiciously. By simulating the Small Satellite Cluster environment and building task failure model, experimental results show that RTSA provides robust and fault-tolerant schedule while minimizing the makespan.

关键词： Satellites Robustness Schedules scheduling algorithms scheduling Space missions Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Compute-intensive workflow scheduling in multi-cloud environment

Compute-intensive workflow scheduling in multi-cloud environ...

引用

International Conference on Advances in Computing, Communications and Informatics (ICACCI)

作者： Indrajeet Gupta Madhu Sudan Kumar Prasanta K. Jana Department of Computer Science and Engineering Indian School of Mines Dhanbad India

ISBN: (纸本)9781509020300

Workflow scheduling is recognized as well-known NP-complete problem in the perspective of cloud computing environment. Workflow applications always need high compute-intensive operations because of the presence of precedence-constrains. The scheduling objective is to map the workflow application to the VMs pool at available cloud datacenters such that the overall processing time (makespan) is to be minimized and average cloud utilization is maximized. In this paper, we propose a two phase workflow scheduling algorithm with a new priority scheme. It considers the ratio of average communication cost to the average computation cost of the task node as a part of prioritization process in the first phase. Prioritized tasks are mapped to suitable virtual machines in the second phase. Proposed algorithm is capable of scheduling large size workflows in heterogeneous multi-cloud environment. The proposed algorithm is simulated rigorously on standard scientific workflows and simulated results are compared with the existing dependent task scheduling algorithms as per the assumed cloud model. The results remarkably show that the proposed algorithm supercedes the existing algorithms in terms of makespan, speed-up, schedule length ratio and average cloud utilization.

关键词： Cloud computing scheduling Virtual machining Schedules Informatics scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Introducing PSO for Optimal Packet scheduling of Collective Communication

Introducing PSO for Optimal Packet Scheduling of Collective ...

引用

International Symposium on Computing and Networking (CANDAR)

作者： Takashi Yokota Kanemitsu Ootsu Takeshi Ohkawa Department of Information Systems Science Utsunomiya University Tochigia Japan

ISBN: (纸本)9781509026562

Interconnection network is an inevitable component that is responsible to the system's communication capability. It affects the system-level performance as well as the physical and logical structure of the parallel system. Many studies are reported to enhance the interconnection network technology, however, we have to further discuss remaining issues for building large-scale systems. One of the most important issues is congestion management. In an interconnection network, packets are transferred simultaneously, and the packets interfere to each other on the network. Congestion arises as a result of the interference among packets. Its fast spreading speed degrades communication performance drastically and it continues for long time. Thus, we should appropriately control the network to suppress the congested situation for maintaining the maximum performance. Many studies address the problem and present effective methods, however, the maximal performance in an ideal situation is not sufficiently clarified. Solving the ideal performance is, in general, an NP-hard problem. This paper introduces particle swarm optimization (PSO) method to overcome the problem. In this paper, we first formalize the optimization problem suitable for the PSO method and present three PSO methods for avoiding local minima. We furthermore introduce some non-PSO methods for comparison. Our preliminary evaluation results reveal high potentials of the PSO method.

关键词： scheduling algorithms Particle swarm optimization Multiprocessor interconnection Optimization Schedules Large-scale systems Ports (Computers)

来源：评论

学校读者我要写书评

暂无评论

Enhanced uplink scheduling algorithm for efficient resource management in IEEE 802.16

引用

EURASIP JOURNAL ON WIRELESS COMMUNICATIONS AND NETWORKING 2015年第1期2015卷 1-12页

作者： Oad, Aneel Subramaniam, Shamala K. Zukarnain, Zuriati Ahmad Univ Putra Malaysia Fac Comp Sci & Informat Technol Upm Serdang 43400 Selangor Malaysia Univ Putra Malaysia Sports Acad Upm Serdang 43400 Selangor Malaysia

Worldwide interoperability for Microwave Access (WiMAX) is based on the IEEE 802.16 standard. This technology provides broadband wireless last-mile access in a Metropolitan Area Network (MAN). The IEEE 802.16-2004 standard (i.e. Fixed WiMAX) provides specification for the Medium Access Control (MAC) and Physical (PHY) layers for WiMAX. A critical part of the MAC layer specification is scheduling, which resolves contention for bandwidth and determines the transmission order of users. The algorithms are researched under different mixes of traffic and for various characteristics of the IEEE 802.16 MAC layer. In this research the focus is on the WiMAX uplink traffic scheduling. A scheduling algorithm's task in a multi-class network is also to categorize the users into one of the pre-defined classes. In this research, the algorithms are tailored at enhancing the collective performance of hybrid algorithms in the WiMAX domains which complement the assigned priorities. The spectrum of constraints which have been extracted from the hybrid Earliest Deadline First(EDF) + Weighted Fair Queuing (WFQ) + First in First out (FIFO) EDF+WFQ+FIFO algorithm include the static nature by which priorities are assigned and maintained during the entire duration of a transmission time and the core attributes of absolute dependence on deadline. The second constraint is embedded within the EDF scheduling algorithm and the perseverance of pursuing deadline associated weightages. In this research, the reengineering of the scheduling mechanics governing the EDF algorithms has been pursued. The dominance of the pre-stipulated deadline of the EDF algorithm is indeed acknowledged in the proposed and developed enhanced algorithm. The simulation results indicate that the legacy algorithms are not suitable for the multi-class traffic systems of WiMAX. This is because these algorithms do not explicitly incorporate the WiMAX QoS parameters into their mechanisms and are highly static. Extensive discrete

关键词： scheduling algorithms Resource management Traffic classes QoS guarantees

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：