scispace - formally typeset
Search or ask a question
Conference

Parallel and Distributed Processing Techniques and Applications 

About: Parallel and Distributed Processing Techniques and Applications is an academic conference. The conference publishes majorly in the area(s): Distributed algorithm & Shared memory. Over the lifetime, 1818 publications have been published by the conference receiving 10485 citations.


Papers
More filters
Proceedings Article
01 Jan 2010
TL;DR: In this paper, the authors present vision, challenges, and architectural elements for energy-efficient management of cloud computing environments, focusing on the development of dynamic resource provisioning and allocation algorithms that consider the synergy between various data center infrastructures and holistically work to boost data center energy efficiency and performance.
Abstract: Cloud computing is offering utility-oriented IT services to users worldwide. Based on a pay-as-you-go model, it enables hosting of pervasive applications from consumer, scientific, and business domains. However, data centers hosting Cloud applications consume huge amounts of energy, contributing to high operational costs and carbon footprints to the environment. Therefore, we need Green Cloud computing solutions that can not only save energy for the environment but also reduce operational costs. This paper presents vision, challenges, and architectural elements for energy-efficient management of Cloud computing environments. We focus on the development of dynamic resource provisioning and allocation algorithms that consider the synergy between various data center infrastructures (i.e., the hardware, power units, cooling and software), and holistically work to boost data center energy efficiency and performance. In particular, this paper proposes (a) architectural principles for energy-efficient management of Clouds; (b) energy-efficient resource allocation policies and scheduling algorithms considering quality-of-service expectations, and devices power usage characteristics; and (c) a novel software technology for energy-efficient management of Clouds. We have validated our approach by conducting a set of rigorous performance evaluation study using the CloudSim toolkit. The results demonstrate that Cloud computing model has immense potential as it offers significant performance gains as regards to response time and cost saving under dynamic workload scenarios.

317 citations

Proceedings Article
01 Jan 2000
TL;DR: The motivations for grid computing, resource management architecture, Nimrod/G resource broker, computational economy, and GRACE infrastructure and its APIs are presented along with future work.
Abstract: The growing computational power requirements of grand challenge applications has promoted the need for linking highperformance computational resources distributed across multiple organisations. This is fueled by the availability of the Internet as a ubiquitous commodity communication media, low cost high-performance machines such as clusters across multiple organisations, and the rise of scientific problems of multi-organisational interest. The availability of expensive, special class of scientific instruments or devices and data sources in few organisations has increased the interest in offering a remote access to these resources. The recent popularity of coupling (local and remote) computational resources, special class of scientific instruments, and data sources across the Internet for solving problems has led to the emergence of a new platform called “Computational Grid”. This paper identifies the issues in resource management and scheduling driven by computational economy in the emerging grid computing context. They also apply to clusters of clusters environment (known as federated clusters or hyperclusters) formed by coupling multiple (geographically distributed) clusters located in the same or different organisations. We discuss our current work on the Nimrod/G resource broker, whose scheduling mechanism is driven by a user supplied application deadline and a resource access budget. However, current Grid access frameworks do not provide the dynamic resource trading services that are required to facilitate flexible application scheduling. In order to overcome this limitation, we have proposed an infrastructure called GRid Architecture for Computational Economy (GRACE). In this paper we present the motivations for grid computing, resource management architecture, Nimrod/G resource broker, computational economy, and GRACE infrastructure and its APIs along with future work.

276 citations

Proceedings Article
01 Jan 1999
TL;DR: The Monitoring and Checking (MaC) framework which assures the correctness of the current execution at run-time and two languages to specify monitoring scripts and requirements are presented.
Abstract: We describe the Monitoring and Checking (MaC) framework which assures the correctness of the current execution at run-time Monitoring is performed based on a formal specification of system requirements MaC bridges the gap between formal specification and verification, which ensures the correctness of a design rather than an implementation, and testing, which partially validates an implementation An important aspect of the framework is a clear separation between implementation-dependent description of monitored objects and high-level requirements specification Another salient feature is automatic instrumentation of executable code The paper presents an overview of the framework and two languages to specify monitoring scripts and requirements, and briefly explain our on-going prototype implementation Comments Postprint version Published in 1999 International Conference on Parallel and Distributed Processing Techniques and Applications PDPTA99, 1999, Volume 1, pages 279-287 Publisher URL: http://wwwinformatikuni-trierde/~ley/db/conf/pdpta/pdpta1999-1html This conference paper is available at ScholarlyCommons: http://repositoryupennedu/cis_papers/294 Runtime Assurance Based On Formal Speci cations I Lee, S Kannan, M Kim, O Sokolsky, and M Viswanathan Department of Computer and Information Science University of Pennsylvania Philadelphia, PA 19104

191 citations

Proceedings Article
01 Jan 2002
TL;DR: The superiority of this new scheduling algorithm, in achieving lower job completion time, is demonstrated by simulating the World-Wide Grid and scheduling task-farming applications for different deadline and budget scenarios using both this new and the cost optimisation scheduling algorithms.
Abstract: 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 and demand for resources and allocating them for applications based on the users’ quality of services 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 DBC cost-time optimisation, which extends the DBC cost-optimisation algorithm to optimise for time, keeping the cost of computation at the minimum. The superiority of this new scheduling algorithm, in achieving lower job completion time, is demonstrated by simulating the World-Wide Grid and scheduling taskfarming applications for different deadline and budget scenarios using both this new and the cost optimisation scheduling algorithms.

155 citations

Proceedings Article
01 Jan 1999
TL;DR: A fast MPEG video encryption algorithm called RVEA which encrypts selected sign bits of the DCT coeecients and motion vectors using secret key cryptography algorithms such as DES or IDEA is presented.
Abstract: We present a fast MPEG video encryption algorithm called RVEA which encrypts selected sign bits of the DCT coeecients and motion vectors using secret key cryptography algorithms such as DES or IDEA. RVEA features bounded computation time for any size of video frame and is robust to both plaintext and ciphertext attack. Since it adds a very small overhead to the MPEG video compression process, a software implementation is fast enough to meet the real-time requirement of MPEG video applications.

142 citations

Performance
Metrics
No. of papers from the Conference in previous years
YearPapers
20191
20183
20153
20136
20128
20115