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

Single machine scheduling with job ready and delivery times subject to resource constraints

Single machine scheduling with job ready and delivery times ...

10th workshop on Advances in parallel and distributed Computational Models/22nd IEEE international parallel and distributed Processing Symposium

作者： Janiak, Wladyslaw Adam Janiak, Adam Portmann, Marie-Claude Wroclaw Univ Technol Fac Comp Sci & Management Lukasiewicza 5 PL-50371 Wroclaw Poland Wroclaw Univ Technol Inst Comp Engn Control & Robot PL-50372 Wroclaw Poland Ecole Mines F-54042 Nancy France

ISBN: (纸本)9781424416936

The paper deals with a single machine scheduling problem with job processing times dependent on continuously-divisible resource, e.g. gas, power, energy, raw materials, catalyzer financial outlay. Ready and delivery times are also given for each job. The problem is to find a schedule of jobs and resource allocation that minimize the time by which all jobs are delivered. Genetic approach, using some proved problem properties is constructed to solve the problem being strongly NP-hard. Analysis of some computational experiment and conclusion remarks are also given.

关键词： Problem solving

来源：评论

学校读者我要写书评

暂无评论

引用

9th IEEE/ACM international Conference on Grid Computing

作者： Kondo, Derrick Andrzejak, Artur Anderson, David P. INRIA Paris France ZIB Hamburg Germany Univ Calif Berkeley Berkeley CA USA

ISBN: (纸本)9781424425785

As computer networks rapidly increase in size and speed, Internet-distributed systems such as P2P, volunteer computing, and Grid systems are increasingly common. A precise and accurate characterization of Internet resources is important for the design and evaluation, of such Internet-distributed systems, yet our picture of the Internet landscape is not perfectly clear. To improve this picture, we measure and characterize the time dynamics of availability ire a large-scale Internet-distributed system with over 110,000 hosts. Our characterization focuses on identifying patterns of correlated availability. We determine scalable and accurate clustering techniques and distance metrics for automatically detecting significant availability patterns. By means of clustering, we identify groups of resources with correlated availability that exhibit similar time effects. Then, we show how these correlated clusters of resources can be used to improve resource management for parallel applications in the context of volunteer computing.

关键词： Availability Internet Distance measurement resource management Clustering algorithms Time measurement Dynamic scheduling

来源：评论

学校读者我要写书评

暂无评论

A Meta-scheduler with Auction Based resource Allocation for Global Grids

A Meta-scheduler with Auction Based Resource Allocation for ...

引用

14th international Conference on parallel and distributed systems

作者： Garg, Saurabh Kumar Venugopal, Srikumar Buyya, Rajkumar Univ Melbourne Dept Comp Sci & Software Engn Grid Comp & Distributed Syst Lab Melbourne Vic 3010 Australia

ISBN: (纸本)9780769534343

As users increasingly require better quality of service from Grids, resource management and scheduling mechanisms have to evolve in order to satisfy competing demands on limited resources. Traditional schedulers for Grids are system centric and favour system performance over increasing user's utility. On the other hand market oriented schedulers are price-based systems that favour users but are based solely on user valuations. This paper proposes a novel meta-scheduler that unifies the advantages of both the systems for benefiting both users and resources. In order to do that, we design a valuation metric for user's applications and computational resources based on multi-criteria requirements of users and resource load. The meta-scheduler maps user applications to suitable distributed resources using a Continuous Double Auction (CDA). Through simulation, we compare our scheduling mechanism against other common mechanisms used by current meta-schedulers. The results show that our meta-scheduler mechanism can satisfy more users than the others while still meeting traditional system-centric performance criteria such as average load and deadline of applications

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

Dynamic scheduling for Heterogeneous Desktop Grids 08

Dynamic Scheduling for Heterogeneous Desktop Grids

引用

9th IEEE/ACM international Conference on Grid Computing

作者： Al-Azzoni, Issam Down, Douglas G. McMaster Univ Dept Comp & Software Hamilton ON Canada

ISBN: (纸本)9781424425785

