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

international Conference on P2P, parallel, Grid, Cloud and Internet Computing (3PGCIC)

作者： Joanna Kołodziej Fatos Xhafa Department of Mathematics and Computer Science University of Bielsko-Biała Bielsko-Biala Poland Department of Languages and Informatics Systems Technical University of Catalonia Barcelona Spain

In traditional distributed computing systems a few user types are found having rather "flat" profiles, mainly due to the same administrative domain the users belong to. This is quite different in Computational Grids (CGs) in which several user types should co-exist and make use of resources according to hierarchical nature and the presence of the multiple administrative domains. One implication of the existence of different hierarchical levels in CGs is that it imposes different access and usage policies on resources. In this paper we firstly highlight the most common Grid users types and their relationships and access scenarios in CGs corresponded to old (e.g. performance) and new (e.g security) requirements. Then, we identify and analyze new features arising in users' behavior in Grid scheduling, such as dynamic, selfish, cooperative, trustful, symmetric and asymmetric behaviors. We discuss also how computational economy-based approaches, such as market mechanisms, and computational paradigms, such as Neural Networks, can be used to model user requirements and predict users' behaviors in CGs. As a result of this study we have provided a comprehensive analysis of Grid user scenarios than can serve as a basis for application designers in CGs.

关键词： Biological system modeling Authentication Computational modeling Games resource management Monitoring

来源：评论

学校读者我要写书评

暂无评论

Dynamic workload balancing of parallel applications with user-level scheduling on the Grid

引用

FUTURE GENERATION COMPUTER systems-THE international JOURNAL OF ESCIENCE 2009年第1期25卷 28-34页

作者： Korkhov, Vladimir V. Moscicki, JakubT. Krzhizhanovskaya, Valeria V. Univ Amsterdam Sect Computat Sci NL-1098 SJ Amsterdam Netherlands CERN CH-1211 Geneva 23 Switzerland St Petersburg State Polytech Univ St Petersburg Russia

This paper suggests a hybrid resource management approach for efficient parallel distributed computing on the Grid. It operates on both application and system levels, combining user-level job scheduling with dynamic workload balancing algorithm that automatically adapts a parallel application to the heterogeneous resources, based on the actual resource parameters and estimated requirements of the application. The hybrid environment and the algorithm for automated load balancing are described, the influence of resource heterogeneity level is measured, and the speedup achieved with this technique is demonstrated for different types of applications and resources. (c) 2008 Elsevier B.V. All rights reserved.

关键词： Dynamic load balancing resource management User-level scheduling High-performance computing Grid Heterogeneous resources parallel distributed application

来源：评论

学校读者我要写书评

暂无评论

An efficient adaptive scheduling policy for high-performance computing

引用

FUTURE GENERATION COMPUTER systems-THE international JOURNAL OF ESCIENCE 2009年第3期25卷 364-370页

作者： Abawajy, J. H. Deakin Univ Sch Informat Technol & Engn Geelong Vic 3217 Australia

The advent of commodity-based high-performance clusters has raised parallel and distributed computing to a new level. However, in order to achieve the best possible performance improvements for large-scale computing problems as well as good resource utilization, efficient resource management and scheduling is required. This paper proposes a new two-level adaptive space-sharing scheduling policy for non-dedicated heterogeneous commodity-based high-performance clusters. Using trace-driven simulation, the performance of the proposed scheduling policy is compared with existing adaptive space-sharing policies. Results of the simulation show that the proposed policy performs substantially better than the existing policies. (C) 2006 Elsevier B.V. All rights reserved.

关键词： distributed systems Commodity cluster computing Space-sharing Job scheduling Heterogeneous systems Performance analysis

来源：评论

学校读者我要写书评

暂无评论

Radio resource management for the UMTS enhanced uplink in presence of QoS radio bearers

引用

ANNALS OF OPERATIONS RESEARCH 2009年第1期170卷 183-197页

作者： Maeder, Andreas Staehle, Dirk Univ Wurzburg Dept Distributed Syst D-97074 Wurzburg Germany

