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

international Symposium on parallel and distributed Processing (IPDPS)

作者： Fatos Xhafa Enrique Alba Bernabe Dorronsoro Department de Llenguatges i Sistemes Informàtics Universitat Poliltècnica de Catalunya Barcelona Spain Departmento de Lenguajes y Ciencias de la Computación E.T.S.I. Informática Malaga Spain

Computational grids are an important emerging paradigm for large-scale distributed computing. As grid systems become more wide-spread, techniques for efficiently exploiting the large amount of grid computing resources become increasingly indispensable. A key aspect in order to benefit from these resources is the scheduling of jobs to grid resources. Due to the complex nature of grid systems, the design of efficient grid schedulers becomes challenging since such schedulers have to be able to optimize many conflicting criteria in very short periods of time. In this work we exploit the capabilities of cellular memetic algorithms (cMAs) for obtaining efficient batch schedulers for grid systems. A careful design of the cMA methods and operators for the problem yielded to an efficient and robust implementation. Our experimental study, based on a known static benchmark for the problem, shows that this heuristic approach is able to deliver very high quality planning of jobs to grid nodes and thus it can be used to design efficient dynamic schedulers for real grid systems. Such dynamic schedulers can be obtained by running the cMA-based scheduler in batch mode for a very short time to schedule jobs arriving to the system since the last activation of the cMA scheduler.

关键词： scheduling algorithm Processor scheduling Grid computing Dynamic scheduling Job shop scheduling Large-scale systems Robustness resource management distributed computing Job design

来源：评论

学校读者我要写书评

暂无评论

Experimental Study of Virtual Machine Migration in Support of Reservation of Cluster resources

Experimental Study of Virtual Machine Migration in Support o...

引用

international workshop on Virtualization Technology in distributed Computing (VTDC)

作者： Ming Zhao Renato J. Figueiredo Advanced Computing and Information Systems Laboratory (ACIS) Electrical and Computer Engineering University of Florida USA

Virtual Machines are becoming increasingly valuable to resource consolidation and management, providing efficient and secure resource containers, along with desired application execution environments. This paper focuses on the VM-based resource reservation problem, that is, the reservations of CPU, memory and network resources for individual VM instances, as well as for VM clusters. In particular, it considers the scenario where one or several physical servers need to be vacated to start a cluster of VMs for dedicated execution of parallel jobs. VMs provide a primitive for transparently vacating workloads through migration; however, the process of migrating several VMs can be time-consuming and needs to be estimated. To achieve this goal, this paper seeks to provide a model that can characterize the VM migration process and predict its performance, based on a comprehensive experimental analysis. The results show that, given a certain VM's migration time, it is feasible to predict the time for a VM with other configurations, as well as the time for migrating a number of VMs. The paper also shows that migration of VMs in parallel results in shorter aggregate migration times, but with higher per-VM migration latencies. Experimental results also quantify the benefits of buffering the state of migrated VMs in main memory without committing to hard disks.

关键词： Virtual machining Voice mail Virtual manufacturing Environmental management resource management Containers Network servers Predictive models Performance analysis Aggregates

来源：评论

学校读者我要写书评

暂无评论

Improved genetic algorithm for scheduling divisible data grid application

Improved genetic algorithm for scheduling divisible data gri...

引用

IEEE international Conference on Telecommunications and Malaysia Communications (ICT-MICC)

作者： Monir Abduh Mohamed Othman Hamidah Ibrahim Shamala Subramaniam Universiti Putra Malaysia Malaysia

Data grid technology promises geographically distributed scientists to access and share physically distributed resources such as computing resources, networks, storages, and most importantly data collections for large scale data intensive problems. In many data grid applications, data can be decomposed into multiple independent sub datasets and distributed for parallel execution and analysis. In this paper, we exploit this property and propose an Improved genetic algorithm (IGA) for scheduling divisible data grid applications. A good heuristic approach used to generate the initial population. Experimental results show that the proposed IGA gives better performance compared to the genetic algorithm (GA).

关键词： Genetic algorithms Processor scheduling Grid computing Computer architecture resource management Computer networks distributed computing Physics computing Telecommunication computing Large-scale systems

来源：评论

学校读者我要写书评

暂无评论

A Dynamic Load Dispersion Algorithm for Load-Balancing in a Heterogeneous Grid System

A Dynamic Load Dispersion Algorithm for Load-Balancing in a ...

引用

Quality of Service, 2006 14th IEEE international workshop on;Princeton,NJ

作者： David Solomon Acker Sarvesh Kulkami Electrical and Computer Engineering Department Villanova University Villanova PA USA