Desktop Grids have emerged as an important methodology to harness the idle cycles of millions of participant desktop PCs over the Internet. However, to effectively utilize the resources of a Desktop Grid, it is necessary to use scheduling policies suitable for such systems. A scheduling policy must be applicable to large-scale systems involving large numbers of machines. Also, the policy must be fault-aware in the sense that it copes with resource volatility. Further adding to the complexity of scheduling for Desktop Grids is the inherent heterogeneity of such systems. Suboptimal performance would result if the scheduling policy does not take into account information on heterogeneity. In this paper, we suggest and develop several scheduling policies for Desktop Grid systems involving different levels of heterogeneity. In particular, we propose a policy which utilizes the solution to a linear programming problem which maximizes system capacity. We consider parallel applications that consist of independent tasks.

关键词： Availability resource management Processor scheduling scheduling Dynamic scheduling Computational modeling Linear programming

来源：评论

学校读者我要写书评

暂无评论

Prospects of co-allocation strategies for a lightweight middleware in grid computing

Prospects of co-allocation strategies for a lightweight midd...

引用

20th IASTED international Conference on parallel and distributed Computing and systems, PDCS 2008

作者： Schley, Lars Robotics Research Institute Section Information Technology Dortmund University of Technology 44221 Dortmund Germany

ISBN: (纸本)9780889867741

Currently, middleware systems for Grid computing like gLite do not integrate knowledge about data availability into the scheduling process. That is, data may be on tertiary storage, e.g. hierarchical storage management, and first access is delayed. To this end, we investigate the gLite middleware software stack and highlight those services which could be enhanced to increase system utilization. Here, we focus on modifications of the workload management system and the computing element. As the computing element depends on a resource management system, we discuss the impact of file systems on the scheduling process. Optimizing the LHCb job workflow, we design a scheduling strategy which respects those constraints. Conceptually, this strategy performs a co-allocation of data movements concurrently to computational processes. Based on a workload trace from the parallel Workload Archive we are able to present improvements in terms of system utilization and average weighted response time.

关键词： Information management

来源：评论

学校读者我要写书评

暂无评论

Activity pre-scheduling for run-time optimization of grid workflows

引用

JOURNAL OF systems ARCHITECTURE 2008年第9期54卷 883-892页

作者： Tretola, Giancarlo Zimeo, Eugenio Univ Sannio Res Ctr Software Technol I-82100 Benevento Italy

The capability to support resource sharing between different organizations and high-level performance are noteworthy features of grid computing. Applications require significant design effort and complex coordination of resources to define, deploy and execute components on heterogeneous and often unknown resources. A common trend today aims at diffusing workflow management techniques to reduce the complexity of grid systems through model-driven approaches that significantly simplify application design through the composition of distributed services often belonging to different organizations. With this approach, the adoption of efficient workflow enactors becomes a key aspect to improve efficiency through run-time optimizations, so reducing the burden for the developer, who is only responsible of defining the functional aspects of complex applications since he/she has only to identify the activities that characterize the application and the causal relationships among them. This paper focuses on performance improvements of grid workflows by presenting a new pattern for workflow design that ensures activity pre-scheduling at run-time through a technique that generates fine-grained concurrency with a couple of concepts: asynchronous invocation of services and continuation of execution. The technique is implemented in a workflow enactment service that dynamically optimizes process execution with a very limited effort for application developer. (C) 2008 Elsevier B.V. All rights reserved.

关键词： grid computing grid workflow run-time optimization asynchronous invocation

来源：评论

学校读者我要写书评

暂无评论

Job scheduling Strategies for parallel Processing - 13th international workshop, JSSPP 2007, Revised Papers

引用

13th international workshop on Job scheduling Strategies for parallel Processing, JSSPP 2007

ISBN: (纸本)3540786988

The proceedings contain 10 papers. The topics discussed include: new challenges of parallel job scheduling;group-wise performance evaluation of processor co-allocation in multi-cluster systems;enhancing an open source resource manager with multi-core/multi-threaded support;a job self-scheduling policy for HPC infrastructures;QBETS: queue bounds estimation from time series;probabilistic backfilling;impact of reservations on production job scheduling;prospects of collaboration between compute providers by means of job interchange;GridARS: an advance reservation-based grid co-allocation framework for distributed computing and network resources;a self-optimized job scheduler for heterogeneous server cluster.

关键词： Job analysis

来源：评论

学校读者我要写书评

暂无评论

New challenges of parallel job scheduling

引用

13th international workshop on Job scheduling Strategies for parallel Processing, JSSPP 2007

