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

International Conference on Intelligent Systems, Modelling and Simulation (ISMS)

作者： Mehdi Effatparvar Somayeh Aghayi Vahid Asadzadeh Yosef Dashti Department of Computer Islamic Azad University Ardabil Iran Sama Technical and Vocational Training College Islamic Azad University Ardabil Iran Department of Computer Islamic Azad University Germi Iran

ISBN: (纸本)9781509006663

Grid computing is actually the next generation of distributed systems. Its objective is to create a powerful, large and autonomous virtual computer. This computer is created through assembling countless heterogeneous resources with the aim of sharing them. scheduling is one of the most important and challenging issue of such systems. An accurate and efficient schedule is required to increase the grid efficiency. Grid resources belong to different management domains, each one applies different management policies. This paper proposed a new heuristic approach based on particle swarm optimization algorithm in order to scheduling the jobs in gird environment. The proposed algorithm would create an optimal scheduler to complete the jobs in the minimum flowtime and makespan.

关键词： scheduling Particle swarm optimization Optimal scheduling scheduling algorithms Computers Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

A Hierarchic Hybrid scheduling Algorithm for Static Task with Precedence Constraints

A Hierarchic Hybrid Scheduling Algorithm for Static Task wit...

引用

IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)

作者： Yuanyuan Xie Jiang Wu Fengzhu Liu College of Information Science and Technology Northwest University Xi'an China

ISBN: (纸本)9781509032068

In distributed computing, the task scheduling problem is an NP-hard problem. Satisfying the task dependencies strictly and minimizing the execution time are the desired aims of the task scheduling algorithm. However, most scheduling algorithms focuses on minimizing the execution time without a clear strategy to preserve the precedence constraints. In this paper, a new two-phase algorithm called Hierarchic Hybrid Heuristic-Genetic scheduling (H3GS) is introduced and developed for heterogeneous distributed computing systems (HeDCSs). In the first phase, the paper proposes a improvement list-based heuristic algorithm, called H2EFT, and the main principle of the algorithm is to divide the Directed Acyclic Graph (DAG) into levels, which simplifies the task dependencies and preserves the precedence constraints of tasks. The second phase implements a hierarchic genetic algorithm, called HGAS, which proceeds to evolve shorter schedules by inserting the H2EFT schedule into the initial populations and repairing the invalid schedule on the basis of the DAG hierarchy. Consequently, the H3GS algorithm delivers high quality solution in reasonable computing time based on a hierarchical DAG. The comparison performance results show that H3GS has outperformed the HEFT, H2EFT, and H2GS algorithms both in efficiency, complexity, and quality.

关键词： Schedules scheduling Sociology Statistics scheduling algorithms Distributed computing

来源：评论

学校读者我要写书评

暂无评论

Energy-aware scheduling of conditional task graphs with deadlines on MPSoCs

Energy-aware scheduling of conditional task graphs with dead...

引用

IEEE International Conference on Computer Design: VLSI in Computers and Processors, (ICCD)

作者： Umair Ullah Tariq Hui Wu The University of New South Wales

We investigate the problem of scheduling a set of non-pre-emptive tasks with individual deadlines and conditional precedence constraints on MPSoCs (MultiProcessor System-on-Chips) with shared memory such that the total processor energy consumption of all the tasks in each scenario is minimized under two power models, namely the dynamic power model and the total power model, and propose a unified two-phase approach. The approach consists of an offline task scheduler and an online task scheduler. The offline scheduler uses a novel priority scheme to assign each task to a processor, constructs a global schedule, and uses convex NLP (NonLinear Programming) to compute an optimal speed for each task. The online task scheduler dynamically performs task reallocation and task rescheduling, and reassigns a speed to each task to utilize the slack time generated by individual scenarios. We have compared our approach with two state-of-the-art approaches by using 23 benchmarks. The experimental result show that the average improvement and the maximum improvement of our approach over the approach proposed by Ge et al. are 19.2% and 28.6%, respectively, and the average improvement and the maximum improvement over the approach proposed by Malani et al. are 53.2% and 74.2%, respectively.

关键词： Energy consumption Schedules Dynamic scheduling scheduling algorithms Embedded systems Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

Poster Abstract: scheduling Multi-Threaded Tasks to Reduce Intra-Task Cache Contention

Poster Abstract: Scheduling Multi-Threaded Tasks to Reduce I...

引用

IEEE Symposium on Real-Time and Embedded Technology and Applications

作者： Corey Tessler Nathan Fisher Wayne State University