The next step in the evolution of UMTS is the Enhanced Uplink or high speed uplink packet access (HSUPA), which is designed for the efficient transport of packet switched data. We propose an analytic modeling approach for the performance evaluation of the UMTS uplink with best-effort users over the enhanced uplink and QoS-users over dedicated channels. The model considers two different scheduling disciplines for the enhanced uplink: parallel scheduling and one-by-one scheduling. resource management in such a system has to consider the requirements of the dedicated channel users and the enhanced uplink users on the shared resource, i.e. the cell load. We evaluate the impact of two resource management strategies, one with preemption for dedicated channels and one without, on key QoS-indicators like blocking and dropping probabilities as well as user and cell throughput.

关键词： WCDMA UMTS Enhanced uplink HSUPA Radio resource management Performance modeling Radio network planning

来源：评论

学校读者我要写书评

暂无评论

The Owner Share scheduler for a distributed system

The Owner Share scheduler for a distributed system

引用

38th international Conference on parallel Processing

作者： Falavinha Junior, Jose Nelson Manacero Junior, Aleardo Livny, Miron Bradley, Daniel Sao Paulo State Univ UNESP Dept Elect Engn Sao Paulo Brazil Sao Paulo State Univ UNESP Dept Comp Sci Sao Paulo Brazil Univ Wisconsin Dept Comp Sci Madison WI USA

ISBN: (纸本)9781424449231

In large distributed systems, where shared resources are owned by distinct entities, there is a need to reflect resource ownership in resource allocation. An appropriate resource management system should guarantee that resource's owners have access to a share of resources proportional to the share they provide. In order to achieve that some policies can be used for revoking access to resources currently used by other users. In this paper, a scheduling policy based in the concept of distributed ownership is introduced called Owner Share Enforcement Policy (OSEP). OSEP goal is to guarantee that owner do not have their jobs postponed for longer periods of time. We evaluate the results achieved with the application of this policy using metrics that describe policy violation, loss of capacity, policy cost and user satisfaction in environments with and without job checkpointing. We also evaluate and compare the OSEP policy with the Fair-Share policy, and from these results it is possible to capture the trade-offs from different ways to achieve fairness based on the user satisfaction.

关键词： scheduling Algorithms Fair scheduling Distribute systems Ownership concept

来源：评论

学校读者我要写书评

暂无评论

Job scheduling Strategies for parallel Processing - 14th international workshop, JSSPP 2009, Revised Papers

Job Scheduling Strategies for Parallel Processing - 14th Int...

引用

14th international workshop on Job scheduling Strategies for parallel Processing, JSSPP 2009, in conjunction with the IEEE international parallel Processing Symposium 2009

ISBN: (纸本)3642046320

The proceedings contain 15 papers. The topics discussed include: dynamic resource-critical workflow scheduling in heterogeneous environments;decentralized grid scheduling with evolutionary fuzzy systems;analyzing the EGEE production grid workload: application to jobs submission optimization;the resource usage aware backfilling;the gain of overbooking;modeling parallel system workloads with temporal locality;scheduling restartable jobs with short test runs;effects of topology-aware allocation policies on scheduling performance;contention-aware scheduling with task duplication;job admission and resource allocation in distributed streaming systems;scalability analysis of job scheduling using virtual nodes;competitive two-level adaptive scheduling using resource augmentation;and job scheduling with lookahead group matchmaking for time/space sharing on multi-core parallel machines.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Core-aware Memory Access scheduling Schemes

Core-aware Memory Access Scheduling Schemes

引用

23rd IEEE international parallel and distributed Processing Symposium

作者： Fang, Zhibin Sun, Xian-He Chen, Yong Byna, Surendra IIT Dept Comp Sci Chicago IL 60616 USA

ISBN: (纸本)9781424437511

Multi-core processors have changed the conventional hardware structure and require a rethinking of system scheduling and resource management to utilize them efficiently. However, current multi-core systems are still using conventional single-core memory scheduling. In this study, we investigate and evaluate traditional memory access scheduling techniques, and propose a core-aware memory scheduling for multi-core environments. Since memory requests from the same source exhibit better locality, it is reasonable to schedule the requests by taking the source of the requests into consideration. Motivated from this principle of locality, we propose two core-aware policies based on traditional bank-first and row-first schemes. Simulation results show that the core-aware policies can effectively improve the performance. Compared with the bank-first and row-first policies, the proposed core-aware policies reduce the execution time of certain NAS parallel Benchmarks by zip to 20% in running the benchmarks separately, and by 11% in running them concurrently.

