This paper introduces invasive computing, a new paradigm for programming parallel architectures. The goals are to enable the development and execution of resource aware programs that can dynamically allocate and free ...
详细信息
ISBN:
(纸本)9780889868649
This paper introduces invasive computing, a new paradigm for programming parallel architectures. The goals are to enable the development and execution of resource aware programs that can dynamically allocate and free new resources in phases with more parallelism. To allocate more resources, applications use the invade operation and to free them the retreat. The research is conducted within the framework of the Transregional Collaborative Research Centre 89 funded by the German Science Foundation.
This paper proposes an optimization method of task-allocation for reducing contentions. There have been some attempts for optimizing task-allocation that minimizes the product of the amount of communications and the n...
详细信息
ISBN:
(纸本)9780889868649
This paper proposes an optimization method of task-allocation for reducing contentions. There have been some attempts for optimizing task-allocation that minimizes the product of the amount of communications and the number of the communication hops. However, since those methods do not consider the occurrence of contentions, the effect has not been sufficient. The method proposed in this paper uses information of concurrent communication to estimate the effect of contentions to find the optimal task-allocation. In three environments examined on the experiments, the proposed method has shown a better effect than the existing method on two environments, tree and fat tree. On these environments, the maximum gain of performance over the existing method was about 25%. On the other hand, on a mesh environment, IBM BlueGene/L, the existing method better effect than the proposed method. As one of the reasons for this, the influence of the packet priority on the network of BlueGene/L to the behavior of the proposed method is discussed.
The idea behind Cloud computing is to deliver Infrastructure-, Platform-, and Software as a Service (IaaS, PaaS, and SaaS) on a simple pay-per-use basis. In this paper, we introduce our work, OSGi Service Platform as ...
详细信息
ISBN:
(纸本)9780889868649
The idea behind Cloud computing is to deliver Infrastructure-, Platform-, and Software as a Service (IaaS, PaaS, and SaaS) on a simple pay-per-use basis. In this paper, we introduce our work, OSGi Service Platform as a Service (OSPaaS), a PaaS model for running an OSGi service platform in the cloud for e-Learning and teaching purposes. OSPaaS leverages OpenNebula, a virtual infrastructure manager, to dynamically launch virtual machines (VMs) on idle resources or dedicated servers. In addition, OSPaaS uses Shibboleth as a Single Sign-On mechanism for seamless authentication and authorization. To assess the suitability of OSGi for cloud computing, this paper investigates and analyzes three OSGi frameworks, i.e. Knopflerfish, Equinox and Apache Felix. Subsequently, an OSPaaS architecture is presented and described. Finally, this paper shows a use case scenario and advantages of OSPaaS for e-Learning & teaching purposes.
In recent years, the Service Oriented Architecture (SOA) has evolved itself into emerging technologies like cloud computing to give it more relevance. ANU-SOAM - a service oriented middleware - aims to provide conveni...
详细信息
ISBN:
(纸本)9780889868649
In recent years, the Service Oriented Architecture (SOA) has evolved itself into emerging technologies like cloud computing to give it more relevance. ANU-SOAM - a service oriented middleware - aims to provide convenient API, a unique data service extension and proper load-balancing techniques for high performance scientific computing. The data service extension offers both Common Data Service (CDS) and Local Data Service (LDS). CDS helps set data common to all service instances and to manipulate it using add, get, put, sync, etc. functions. The LDS allows consumer to partially replicate data among service instances to improve memory scalability. Comparable paradigms like MPI are mostly agnostic and non-responsive to heterogeneous conditions. The SOA approach enables ANU-SOAM to have load balancing techniques implemented with the help of a Resource Manager. Experiments using N Body Solver and Heat Transfer applications have shown that ANU-SOAM performs as good as most of its MPI counterparts, especially under heterogeneous conditions.
An efficient parallelization strategy is presented for a Hierarchical Run Length Encoded (HRLE) data structure, implemented for the Sparse Field Level Set method. In order to achieve high parallel efficiency, computat...
详细信息
ISBN:
(纸本)9780889868649
An efficient parallelization strategy is presented for a Hierarchical Run Length Encoded (HRLE) data structure, implemented for the Sparse Field Level Set method. In order to achieve high parallel efficiency, computational work must be distributed evenly over all available CPU threads. Since the Level Set surface must be allowed to deform and evolve, thereby increasing the simulation area, there must exist a way to increase the surface domain while keeping an efficient parallelization strategy in place. This is achieved by processing the same number of calculations across each available CPU. The addition of data to HRLE data structures is only permitted in a sequential or lexicographical order, making parallelization more complex. The presented solution uses as many HRLE data structures as there are CPUs available. Approximately 90% of operations can be performed in parallel when using the presented strategy, leading to an efficiency of up to 96% or 78.5% when using two or sixteen CPU cores of an AMD Opteron 8435 processor, clocked at 2.6GHz, respectively. Topographies with one and two moving interfaces were simulated using multi-threading, showing the speedup and efficiency for the presented strategy.
The simplex method has been successfully used in solving linear programming problems for many years. parallel approaches have also extensively been studied due to the intensive computatios required (especially for the...
详细信息
ISBN:
(纸本)9780889868649
The simplex method has been successfully used in solving linear programming problems for many years. parallel approaches have also extensively been studied due to the intensive computatios required (especially for the solution of large in size linear problems). In this paper we present a highly scaleable parallel implementation framework of the standard full tableau simplex method on a highly parallel (distributed memory) environment. Specifically, we have designed and implemented a column distribution scheme (similar to the one presented in [24]) as well as a row distribution scheme (similar to the one presented in [3]) and we have entirely tested our implementations over a considerably powerful parallel environment (a linux-cluster of eight powerful Xeon processors connected via a high speed Myrinet network interface). We then compare our approaches (a) among each other for variable number of problem size (number of rows and columns) and (b) to the corresponding ones of [3] and [24] which are two of the most recent and valuable corresponding efforts. In most cases the column distribution scheme performs quite/much better than the row distribution scheme. Moreover, both schemes (even the row distribution scheme over large scale problems) lead to particularly high speed-up and efficiency values, that are considerably better in all cases than the ones achieved by the corresponding implementations of [3] and [24].
The classification and selection of services within distributed, heterogeneous environments is a non trivial task. For a proper selection and composition of services in such environments - for example in a Grid or Clo...
详细信息
ISBN:
(纸本)9780889868649
The classification and selection of services within distributed, heterogeneous environments is a non trivial task. For a proper selection and composition of services in such environments - for example in a Grid or Cloud - it is required to dispose of detailed information about the existing resources and their characteristics. Particularly for applying appropriate optimization strategies these metadata are indispensable in order to decide which is the actual best resource for a given task, respectively query. It is thus a crucial task to first identify, classify and describe all system components and their attributes in a common language. Therefore a generic, high-level model of a service ontology is proposed, that exposes the fundamental building blocks of a distributed, service-oriented environment, by providing a structured collection of components and their functional and non-functional attributes. Finally, the applicability of the proposed ontology is verified by applying it to two distinct application scenarios, one from the domain of distributed Database Management Systems, and one from a High-Energy Physics experiment.
The L(2, 1)-labeling problem for a graph G is a variation of the standard graph coloring problem. Here, we seek to assign a label (color) to each node of G such that nodes a distance of two apart are assigned unique l...
详细信息
The L(2, 1)-labeling problem for a graph G is a variation of the standard graph coloring problem. Here, we seek to assign a label (color) to each node of G such that nodes a distance of two apart are assigned unique labels and adjacent nodes receive labels which are at least two apart. In a previous paper-presented at the 23rd iastedinternational Multi-conference: parallel and distributedcomputing and networks, Innsbruck, Austria-we presented, to the best of our knowledge, the first self-stabilizing algorithm which {Delta + 2}-L(2, 1)-labels rooted trees. That algorithm was shown to require an exponential number of moves to stabilize on a global solution (which is not uncommon in self-stabilizing systems). In this paper, we present two self-stabilizing algorithms which {Delta + 2}-L(2, 1)-label a given rooted tree T in only O(nh) moves (where h is the height and n is the number of nodes in the tree T) under a central scheduler. We also show how the algorithms may be adapted to unrooted trees, dynamic topology changes, and consider the correctness of the protocols under the distributed scheduler model.
For an initial study in divisible load scheduling, an optimal computing power allocation problem in a distributedparallelcomputing grid involving two sources and a sink is considered. The objective is to optimally a...
详细信息
ISBN:
(纸本)9780889868205
For an initial study in divisible load scheduling, an optimal computing power allocation problem in a distributedparallelcomputing grid involving two sources and a sink is considered. The objective is to optimally allocate the computing power of the sink in the grid in a such way that the total parallelcomputing finish time of the entire load is equalized to the sequential computing finish time while utilizing the full computing power. A numerical method to calculate the optimal adaptive computing power via a deterministic analysis is presented under several computing constraints. Performance of the computing power adaptation is modeled and evaluated. For performance evaluation, we define average computing finish time.
As high-performance computing (HPC) systems continue to increase in scale, their mean-time to interrupt decreases respectively. The current state of practice for fault tolerance (FT) is checkpoint/restart. However, wi...
详细信息
ISBN:
(纸本)9780889868205
As high-performance computing (HPC) systems continue to increase in scale, their mean-time to interrupt decreases respectively. The current state of practice for fault tolerance (FT) is checkpoint/restart. However, with increasing error rates, increasing aggregate memory and not proportionally increasing I/O capabilities, it is becoming less efficient. Proactive FT avoids experiencing failures through preventative measures, such as by migrating application parts away from nodes that are "about to fail". This paper presents a proactive FT framework that performs environmental monitoring, event logging, parallel job monitoring and resource monitoring to analyze HPC system reliability and to perform FT through such preventative actions.
暂无评论