Summary form only given. Research on hard real-time systems and their models has predominately focused upon single-threaded tasks. When multithreaded tasks are introduced to the classical real-time model the individual threads are treated as distinct tasks, one for each thread. These artificial tasks share the deadline, period, and worst case execution time of their parent task. In the presence of instruction and data caches this model is overly pessimistic, failing to account for the execution time benefit of cache hits when multiple threads of execution share a memory address space. This work takes a new perspective on instruction caches. Treating the cache as a benefit to schedulability for a single task with m threads. To realize the “inter-thread cache benefit” a new scheduling algorithm and accompanying worst-case execution time (WCET) calculation method are proposed. The scheduling algorithm permits threads to execute across conflict free regions, and blocks those threads that would create an unnecessary cache conflict. The WCET bound is determined for the entire set of m threads, rather than treating each thread as a distinct task. Both the scheduler and WCET method rely on the calculation of conflict free regions which are found by a static analysis method that relies on no external information from the system designer. By virtue of this perspective the system's total execution execution time is reduced and is reflected in a tighter WCET bound compared to the techniques applied to the classical model. Obtaining this tighter bound requires the integration of three typically independent areas: WCET, schedulability, and cache-related preemption delay analysis.

关键词： Instruction sets Real-time systems scheduling algorithms Data models Delays

来源：评论

学校读者我要写书评

暂无评论

RT-Seed: Real-Time Middleware for Semi-Fixed-Priority scheduling

RT-Seed: Real-Time Middleware for Semi-Fixed-Priority Schedu...

引用

International Symposium on Object-Oriented Real-Time Distributed Computing

作者： Hiroyuki Chishiro Department of Information and Computer Science Keio University Japan

ISBN: (纸本)9781467390330

The continuing economic boom has seen that many people become interested in automated trading systems with timing constraints and quality of service, called real-time trading systems. In order to realize such real-time trading systems, multi-/many-core processors are required. However, real-time trading systems are somewhat complex, and real-time operating systems struggle to offer continuous support because of their customization, robustness, maintainability, and portability compared with real-time middleware. An imprecise computation model is employed to support these trading systems, and semi-fixed-priority scheduling is a representative imprecise real-time scheduling technique for multi-/many-core processors. Unfortunately, there is no real-time middleware that supports semi-fixed-priority scheduling. This paper presents the RT-Seed real-time middleware, which implements a semi-fixed-priority scheduling algorithm, called Partitioned Rate Monotonic with Wind-up Part (P-RMWP), on Linux. P-RMWP supports the parallel-extended imprecise computation model that executes optional parts in parallel, called parallel optional parts. This paper also describes how to terminate parallel optional parts in the user space. The performance of P-RMWP is evaluated using Intel's Xeon Phi many-core system.

关键词： Computational modeling Real-time systems Middleware Quality of service scheduling algorithms scheduling

来源：评论

学校读者我要写书评

暂无评论

Provably near optimal link scheduling and power control for wireless device-to-device networks

Provably near optimal link scheduling and power control for ...

引用

Australian Communications Theory Workshop (AusCTW)

作者： S. Ali Hesammohseni Mohamed Oussama Damen Department of Electrical and Computer Engineering University of Waterloo Waterloo ON Canada

The limiting impact of interference on the total throughput of large wireless networks has long been recognized by practitioners. The degrees-of-freedom characterization of interference networks has shown that the collapse in scaling without appropriate interference management is a fundamental aspect of these networks, but results from information theory were generally not applicable to network interference management in practice. Recent theoretical results on the capacity-optimality of treating interference as noise for large classes of wireless networks have led to renewed interest in wireless link scheduling methods that enjoy good theoretical guarantees at the same time as having the simplicity benefits of single-user encoding and decoding. In this paper, we provide a link scheduling method that has the dual benefits of being based on the characteristics of real-life RF front-ends used in practical wireless networks and at the same time being analytically tractable and analyze its performance characteristics.

关键词： Interference Power control Information theory scheduling algorithms Receivers Measurement Wireless networks

来源：评论

学校读者我要写书评

暂无评论

Modeling and Performance Evaluation of Novel scheduling Algorithm for Downlink LTE Cellular Network

引用

WIRELESS PERSONAL COMMUNICATIONS 2015年第3期83卷 2303-2316页

作者： Nsiri, Bechir Mallouki, Nasreddine Mhatli, Sofien Ghanbarisabagh, Mohammad Ammar, Mahmoud Hakimi, Walid Univ Tunis El Manar Natl Engn Sch Tunis ENIT SysCom Lab Tunis 1002 Tunisia EPT Univ Carthage SERCOM Labs Tunis 2078 Tunisia Islamic Azad Univ Fac Engn North Tehran Branch Tehran Iran

Long term evolution is standardized by the 3rd Generation Partnership Project to provide a high data rate up to 100 and 50 Mbps for downlink and uplink transmission respectively and can operate in different bandwidths ranging from 1.4 up to 20 MHz. Downlink LTE system is based on the OFDMA technique and uses several enhanced techniques in order to increase the spectral efficiency and aggregate the cell throughput. The incorporated scheduling mechanisms can significantly contribute to this goal. scheduling mechanism is the process of allocated the resources (time and frequency) to users transmitting different flows in same time. In this paper, we propose a novel scheduling algorithm for downlink transmission in LTE system. The performances of the newly scheduler are simulated and compare to the performances of three basic scheduler such as Round Robin, Proportional Fair and Max Rate.