作者： Frachtenberg, Eitan Schwiegelshohn, Uwe Powerset Inc. Robotics Research Institute University Dortmund Otto-Hahn-Strasse 8 Dortmund 44221 Germany

ISBN: (纸本)3540786988

The workshop on job scheduling strategies for parallel processing (JSSPP) studies the myriad aspects of managing resources on parallel and distributed computers. These studies typically focus on large-scale computing environments, where allocation and management of computing resources present numerous challenges. Traditionally, such systems consisted of massively parallel supercomputers, or more recently, large clusters of commodity processor nodes. These systems are characterized by architectures that are largely homogeneous and workloads that are dominated by both computation and communication-intensive applications. Indeed, the large majority of the articles in the first ten JSSPP workshops dealt with such systems and addressed issues such as queuing systems and supercomputer workloads. In this paper, we discuss some of the recent developments in parallel computing technologies that depart from this traditional domain of problems. In particular, we identify several recent and influential technologies that could have a significant impact on the future of research on parallel scheduling. We discuss some of the more specific research challenges that these technologies introduce to the JSSPP community, and propose to enhance the scope of future JSSPP workshops to include these topics. © 2008 Springer-Verlag Berlin Heidelberg.

关键词： Job analysis

来源：评论

学校读者我要写书评

暂无评论

Cooperative ad hoc computing: towards enabling cooperative processing in wireless environments

引用

international JOURNAL OF parallel EMERGENT AND distributed systems 2008年第1期23卷 59-79页

作者： Alsalih, Waleed Akl, Selim Hassanein, Hossam Queens Univ Sch Comp Kingston ON K7L 3N6 Canada

Mobile applications are becoming more popular as they provide the convenience of accessing services and information anywhere and at anytime. However, due to size and weight restrictions, mobile computing devices are limited in terms of battery energy and processing power. Running complex applications on resource-limited mobile computing devices is a real challenge. This paper proposes a cooperative paradigm for ad hoc computing in which a set of heterogeneous computing devices form a cooperative system on the fly, and whenever a resource-limited computing device in such a system has a resource-consuming application to be run, it uses resources of other devices to surmount the problem of resource limitation. To study the potential capability of this paradigm, we have designed energy-aware allocation and scheduling algorithms to make the most of all available resources in such a cooperative environment. These algorithms are static in the sense that they are based on discrete snapshots of the system topology. Although we consider these algorithms as preliminary work towards our objective of enabling cooperative computing, they have shown exciting results that encourage us to pursue our study. The main contributions of this paper are the novel allocation and scheduling algorithms which form a pioneering work towards enabling energy-aware cooperative processing in mobile computing environments.

关键词： Ad hoc computing Task scheduling Task allocation Wireless networks Energy management

来源：评论

学校读者我要写书评

暂无评论

Adaptive B-Greedy (ABG): A simple yet efficient scheduling algorithm

Adaptive B-Greedy (ABG): A simple yet efficient scheduling a...

引用

10th workshop on Advances in parallel and distributed Computational Models/22nd IEEE international parallel and distributed Processing Symposium

作者： Sun, Hongyang Hsu, Wen-Jing Nanyang Technol Univ Sch Comp Engn Singapore Singapore

ISBN: (纸本)9781424416936

In order to improve processor utilizations on parallel systems, adaptive scheduling with parallelism feedback was recently proposed. A-Greedy, an existing adaptive scheduler offers provably-good job execution time and processor utilization. Unfortunately, it suffers from unstable feedback and hence unnecessary processor reallocations even when the job has constant parallelism. This problem may cause difficulties in the management of system resources. We propose a new adaptive scheduler called ABG (for Adaptive B-Greedy), which ensures both performance and stability. In a direct comparison with A-Greedy using simulated data-parallel jobs, ABG shows an average 50% reduction in wasted processor cycles and an average 20% improvement in running time. For a set of jobs, ABG also outperforms A-Greedy by 10% to 15% on average in terms of both makespan and mean response time, provided the system is not heavily loaded. Our detailed analysis shows that ABG indeed offers improved transient and steady-state behaviors in terms of control-theoretic metrics. Using trim analysis, we show that ABG provides nearly linear speedup for individual jobs and good processor utilizations. Using competitive analysis, we also show that ABG offers good makespan and mean response time bounds.

关键词： Feedback

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：