Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Distributed and parralall computing
Typology: Assignments
1 / 16
This page cannot be seen from the preview
Don't miss anything!
Submitted by: Ali Hassan Roll NO: 5314(708149) Semester: 7 th BSCS(Evening) Course Code: CSI-621 (Parallel & Distributed Computing) Submitted to: Mam Qoseen Zahra
Aurora: Scoped behavior and abstract data types Aurora is a distributed shared data (DSD) system based on a standard C++ class library and run-time system. As with related systems, it provides a shared data programming abstraction on distributed memory hardware. The system does not contain any language extensions and it does not require special hardware support. Instead, Aurora exploits language mechanisms for creating abstract data types.
The design, implementation, and evaluation of Aurora and scoped behavior Scoped behavior can provide per-object and per-context (i.e., specific portion of the source code) flexibility when applying data-sharing optimizations. In contrast to some other systems, Aurora programs can be incrementally tuned and only a minimum number of error-prone changes to the source code are required in order to experiment with different optimization strategies. Scoped behavior can be implemented without language extensions and without special compiler support. Scoped behavior's novel implementation framework can exploit both compile-time and run-time information about the parallel program. A parallel programming system based on a high-level shared-data abstraction can achieve high performance. In a performance evaluation of four applications implemented using three different types of parallel programming systems, Aurora usually matches or outperforms, sometimes by a wide margin, Tread Marks (a distributed shared memory system) and a message-passing system (either MPICH or PVM, depending on the application).
Integrating Bulk-Data Transfer into the Aurora Distributed Shared Data System The Aurora distributed shared data system implements a shared-data abstraction on distributed-memory platforms, such as clusters, using abstract data types. Aurora programs are written in C++ and instantiate shared-data objects whose data-sharing behavior can be optimized using a novel technique called scoped behavior. Each object and each phase of the computation (i.e., use-context) can be independently optimized with per-object and per-context flexibility. Within the scoped behavior framework, optimizations such as bulk-data transfer can be implemented and made available to the application programmer. Scoped behavior carries semantic information regarding the specific data-sharing pattern through various layers of software. We describe how the optimizations are integrated from the uppermost application-programmer layers down to the lowest UDP-based layers of the Aurora system. A bulk-data transfer network protocol bypasses some bottlenecks associated with TCP/IP and achieves higher performance on an ATM network than either Tread Marks (distributed shared memory) or MPICH (message passing) for matrix multiplication and parallel sorting
Purpose of Process Templates The purpose of having process templates that address the various process concepts is to set out or describe how to organize and structure the viewpoints and process objects associated with the various disciplines and bring them together to create a common understanding. Standard process templates are important because they establish the elements of the artifacts, i.e., the relevant process objects to be addressed when the template is used.
PROCESS MAPS A process map is intended to be an accurate list and representation of a set of decomposed and/or composed process objects. The purpose of this map is to inventory and create a list of all processes in the enterprise. The content of a process map is based on which objects/elements can be related so the columns of the map conform to the semantic rules within the context in which they are being used. This list helps us to understand the breadth of functionality provided by each of the processes. It will also provide a centralized and official overview and record of the key processes in the enterprise, each situated within the specific process area and process group in which it participates as well as linking in the channel, stakeholder, owner, and role/ resource (including the manager) involved.
PROCESS MATRIX Process matrices show the relationship between two specific sets of decomposed (broken down) objects in a process-centric context. The core idea of the process matrices is that they each consist of a set of process objects that semantically have primary and therefore direct natural relations to each other. The result is that these are always in the form of two lists (a row and a column) in which the process objects with which they share a relationship are each rated according to them within the body of the matrix. Within the process matrix, this allows one to relate the unfamiliar to the familiar, thus connecting process objects in the different layers (composition).
7. Connect performance indictors to processes 8. Improve the operating model 9. Reduce process cost 10. Associate relevant rules to the processes 11. Identify and relate compliance aspects 12. Process automation 13. Process measurements and reporting as part of the organizational analytics and decision making 14. Service model improvement
Types of Artifact or templates
