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.
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.
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.
this paper describes the evolution of the Portals message passing architecture and programming interface from its initial development on tightly-coupled massively parallel platforms to the current implementation runni...
详细信息
this article describes a packet processing methodology, which executes the required protocol layer functions of a networking device in parallel. Based on the dynamic prediction of the inherent protocol-stack of receiv...
详细信息
Discovery Net is an application layer for providing grid-based knowledge discovery services. these services allow scientists to create and manage complex knowledge discovery workflows that integrate data and analysis ...
详细信息
ISBN:
(纸本)0769516866
Discovery Net is an application layer for providing grid-based knowledge discovery services. these services allow scientists to create and manage complex knowledge discovery workflows that integrate data and analysis routines provided as remote services. they also allow scientists to store, share and execute these workflows as well as publish them as new services. Discovery Net provides a higher level of abstraction of the Grid for knowledge discovery activities, thus separating the end-users from resource management issues already handled by existing and emerging standards.
Grid computing is an emerging paradigm in which resources in multiple organizations are combined into a single, seamless computing environment. As the storage, processing, and networking capabilities of wireless and m...
Current handoff rerouting techniques in Mobile ATM networks fail to optimize some or all of the following parameters: handoff latency, route length, computational complexity, communication disruption period, network b...
详细信息
Based on a new characterisation of data reuse across multiple loop nests, we present a method, a prototyping implementation and some experimental results for analysing the cache behaviour of whole programs with regula...
详细信息
ISBN:
(纸本)0769515258
Based on a new characterisation of data reuse across multiple loop nests, we present a method, a prototyping implementation and some experimental results for analysing the cache behaviour of whole programs with regular computations. Validation against cache simulation using real codes shows the efficiency and accuracy of our method. the largest program we have analysed, Applu from SPECfp95, has 3868 lines, 16 subroutines and 2565 references. In the case of a 32KB cache with a 32B line size, our method obtains the miss ratio with an absolute error of about 0.80% in about 128 seconds while the simulator used runs for nearly 5 hours on a 933MHz Pentium III PC. Our method can be used to guide compiler locality optimisations and improve cache simulation performance.
暂无评论