关键词： scheduling

来源：评论

学校读者我要写书评

暂无评论

Job Admission and resource Allocation in distributed Streaming systems

Job Admission and Resource Allocation in Distributed Streami...

引用

14th international workshop on Job scheduling Strategies for parallel Processing

作者： Wolf, Joel Bansal, Nikhil Hildrum, Kirsten Parekh, Sujay Rajan, Deepak Wagle, Rohit Wu, Kun-Lung IBM Corp TJ Watson Res Ctr Hawthorne NY 10532 USA

ISBN: (纸本)9783642046322

This paper describes a new and novel scheme for job admission and resource allocation employed by the SODA scheduler in System, S. Capable of processing enormous quantities of streaming data, System S is a large-scale, distributed stream processing system designed to handle complex applications. Tire problem of scheduling in distributed, stream-based systems is quite unlike that in more traditional systems. And the requirements for System S, in particular, are more stringent than one might expect even in a "standard" stream-based design. For example, in System S, the offered load is expected to vastly exceed system capacity. So a careful job admission scheme is essential. The jobs ill System. S are essentially directed graphs, with software "processing elements" (PEs) as vertices and data streams as edges connecting the PEs. The jobs themselves are often heavily interconnected. Thus resource allocation of individual PEs must be done carefully in order to balance the flow. We describe the design of the SODA scheduler, with particular emphasis on fire component, known as macroQ, which performs the job admission and resource allocation tasks. We demonstrate by experiments the natural trade-offs between job admission and resource allocation.

关键词： resource allocation

来源：评论

学校读者我要写书评

暂无评论

Efficient Master/Worker parallel Discrete Event Simulation 09

Efficient Master/Worker Parallel Discrete Event Simulation

引用

23rd international workshop on Principles of Advanced and distributed Simulation

作者： Park, Alfred Fujimoto, Richard M. Georgia Inst Technol Computat Sci & Engn Div Atlanta GA 30332 USA

ISBN: (纸本)9780769537139

The master/worker (MW) paradigm can be used to implement parallel discrete event simulations (PDES) on metacomputing systems. MW PDES applications incur overheads not found in conventional PDES executions executing on tightly coupled machines. We introduce four techniques for reducing these overheads on public resource and desktop grid infrastructures Work unit caching, pipelined state updates, expedited message delivery, and adaptive work unit scheduling mechanisms are described that provide significant reduction in overall overhead when used in tandem. We present performance results showing that an optimized MW PDES system can exhibit performance comparable to a traditional PDES system for a queueing network and a particle physics simulation.

关键词： parallel discrete event simulation conservative synchronization caching PDES metacomputing volunteer computing grid computing simulation desktop grids Master/worker

来源：评论

学校读者我要写书评

暂无评论

Research on the key technologies of simulation grid resource scheduling based on machine learning

Research on the key technologies of simulation grid resource...

引用

2009 international workshop on Intelligent systems and Applications, ISA 2009

作者： Xu, Xiaoming Yan, Xuefeng Ding, Qiuling College of Information Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing 210016 China

ISBN: (纸本)9781424438945

According to characteristics of Simulation Grid resources(SGR), an extend Web Service Description Language (WSDL) was adopted to describe the attributes of SGRs, in order to facilitate the application of machine learning algorithms for SGR scheduling on a centralized-distributed SGR management model. By analyzing the specific requirements of distributed Interactive Simulation(DIS) task, a SGR scheduling model based on machine learning was proposed. Support Vector Machine (SVM) and incremental SVM were applied to implement SGRs classification when the features vectors were extracted from the WSDL documents. scheduling agents can then carried out the SGR scheduling on classified SGRs. Experiments showed that the scheduling model can get federation overall optimal result with better performance. © 2009 IEEE.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：