In systems consisting of multiple clusters of processors such as our Distributed ASCI(1) Supercomputer (DAS), jobs mail request co-allocation, i.e., the simultaneous allocation of processors in different clusters. We ...
详细信息
ISBN:
(纸本)0769517722
In systems consisting of multiple clusters of processors such as our Distributed ASCI(1) Supercomputer (DAS), jobs mail request co-allocation, i.e., the simultaneous allocation of processors in different clusters. We simulate such systems ignoring,communication among the tasks of jobs, and determine the,,response times for different types and sizes of job requests';and for different numbers and sizes of clusters. In many cases we also compute or approximate the maximum utilization. We find that the numbers and sizes of the clusters and of the job components have a strong impact on performance, and that in many cases co-allocation is a viable choice.
Summary form only given. this paper focuses on theoretical and practical aspects of the high-performance multikey sorting problem on computer clusters, with particular emphasis on the Alpha Maci Cluster, a world-class...
详细信息
the research described in this paper is performed as part of the Globus Project. It introduces a new Grid service called InfoGram that combines the ability of serving as information service and as a job execution serv...
详细信息
ISBN:
(纸本)0769516866
the research described in this paper is performed as part of the Globus Project. It introduces a new Grid service called InfoGram that combines the ability of serving as information service and as a job execution service. Previously, both services were architected and implemented within the Globus Toolkit as two different services with different wire protocols. Our service demonstrates a significant simplification of the architecture while treating job submissions and information queries alike. the advantage of our service is that it provides backwards compatibility to existing Grid services, while at the same time providing forwards compatibility to the emerging Web services world. Part of the work conducted within this effort is already reused by the current Open Grid Services architecture prototype implementation.
A novel component-based, service-oriented framework for distributed metacomputing is described. Adopting a provider-centric view of resource sharing, this project emphasizes lightweight software infrastructures that m...
详细信息
ISBN:
(纸本)0769516866
A novel component-based, service-oriented framework for distributed metacomputing is described. Adopting a provider-centric view of resource sharing, this project emphasizes lightweight software infrastructures that maintain minimal state, and interface to current and emerging distributed computing standards. Resource owners host a software backplane onto which owners, clients, or third-party resellers may load components or component-suites that deliver value added services without compromising owner security or control. Standards-based descriptions of services facilitate publication and discovery, via established schemes. the architecture of the container framework, design of components, security and access control schemes, and preliminary experiences are described in this paper.
Withthe recent DNA-microarray technology, it is possible to measure the expression levels of thousands of genes simultaneously in the same experiment. A genetic network is a model that describes how the expression le...
详细信息
ISBN:
(纸本)0769517722
Withthe recent DNA-microarray technology, it is possible to measure the expression levels of thousands of genes simultaneously in the same experiment. A genetic network is a model that describes how the expression level of each gene is affected by the expression levels of other genes in the network. Given, the results of an experiment with n genes and m measures over time (m << n), we consider the problem of finding a subset of genes (k genes, where k << n) that explain the expression level of a given target gene under study. We consider the coarse-grained multicomputer (CGM) model, with p processors. In this paper we first present a sequential approximation algorithm of O(m(4) n) time and O(m(2)n) space. the main result is a new parallel approximation algorithm that determines the k genes in O(m(4) n/p) local computing time plus O(k) communication rounds, and with space requirement of O(m(2) n/p). the p factor in the parallel time and space complexities indicates a,good parallelization. We also show preliminary, promising,experimental results on a Beowulf machine. To our knowledge there are no CGM algorithms for the problem considered in this paper.
Recent work in reconfigurable computing research has shown that a substantial performance speedup can be achieved through architectures that map the most relevant application inner-loops to a reconfigurable datapath. ...
详细信息
ISBN:
(纸本)1581135769
Recent work in reconfigurable computing research has shown that a substantial performance speedup can be achieved through architectures that map the most relevant application inner-loops to a reconfigurable datapath. Any solution to this problem must be able to synthesize a datapath for each loop and to merge them together into a single reconfigurable datapath. the main contribution of this paper is a novel graph-based technique for the datapath merge problem. this approach is based on the solution of a maximum clique problem that merges datapaths one at a time. A set of experiments, using the MediaBench benchmark, shows that the proposed technique produces 24% fewer datapath interconnections than a previous solution to this problem.
Summary form only given. AURA (Advanced Uncertain Reasoning architecture) is a generic family of techniques and implementations intended for high-speed approximate search and match operations on large unstructured dat...
详细信息
this work presents the design of the Coven framework for construction of Problem Solving Environments (PSEs) for parallel computers. PSEs are an integral part of modern highperformancecomputing (HPC) and Coven attem...
详细信息
ISBN:
(纸本)0769516866
this work presents the design of the Coven framework for construction of Problem Solving Environments (PSEs) for parallel computers. PSEs are an integral part of modern highperformancecomputing (HPC) and Coven attempts to simplify PSE construction. Coven targets Beowulf cluster parallel computers but independent of any particular domain for the PSE. Multi-threaded parallel applications are created with Coven that are capable of supporting most of the constructs in a typical parallel programming language. Coven uses an agent-based front-end which allows multiple custom interfaces to be constructed Examples of the use of Coven in the construction of prototype PSEs are shown, and the effectiveness of these PSEs is evaluated in terms of the performance of the applications they generate.
this paper explores the concept of micro-architectural loops and discusses their impact on processor pipelines. In particular, we establish the relationship between loose loops and pipeline length and configuration, a...
详细信息
ISBN:
(纸本)0769515258
this paper explores the concept of micro-architectural loops and discusses their impact on processor pipelines. In particular, we establish the relationship between loose loops and pipeline length and configuration, and show their impact on performance. We then evaluate the load resolution loop, in detail and propose the distributed register algorithm (DRA) as a way of reducing this loop. It decreases the performance loss due to load mis-speculations by reducing the issue-to-execute latency, in the pipeline. A new loose loop is introduced into the pipeline by the DRA, but the frequency of mis-speculations is very, low. the reduction in latency from issue to execute, along with a low mis-speculation rate in the DRA result in up to a 4% to 15% improvement in performance using a detailed architectural simulator.
Grid applications must increasingly self-adapt dynamically to changing environments. In most cases, adaptation has been implemented in an ad hoc fashion, on a per-application basis. this paper describes work which gen...
详细信息
ISBN:
(纸本)0769516866
Grid applications must increasingly self-adapt dynamically to changing environments. In most cases, adaptation has been implemented in an ad hoc fashion, on a per-application basis. this paper describes work which generalizes adaptation so that it can be used across applications by providing an adaptation framework. this framework uses a software architectural model of the system to analyze whether the application requires adaptation, and allows repairs to be written in the context of the architectural model and propagated to the running system. In this paper, we exemplify our framework by applying it to the domain of load-balancing a client-server system. We report on an experiment conducted using our framework, which illustrates that this approach maintains architectural requirements.
暂无评论