The ever changing demands on computational resources has information systems managers looking for solutions that are more flexible. Using a "bigger box" that has more and faster processors and permanent storage or more random access memory (RAM) is not a viable solution as the system usage patterns vary. In order for a system to handle the peak load adequately, it will go underutilized much of the time. A grid based distributed system can solve this problem by allowing multiple independent jobs to run over a network of heterogeneous computers. Applications can be based on several parallel jobs, several sequential jobs, or a single job. Keeping the workload represented by these jobs balanced over the network of computers requires network-aware scheduling algorithms that are dynamic, transparent, scalable, and quick. We present such an algorithm that handles load-balancing of jobs submitted at any point in the grid. Our algorithm accommodates jobs with differing CPU and I/O requirements and load-balances them over varying grid loads and varying network latencies.

关键词： Heuristic algorithms Computer networks management information systems Information management resource management Random access memory Read-write memory distributed computing Grid computing Application software

来源：评论

学校读者我要写书评

暂无评论

New Results on the Performance Effects of Autocorrelated Flows in systems

New Results on the Performance Effects of Autocorrelated Flo...

引用

international Symposium on parallel and distributed Processing (IPDPS)

作者： Evgenia Smirni Qi Zhang Ningfang Mi Alma Riska Giuliano Casale Department of Computer Science College of William and Mary Williamsburg VA USA Seagate Research Interfaces and Architecture Pittsburgh PA USA

Temporal dependence within the workload of any computing or networking system has been widely recognized as a significant factor affecting performance. More specifically, burstiness, as a form of temporal dependency, is catastrophic for performance. We use the autocorrelation function in a workload flow to formalize burstiness and also to characterize temporal dependence within a flow. We present results from two application areas: load balancing in a homogeneous cluster environment and capacity planning in a multi-tiered e-commerce system. For the load balancing problem, we show that if autocorrelation exists in the arrival stream to the cluster, classic load balancing policies become ineffective and solutions that focus on "unbalancing" the load offer superior performance. For the case of multi-tiered systems, we show that if there is autocorrelation in the flows, we observe the surprising result that in spite of the fact that the bottleneck resource in the system is far from saturation and that the measured throughput and utilizations of other resources are also modest, user response times are very high. For multi-tired systems, this underutilization of resources falsely indicates that the system can sustain higher capacities. We present analysis of the above phenomena that aims at the development better scheduling policies under auto correlated flows.

关键词： Autocorrelation Random variables Load management Open systems System performance Capacity planning Queueing analysis Computer science Educational institutions Computer architecture

来源：评论

学校读者我要写书评

暂无评论

High Level Modelling and Design For a Microthreaded Scheduler to Support Microgrids

High Level Modelling and Design For a Microthreaded Schedule...

引用

ACS/IEEE international Conference on Computer systems and Applications

作者： Nabil Hasasneh Ian Bell Chris Jesshope Institute for Informatics University of Amsterdam Amsterdam Netherlands Engineering Department University of Hull Hull UK

Microgrid CMPs, that is based on microthreaded processors, use hardware scheduling and synchronisation and have structures to support this that are distributed, fully scalable and which can support hundreds of microthreads per processor and their associated microcontexts. The chip has locality in communication wherever possible, and supports a globally-asynchronous locally-synchronous (GALS) design approach, where all its global communications are asynchronous, creating independent clocking domains for each microthreaded processor. Each microthreaded processor has its own instruction window and local register file, both of which are fully scalable. Any remote access is fully decupled from the pipeline operations including memory. This paper introduces the microgrid CMP architecture model and discusses in general terms how our approach meets the challenges facing CMP architectures. It also summarizes microgrid CMP performance simulations published elsewhere and presents a local scheduler and the microthreaded in-order pipeline.

关键词： Processor scheduling Yarn Concurrent computing Pipelines Informatics Global communication Registers Microprocessors parallel processing resource management

来源：评论

学校读者我要写书评

暂无评论

Performance of Internet Services over the UMTS Enhanced Uplink

Performance of Internet Services over the UMTS Enhanced Upli...

引用

international Conference on Next Generation Mobile Applications, Services and Technologies (NGMAST)

作者： Andreas Mader Dirk Staehle Christian Gosswein Department of Distributed Systems Am Hubland University of Wuerzburg W??rzburg Germany University of Wuerzburg

The Enhanced Uplink or High Speed Uplink Packet Access (HSUPA) is designed to enable Internet applications in the uplink in UMTS networks. Its specification includes several new features which on the one hand increases throughput and decreases delay for the users, and on the other hand enables a better resource utilization on the network side. In this work, we explain the most prominent new features of the Enhanced Uplink and investigate their impact on the system and end-to-end performance with a special focus on different scheduling strategies. For the numerical results, a full-featured packet-level simulator has been implemented which enables the evaluation of UMTS networks with Rel. 99 users and Enhanced Uplink users in parallel.

