the proceedings contain 29 papers. the topics discussed include: energy-efficient server rack cooling using feedforward control: benefits and problems;design of a reconfigurable pipelined switch for faulty on-chip net...
ISBN:
(纸本)9780889868649
the proceedings contain 29 papers. the topics discussed include: energy-efficient server rack cooling using feedforward control: benefits and problems;design of a reconfigurable pipelined switch for faulty on-chip networks;on BPC permutations admissibility to variable-stage hybrid optical shuffle-exchange networks;efficient data service design for a SOA approach to scientific computing;task allocation method for avoiding contentions by the information of concurrent communications;an online system for octuple-precision computation;performance evaluation of semi-fixed-priority scheduling on prioritized SMT processors;failure prediction in video-streaming servers through performance analysis of server and client-server interactions;adaptive thread scheduling techniques for improving scalability of software transactional memory;and reexamining the parallelization schemes for standard full tableau simplex method on distributed memory environments.
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 withthe 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.
Graph transformations are the powerful formalism allowing describing a behavior of systems of various types. parallel computations paradigm makes computations faster if we are able to reduce additional costs related t...
详细信息
ISBN:
(纸本)9783642202667
Graph transformations are the powerful formalism allowing describing a behavior of systems of various types. parallel computations paradigm makes computations faster if we are able to reduce additional costs related to a communication overhead and a complexity of design of such systems. Replicated complementary graphs concept allows a parallel execution of graph transformation rules (designed for the centralized graph case) on a distributed environment. the possibility and the cost of data replication will be considered in the paper in the context of double-pushout approach.
the proceedings contain 105 papers. the topics discussed include: authentication of online authorship or article based on hypothesis testing model;the study of hierarchical branch prediction architecture;fast, accurat...
ISBN:
(纸本)9780769544779
the proceedings contain 105 papers. the topics discussed include: authentication of online authorship or article based on hypothesis testing model;the study of hierarchical branch prediction architecture;fast, accurate on-chip data memory performance estimation;domain service acquisition and domain modeling based on feature model;automatic management of cyclic dependency among web services;building regionally spatial appearance model by topological color histogram;a novel video steganography based on non-uniform rectangular partition;analyzing a batch range proof to address a security concern;the analysis of load balance for wireless sensor network using compressive sensing;distributing subsystems across different kernels running simultaneously in a multi-core architecture;research on equal symmetric distributed fault-tolerant architecture and strategy for parallel satellite system;and a self starting block Adams methods for solving stiff ordinary differential equation.
暂无评论