Computing and Information Systems - Research Publications
Permanent URI for this collection
Search Results
1 - 10 of 18
-
ItemA Taxonomy of CDNs(SPRINGER, 2008-01-01)
-
ItemDecentralized overlay for federation of enterprise clouds(IGI Global, 2009-12-01)This chapter describes Aneka-Federation, a decentralized and distributed system that combines enterprise Clouds, overlay networking, and structured peer-to-peer techniques to create scalable wide-area networking of compute nodes for high-throughput computing. The Aneka-Federation integrates numerous small scale Aneka Enterprise Cloud services and nodes that are distributed over multiple control and enterprise domains as parts of a single coordinated resource leasing abstraction. The system is designed with the aim of making distributed enterprise Cloud resource integration and application programming flexible, efficient, and scalable. The system is engineered such that it: enables seamless integration of existing Aneka Enterprise Clouds as part of single wide-area resource leasing federation; self-organizes the system components based on a structured peer-to-peer routing methodology; and presents end-users with a distributed application composition environment that can support variety of programming and execution models. This chapter describes the design and implementation of a novel, extensible and decentralized peer-to-peer technique that helps to discover, connect and provision the services of Aneka Enterprise Clouds among the users who can use different programming models to compose their applications. Evaluations of the system with applications that are programmed using the Task and Thread execution models on top of an overlay of Aneka Enterprise Clouds have been described here.
-
ItemScheduling parallel applications on Utility Grids: Time and cost trade-off management(Australian Computer Society, 2009-12-01)
-
ItemWorkflow Scheduling Algorithms for Grid Computing(SPRINGER-VERLAG BERLIN, 2008-01-01)
-
ItemScheduling parameter sweep applications on global Grids: A deadline and budget constrained cost-time optimization algorithm(Wiley, 2005)Computational Grids and peer-to-peer (P2P) networks enable the sharing, selection, and aggregation of geographically distributed resources for solving large-scale problems in science, engineering, and commerce. The management and composition of resources and services for scheduling applications, however, becomes a complex undertaking. We have proposed a computational economy framework for regulating the supply of and demand for resources and allocating them for applications based on the users' quality-of-service requirements. The framework requires economy-driven deadline- and budget-constrained (DBC) scheduling algorithms for allocating resources to application jobs in such a way that the users' requirements are met. In this paper, we propose a new scheduling algorithm, called the DBC cost-time optimization scheduling algorithm, that aims not only to optimize cost, but also time when possible. The performance of the cost-time optimization scheduling algorithm has been evaluated through extensive simulation and empirical studies for deploying parameter sweep applications on global Grids.
-
ItemAn SCP-based heuristic approach for scheduling distributed data-intensive applications on global grids(ACADEMIC PRESS INC ELSEVIER SCIENCE, 2008-04-01)
-
ItemA heuristic for mapping virtual machines and links in emulation testbeds(IEEE, 2009-12-01)
-
ItemDependable workflow scheduling in global grids(IEEE, 2009-12-01)
-
ItemCost of Virtual Machine Live Migration in Clouds: A Performance Evaluation(SPRINGER-VERLAG BERLIN, 2009-01-01)Virtualization has become commonplace in modern data centers, often referred as "computing clouds". The capability of virtual machine live migration brings benefits such as improved performance, manageability and fault tolerance, while allowing workload movement with a short service downtime. However, service levels of applications are likely to be negatively affected during a live migration. For this reason, a better understanding of its effects on system performance is desirable. In this paper, we evaluate the effects of live migration of virtual machines on the performance of applications running inside Xen VMs. Results show that, in most cases, migration overhead is acceptable but cannot be disregarded, especially in systems where availability and responsiveness are governed by strict Service Level Agreements. Despite that, there is a high potential for live migration applicability in data centers serving modernInternet applications. Our results are based on a workload covering the domain of multi-tier Web 2.0 applications.
-
Item