关键词： Web and internet services 3G mobile communication Throughput Bit rate resource management Downlink Peer to peer computing Delay Traffic control Streaming media

来源：评论

学校读者我要写书评

暂无评论

Performance prediction and its use in parallel and distributed computing systems

引用

FUTURE GENERATION COMPUTER systems-THE international JOURNAL OF ESCIENCE 2006年第7期22卷 745-754页

作者： Jarvis, Stephen A. Spooner, Daniel P. Keung, Helene N. Lim Choi Cao, Junwei Saini, Subhash Nudd, Graham R. Univ Warwick Dept Comp Sci Warwick CV4 7AL England MIT Ctr Space Res Cambridge MA 02139 USA NASA Ames Res Ctr Moffett Field CA 94035 USA

Performance prediction is set to play a significant role in supportive middleware that is designed to manage workload on parallel and distributed computing systems. This middleware underpins the discovery of available resources, the identification of a task's requirements and the match-making, scheduling and staging that follow. This paper documents two prediction-based middleware services that address the implications of executing a particular workload on a given set of resources. These services are based on an established performance prediction system that is employed at both the local (intra-domain) and global (multi-domain) levels to provide dynamic workload steering. These additional facilities bring about significant performance improvements, the details of which are presented with regard to system- and user-level qualities of service. The middleware has been designed for the management of resources and distributed workload across multiple administrative boundaries, a requirement that is of central importance to grid computing. (C) 2006 Elsevier B.V. All rights reserved.

关键词： performance prediction resource management grid computing

来源：评论

学校读者我要写书评

暂无评论

A broker and job advertisement based grid scheduling framework

A broker and job advertisement based grid scheduling framewo...

引用

18th IASTED international Conference on parallel and distributed Computing and systems

作者： Thor, A. T. Zaruba, G. V. Levine, D. Univ Texas Arlington Dept Comp Sci & Engn Arlington TX 76019 USA

ISBN: (纸本)9780889866386

A computational grid is a distributed collection of computer and storage resources created and maintained to serve the needs of virtual organizations where users seek to harness geographically distributed computational and storage resources for large scale intensive problem solving purposes. However, effective resource management and job scheduling poses a challenge when constraints such as resource utilization, response time, and global and local cluster policies need to be taken into account, while dealing with potentially independent sources of jobs, computational, and storage resources. It must be ensured that after scheduling decisions are made they are still valid by the time a job is executed, as well as that all the necessary resources are still available. Another critical problem is the encouragement of individual local domains to compete amongst themselves to become more efficient when accepting jobs. This paper discusses several common problems that have plagued resource management and job scheduling. We propose an extension to resource management and scheduling which adopts the use of brokers with job advertisement, resource matching, and job propagation within a hierarchical grid environment.

关键词： bid based scheduling grid economy resource auctioning renegotiation and broker

来源：评论

学校读者我要写书评

暂无评论

Experiences with hierarchical request flow management for network-enabled server environments

引用

international JOURNAL OF HIGH PERFORMANCE COMPUTING APPLICATIONS 2006年第1期20卷 143-157页

作者： Dail, H Desprez, F INRIA Rhone Alpes Ecole Normale Super Lyon LIP Lyon France

The distributed Interactive Engineering Toolbox (DIET) is a toolbox for the construction of network-enabled server systems. DIET servers provide transparent access to compute resources;resources can be either a single, interactive machine where the DIET server runs each request directly on its host, or batch-managed systems where the DIET server manages request submission and completion notification. A distributed hierarchy of scheduling agents connects the servers and is responsible for selecting servers appropriate to each client request. DIET seeks scalability by distributing the scheduling process and by keeping resource information measurement and performance prediction at the server level. DIET has traditionally offered an on-line scheduling model whereby all requests are scheduled immediately or refused. This approach can overload interactive servers in high-load conditions and does not allow adaptation of the schedule to task or data dependences. In this paper we consider an alternative model based on active management of the flow of requests throughout the system. We have added support for (1) limiting the number of concurrent requests on interactive servers, (2) server and agent-level queues, and (3) window-based scheduling algorithms whereby the request release rate to servers can be controlled and some rearrangement of request to host mappings is possible. We present experiments demonstrating that these approaches can improve performance and that the overheads introduced are not significantly different from those of the standard DIET approach.

关键词： distributed scheduling scheduling heuristics on-line scheduling network enabled servers grid computing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：