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

Composition of a DIDS by integrating heterogeneous IDSs on grids

Composition of a DIDS by integrating heterogeneous IDSs on g...

4th International Workshop on Middleware for grid computing (MGC'06) held at the ACM/IFIP/USENIX International Middleware Conference

作者： Silva, Paulo F. Westphall, Carlos B. Westphall, Carla M. Assunçao, Marcos D. Network and Management Laboratory Department of Computer Science and Statistics Federal University of Santa Catarina Florianópolis Brazil Department of Computer Science and Software Engineering Grid Computing and Distributed Systems Laboratory University of Melbourne Vic. 3053 Australia

This paper considers the composition of a DIDS (distributed Intrusion Detection System) by integrating heterogeneous IDSs (Intrusion Detection systems). A grid middleware is used for this integration. In addition, an ... 详细信息

ISBN: (纸本)1595935819

关键词： grid computing

来源：评论

学校读者我要写书评

暂无评论

A SLA-oriented management of containers for hosting stateful web services

A SLA-oriented management of containers for hosting stateful...

引用

3rd IEEE International Conference on e-Science and grid computing

作者： Reich, Christoph Bubendorfer, Kris Banholzer, Matthias Buyya, Rajkumar Department of Computer Science Hochschule Furtwangen University Germany School of Mathematics Statistics and Computer Science Victoria University of Wellington New Zealand Grid Computing and Distributed Systems (GRIDS) Laboratory Department of Computer Science and Software Engineering University of Melbourne Australia

ISBN: (纸本)9780769530642

Service-Oriented Architectures provide integration of interoperability for independent and loosely coupled services. Web services and the associated new standards such as WSRF are frequently used to realise such Service-Oriented Architectures. In such systems, autonomic principles of self-configuration, self-optimisation, self-healing and self-adapting are desirable to ease management and improve robustness. In this paper we focus on the extension of the self management and autonomic behaviour of a WSRF container connected by a structured P2P overlay network to monitor and rectify its QoS to satisfy its SLAs. The SLA plays an important role during two distinct phases in the life-cycle of a WSRF container Firstly during service deployment when services are assigned to containers in such a way as to minimise the threat of SLA violations, and secondly during maintenance when violations are detected and services are migrated to other containers to preserve QoS. In addition, as the architecture has been designed and built using standardised modem technologies and with high levels of transparency, conventional web services can be deployed with the addition of a SLA specification.

关键词： Containers

来源：评论

学校读者我要写书评

暂无评论

The grid economy

The grid economy

引用

作者： Buyya, Rajkumar Abramson, David Venugopal, Srikumar Grid Computing and Distributed Systems Laboratory Department of Computer Science and Software Engineering University of Melbourne Vic. 3010 Australia School of Computer Science and Software Engineering Monash University Vic. 3163 Australia

This paper identifies challenges in managing resources in a grid computing environment and proposes computational economy as a metaphor for effective management of resources and application scheduling. It identifies distributed resource management challenges and requirements of economy-based grid systems, and discusses various representative economy-based systems, both historical and emerging, for cooperative and competitive trading of resources such as CPU cycles, storage, and network bandwidth. It presents an extensible, service-oriented grid architecture driven by grid economy and an approach for its realization by leveraging various existing grid technologies. It also presents commodity and auction models for resource allocation. The use of commodity economy model for resource management and application scheduling in both computational and data grids is also presented. © 2005 IEEE.

关键词： Computational methods

来源：评论

学校读者我要写书评

暂无评论

Message from the chair of IEEE technical committee on scalable computing

Proceedings - IEEE International Conference on Cluster Compu...

引用

Proceedings - IEEE International Conference on Cluster computing, ICCC 2006年

作者： Buyya, Rajkumar IEEE Technical Committee on Scalable Computing Grid Computing and Distributed Systems Laboratory Dept. of Computer Science and Software Engineering University of Melbourne Australia

No abstract available

ISBN: (纸本)1424403286

No abstract available

关键词：

来源：评论

学校读者我要写书评

暂无评论

Message from the chair of IEEE Technical Committee on Scalable computing

Proceedings - IEEE/ACM International Workshop on Grid Comput...

引用

Proceedings - IEEE/ACM International Workshop on grid computing 2006年

No abstract available

ISBN: (纸本)1424403448

No abstract available

关键词：

来源：评论

学校读者我要写书评

暂无评论

Rescheduling co-allocation requests based on flexible advance reservations and processor remapping

Rescheduling co-allocation requests based on flexible advanc...

引用

International Workshop on grid computing

作者： Marco A. S. Netto Rajkumar Buyya Grid Computing and Distributed Systems Laboratory Department of Computer Science and Software Engineering University of Melbourne Australia

Large-scale computing environments, such as Teragrid, distributed ASCI Supercomputer (DAS), and gridpsila5000, have been using resource co-allocation to execute applications on multiple sites. Their schedulers work with requests that contain imprecise estimations provided by users. This lack of accuracy generates fragments inside the scheduling queues that can be filled by rescheduling both local and multi-site requests. Current resource co-allocation solutions rely on advance reservations to ensure that users can access all the resources at the same time. These coallocation requests cannot be rescheduled if they are based on rigid advance reservations. In this work, we investigate the impact of rescheduling co-allocation requests based on flexible advance reservations and processor remapping. The metascheduler can modify the start time of each job component and remap the number of processors they use in each site. The experimental results show that local jobs may not fill all the fragments in the scheduling queues and hence rescheduling co-allocation requests reduces response time of both local and multi-site jobs. Moreover, we have observed in some scenarios that processor remapping increases the chances of placing the tasks of multi-site jobs into a single cluster, thus eliminating the inter-cluster network overhead.

关键词： Time factors Estimation Runtime Schedules Resource management Processor scheduling Supercomputers

来源：评论

学校读者我要写书评

暂无评论

ANCAEE: A Novel Clustering Algorithm for Energy Efficiency in Wireless Sensor Networks

引用

Wireless Sensor Network 2011年第9期3卷 307-312页

作者： A. P. Abidoye N. A. Azeez A. O. Adesina K. K. Agbele Wireless Sensor Networks & Natural Language Research Group Grid Computing & Distributed Systems Laboratory Department of Computer Science University of the Western Cape

One of the major constraints of wireless sensor networks is limited energy available to sensor nodes because of the small size of the batteries they use as source of power. Clustering is one of the routing techniques that have been using to minimize sensor nodes’ energy consumption during operation. In this paper, A Novel Clustering Algorithm for Energy Efficiency in Wireless Sensor Networks (ANCAEE) has been proposed. The algorithm achieves good performance in terms of minimizing energy consumption during data transmission and energy consumptions are distributed uniformly among all nodes. ANCAEE uses a new method of clusters formation and election of cluster heads. The algorithm ensures that a node transmits its data to the cluster head with a single hop transmission and cluster heads forward their data to the base station with multi-hop transmissions. Simulation results show that our approach consumes less energy and effectively extends network utilization.

关键词： Sensor Nodes Clusters Cluster heads Wireless Sensor Networks Base Station Clustering Algorithms Energy Efficiency

来源：评论

学校读者我要写书评

暂无评论

Offer-based scheduling of deadline-constrained Bag-of-Tasks applications for utility computing systems

Offer-based scheduling of deadline-constrained Bag-of-Tasks ...

引用

International Symposium on Parallel and distributed Processing (IPDPS)

作者： Marco A. S. Netto Rajkumar Buyya Grid Computing and Distributed Systems Laboratory Department of Computer Science and Software Engineering University of Melbourne Australia

Metaschedulers can distribute parts of a bag-of-tasks (BoT) application among various resource providers in order to speed up its execution. When providers cannot disclose private information such as their load and computing power, which are usually heterogeneous, the metascheduler needs to make blind scheduling decisions. We propose three policies for composing resource offers to schedule deadline-constrained BoT applications. Offers act as a mechanism in which resource providers expose their interest in executing an entire BoT or only part of it without revealing their load and total computing power. We also evaluate the amount of information resource providers need to expose to the metascheduler and its impact on the scheduling. Our main findings are: (i) offer-based scheduling produces less delay for jobs that cannot meet deadlines in comparison to scheduling based on load availability (i.e. free time slots); thus it is possible to keep providers' load private when scheduling multi-site BoTs; and (ii) if providers publish their total computing power they can have more local jobs meeting deadlines.

关键词： Processor scheduling Computer applications Job shop scheduling grid computing Cloud computing Application software Information resources Delay Biological system modeling Message passing

来源：评论

学校读者我要写书评

暂无评论

A Meta-scheduler with Auction Based Resource Allocation for Global grids

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

引用

International Conference on Parallel and distributed systems (ICPADS)

作者： Saurabh Kumar Garg Srikumar Venugopal Rajkumar Buyya Grid Computing and Distributed Systems Laboratory Department of Computer Science and Software Engineering University of Melbourne Australia

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 userpsilas 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 userpsilas 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.

关键词： Resource management Processor scheduling Cost accounting grid computing Computational modeling Environmental economics Laboratories Computer science Software engineering Quality of service

来源：评论

学校读者我要写书评

暂无评论

Performance analysis of multiple site resource provisioning: effects of the precision of availability information 08

引用

Proceedings of the 15th international conference on High performance computing

作者： Marcos Dias De Assunção Rajkumar Buyya Grid Computing and Distributed Systems Laboratory Department of Computer Science and Software Engineering The University of Melbourne Australia and NICTA Victoria Research Laboratory The University of Melbourne Australia Grid Computing and Distributed Systems Laboratory Department of Computer Science and Software Engineering The University of Melbourne Australia

ISBN: (纸本)9783540898931

Emerging deadline-driven grid applications require a numberof computing resources to be available over a time frame, startingat a specific time in the future. To enable these applications, it is importantto predict the resource availability and utilise this informationduring provisioning because it affects their performance. It is impracticalto request the availability information upon the scheduling of everyjob due to communication overhead. However, existing work has notconsidered how the precision of availability information influences theprovisioning. As a result, limitations exist in developing advanced resourceprovisioning and scheduling mechanisms. This work investigateshow the precision of availability information affects resource provisioningin multiple site environments. Performance evaluation is conductedconsidering both multiple scheduling policies in resource providers andmultiple provisioning policies in brokers, while varying the precision ofavailability information. Experimental results show that it is possible toavoid requesting availability information for every grid job scheduledthus reducing the communication overhead. They also demonstrate thatmultiple resource partition policies improve the slowdown of grid jobs.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：