关键词： Proportional Fair Max Rate Resources block Orthogonal frequency division multiple access (OFDMA) scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

A cross cloud scheduling algorithm at SaaS level on Rack Space, Go Daddy and Azure platforms

A cross cloud scheduling algorithm at SaaS level on Rack Spa...

引用

International Conference on Computing, Communication & Automation (ICCCA)

作者： Gurpreet Singh Sandhu I. S. Hudiara Sawtantar Singh Khurmi Department of Computer Science&Engg DeshBhagat University Punjab India Chitkara University Punjab India Department of Computer Science &Engg DeshBhagat University (Punjab) India

ISBN: (纸本)9781509016679

Cloud computing is the promising technology to support virtualization, resource management and provide services to IaaS, PaaS, SaaS. While cloud provides many features but still it has some short comings like energy consumption between clouds. So the major objective of the cloud computing is to provide the reliable service keeping minimum energy utilization. This paper focuses on analyzing the scheduling methods that can minimize the energy consumption. The round robin, FCFS and Priority based scheduling algorithms focuses on distributing the jobs in evenly manner, which in turn reduces the energy consumption. But they reduce energy consumption to some extent, so crossbreed algorithm has been developed in this work to minimize the energy consumption. The result shows that Crossbreed algorithm conserves more energy in comparison to individual scheduling algorithms.

关键词： Cloud computing scheduling algorithms Computational modeling Servers Central Processing Unit

来源：评论

学校读者我要写书评

暂无评论

BUNDLE: Real-Time Multi-threaded scheduling to Reduce Cache Contention

BUNDLE: Real-Time Multi-threaded Scheduling to Reduce Cache ...

引用

Real-Time Systems Symposium (RTSS)

作者： Corey Tessler Nathan Fisher Wayne State University

Research on hard real-time systems and their models has predominately focused upon single-threaded tasks. When multi-threaded tasks are introduced to the classical real-time model the individual threads are treated as distinct tasks, one for each thread. These artificial tasks often share the deadline, period, and worst case execution time of their parent task. In the presence of instruction and data caches this view is overly pessimistic, failing to account for the execution time benefit of cache hits when multiple threads of execution share a memory address *** work takes a new perspective on instruction caches. Treating the cache as a benefit to schedulability for a single task with m threads. To realize the "inter-thread cache benefit" a new scheduling algorithm, BUNDLE, and accompanying method for calculating the worst-case execution time (WCET) including cache overhead (WCET+O) method are proposed. BUNDLE permits threads to execute across conflict free regions, and blocks those threads that would create an unnecessary cache conflict. The WCET bound is determined for the entire set of m threads, rather than treating each thread as a distinct task. Both the scheduler and WCET+O method rely on the calculation of conflict free regions which are found by a static analysis method of the task object. By virtue of this perspective the system's total execution execution time is reduced and is reflected in a tighter WCET+O bound compared to the techniques applied to the classical model. Obtaining this tighter bound requires the integration of three typically independent areas: WCET, schedulability, and cache-related preemption delay analysis.

关键词： Instruction sets Analytical models scheduling algorithms Real-time systems Algorithm design and analysis Timing Schedules

来源：评论

学校读者我要写书评

暂无评论

Multi-Resource Partial-Ordered Task scheduling in cloud computing

Multi-Resource Partial-Ordered Task Scheduling in cloud comp...

引用

International Workshop on Quality of Service

作者： Chaokun Zhang Yong Cui Rong Zheng Jinlong E Jianping Wu Tsinghua University Beijing P. R. China McMaster University Hamilton ON Canada

In this paper, we investigate the scheduling problem with multi-resource allocation in cloud computing environments. In contrast to existing work that focuses on flow-level scheduling, which treats flows in isolation, we consider dependency among subtasks of applications that imposes a partial order relationship in execution. We formulate the problem of Multi-Resource Partial-Ordered Task scheduling (MR-POTS) to minimize the makespan. In the first stage, the proposed Dominant Resource Priority (DRP) algorithm decides the collection of subtasks for resource allocation by taking into account the partial order relationship and characteristics of subtasks. In the second stage, the proposed Maximum Utilization Allocation (MUA) algorithm partitions multiple resources among selected subtasks with the objective to maximize the overall utilization. Both theoretical analysis and experimental evaluation demonstrate the proposed algorithms can approximately achieve the minimal makespan with high resource utilization. Specifically, a reduction of 50% in makespan can be achieved compared with existing scheduling schemes.

关键词： Resource management Algorithm design and analysis Cloud computing Partitioning algorithms scheduling algorithms Optimal scheduling

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：