82 research outputs found
Integrating multiple clusters for compute-intensive applications
Multicluster grids provide one promising solution to satisfying the growing computational demands of compute-intensive applications. However, it is challenging to seamlessly integrate all participating clusters in different domains into a single virtual computational platform. In order to fully utilize the capabilities of multicluster grids, computer scientists need to deal with the issue of joining together participating autonomic systems practically and efficiently to execute grid-enabled applications. Driven by several compute-intensive applications, this theses develops a multicluster grid management toolkit called Pelecanus to bridge the gap between user\u27s needs and the system\u27s heterogeneity. Application scientists will be able to conduct very large-scale execution across multiclusters with transparent QoS assurance. A novel model called DA-TC (Dynamic Assignment with Task Containers) is developed and is integrated into Pelecanus. This model uses the concept of a task container that allows one to decouple resource allocation from resource binding. It employs static load balancing for task container distribution and dynamic load balancing for task assignment. The slowest resources become useful rather than be bottlenecks in this manner. A cluster abstraction is implemented, which not only provides various cluster information for the DA-TC execution model, but also can be used as a standalone toolkit to monitor and evaluate the clusters\u27 functionality and performance. The performance of the proposed DA-TC model is evaluated both theoretically and experimentally. Results demonstrate the importance of reducing queuing time in decreasing the total turnaround time for an application. Experiments were conducted to understand the performance of various aspects of the DA-TC model. Experiments showed that our model could significantly reduce turnaround time and increase resource utilization for our targeted application scenarios. Four applications are implemented as case studies to determine the applicability of the DA-TC model. In each case the turnaround time is greatly reduced, which demonstrates that the DA-TC model is efficient for assisting application scientists in conducting their research. In addition, virtual resources were integrated into the DA-TC model for application execution. Experiments show that the execution model proposed in this thesis can work seamlessly with multiple hybrid grid/cloud resources to achieve reduced turnaround time
04451 Abstracts Collection -- Future Generation Grids
The Dagstuhl Seminar 04451 "Future Generation Grid" was held in the International
Conference and Research Center (IBFI), Schloss Dagstuhl from 1st
to 5th November 2004. The focus of the seminar was on open problems and
future challenges in the design of next generation Grid systems. A total of 45
participants presented their current projects, research plans, and new ideas in
the area of Grid technologies. Several evening sessions with vivid discussions
on future trends complemented the talks. This report gives an overview of the
background and the findings of the seminar
Parallel processing DNA sequences on multicluster and grid architectures : Software overhead
A DNA sequence analysis parallelization in large databases using cluster, multi-cluster, and GRID is presented. Achievable speedup, scalability, and overhead introduced by communications are discussed, and the impact of the Grid middleware on the performance obtained with clusters is detailed. The experimental work carried out with homogeneous and heterogeneous clusters is presented, along with a comparison of the results obtained when migrating the algorithms to a GRID. Finally, current lines of work related to the study of models and paradigms for the resolution of parallel algorithms on GRID architectures are presented.Workshop de Procesamiento Distribuido y Paralelo (WPDP)Red de Universidades con Carreras en Informática (RedUNCI
Computer Science and Technology Series : XV Argentine Congress of Computer Science. Selected papers
CACIC'09 was the fifteenth Congress in the CACIC series. It was organized by the School of Engineering of the National University of Jujuy. The Congress included 9 Workshops with 130 accepted papers, 1 main Conference, 4 invited tutorials, different meetings related with Computer Science Education (Professors, PhD students, Curricula) and an International School with 5 courses. CACIC 2009 was organized following the traditional Congress format, with 9 Workshops covering a diversity of dimensions of Computer Science Research. Each topic was supervised by a committee of three chairs of different Universities.
The call for papers attracted a total of 267 submissions. An average of 2.7 review reports were collected for each paper, for a grand total of 720 review reports that involved about 300 different reviewers.
A total of 130 full papers were accepted and 20 of them were selected for this book.Red de Universidades con Carreras en Informática (RedUNCI
Decentralized SDN Control Plane for a Distributed Cloud-Edge Infrastructure: A Survey
International audienceToday’s emerging needs (Internet of Things applications, Network Function Virtualization services, Mobile Edge computing, etc.) are challenging the classic approach of deploying a few large data centers to provide cloud services. A massively distributed Cloud-Edge architecture could better fit these new trends’ requirements and constraints by deploying on-demand infrastructure services in Point-of-Presences within backbone networks. In this context, a key feature is establishing connectivity among several resource managers in charge of operating, each one a subset of the infrastructure. After explaining the networking management challenges related to distributed Cloud-Edge infrastructures, this article surveys and analyzes the characteristics and limitations of existing technologies in the Software Defined Network field that could be used to provide the intersite connectivity feature. We also introduce Kubernetes, the new de facto container orchestrator platform, and analyze its use in the proposed context. This survey is concluded by providing a discussion about some research directions in the field of SDN applied to distributed Cloud-Edge infrastructures’ management
Cooperative Data and Computation Partitioning for Decentralized Architectures.
Scalability of future wide-issue processor designs is severely hampered by the
use of centralized resources such as register files, memories and interconnect
networks. While the use of centralized resources eases both hardware design and
compiler code generation efforts, they can become performance bottlenecks as
access latencies increase with larger designs. The natural solution to this
problem is to adapt the architecture to use smaller, decentralized resources.
Decentralized architectures use smaller, faster components and exploit
distributed instruction-level parallelism across the resources. A multicluster
architecture is an example of such a decentralized processor, where subsets of
smaller register files, functional units, and memories are grouped together in a
tightly coupled unit, forming a cluster. These clusters can then be replicated
and connected together to form a scalable, high-performance architecture.
The main difficulty with decentralized architectures resides in compiler code
generation. In a centralized Very Long Instruction Word (VLIW) processor, the
compiler must statically schedule each operation to both a functional unit and a
time slot for execution. In contrast, for a decentralized multicluster VLIW,
the compiler must consider the additional effects of cluster assignment,
recognizing that communication between clusters will result in a delay penalty.
In addition, if the multicluster processor also has partitioned data memories,
the compiler has the additional task of assigning data objects to their
respective memories. Each decision, of cluster, functional unit, memory, and
time slot, are highly interrelated and can have dramatic effects on the best
choice for every other decision.
This dissertation addresses the issues of extracting and exploiting inherent
parallelism across decentralized resources through compiler analysis and code
generation techniques. First, a static analysis technique to partition data
objects is presented, which maps data objects to decentralized scratchpad
memories. Second, an alternative profile-guided technique for memory
partitioning is presented which can effectively map data access operations onto
distributed caches. Finally, a detailed, resource-aware partitioning algorithm
is presented which can effectively split computation operations of an
application across a set of processing elements. These partitioners work in
tandem to create a high-performance partition assignment of both memory and
computation operations for decentralized multicluster or multicore processors.Ph.D.Computer Science & EngineeringUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://deepblue.lib.umich.edu/bitstream/2027.42/57649/2/mchu_1.pd
- …