the proceedings contain 5 papers. the topics discussed include: enabling rapid development of parallel tree search applications;challenges in executing large parameter sweep studies across widely distributed computing...
详细信息
ISBN:
(纸本)1595937145
the proceedings contain 5 papers. the topics discussed include: enabling rapid development of parallel tree search applications;challenges in executing large parameter sweep studies across widely distributed computing environments;hyperscaling of plasma turbulence simulations in DEISA;WISDOM-II: a large in silico docking effort for finding novel hits against malaria using computational grid infrastructure;and efficient processing of pathological images using the grid: computer-aided prognosis of neuroblastoma.
distributed Sensor Network is a classical area of multidisciplinary science. this needs a special type of computing, communication and sensing. this talk presents some new results on the following topics: 1) An optimi...
详细信息
ISBN:
(纸本)9783540747413
distributed Sensor Network is a classical area of multidisciplinary science. this needs a special type of computing, communication and sensing. this talk presents some new results on the following topics: 1) An optimization framework based on mathematical programming for maximizing the coverage probability of a sensor field under the constraints of investment limit;2) Feature extraction using sensor networks.
Large parameter sweep studies are common in a broad range of scientific disciplines. However, many challenges exist in supporting this type of computation in a widely distributed computing environment. these challenge...
详细信息
ISBN:
(纸本)1595937145
Large parameter sweep studies are common in a broad range of scientific disciplines. However, many challenges exist in supporting this type of computation in a widely distributed computing environment. these challenges exist because contributing sites in a federated distributed computing environment usually expose only a very narrow resource-sharing interface. this paper looks at the challenges encountered by parameter sweep studies using two concrete application examples. the paper also shows how a system for building personal clusters on demand has been developed to solve many of these problems. Copyright 2007 ACM.
the present work describes the design of a distributed agent system devoted to the Dial-a-Ride Problem. this routing and scheduling problem consists in finding a set of routes and schedules for each vehicle that satis...
详细信息
ISBN:
(纸本)9783540747413
the present work describes the design of a distributed agent system devoted to the Dial-a-Ride Problem. this routing and scheduling problem consists in finding a set of routes and schedules for each vehicle that satisfies a set of trip requests comming from users. the agent system distributes an improved insertion heuristic for the scheduling of passengers' trip requests over a fleet of vehicles. Agents make use of the contract-net protocol as base coordination mechanism for the planning and scheduling of passenger trips.
Heterogeneous Networks of Workstations (NOWs) offer a cost-effective solution for parallelprocessing. the completion time of a parallel task over NOWs depends on how the task is divided and distributed among the hete...
详细信息
ISBN:
(纸本)9783540747413
Heterogeneous Networks of Workstations (NOWs) offer a cost-effective solution for parallelprocessing. the completion time of a parallel task over NOWs depends on how the task is divided and distributed among the heterogeneous workstations. In this paper we present a distribution scheme which attempts to minimize the task's completion time over a heterogeneous NOWs. the scheme is based on the idea of distributing fixed time slices of work as opposed to fixed work slices. Our simulations show that the proposed scheme outperforms both fixed and variable work distribution schemes commonly in use. the scheme is very simple and requires no active monitoring of the network. Furthermore it is adaptive and copes very well withthe changes in background loads on workstations and network interference.
Virtual observatories will give astronomers easy access to anunprecedented amount of data. Extracting scientific knowledge from these data will increasingly demand both efficient algorithms as well as the power of par...
详细信息
ISBN:
(纸本)1595937145
Virtual observatories will give astronomers easy access to anunprecedented amount of data. Extracting scientific knowledge from these data will increasingly demand both efficient algorithms as well as the power of parallel computers. Nearly all efficient analyses of large astronomical datasets use trees as their fundamental data structure. Writing efficient tree-based techniques, a task that is time-consuming even on single-processor computers, is exceedingly cumbersome on massively parallel platforms (MPPs). Most applications that run on MPPs are simulation codes, since the expense of developing them is offset by the fact that they will be used for many years by many researchers. In contrast, data analysis codes change far more rapidly, are often unique to individual researchers, and therefore accommodate little reuse. Consequently, the economics of the current high-performance computing development paradigm for MPPs does not favor data analysis applications. We have therefore built a library, called Ntropy, that provides a flexible, extensible, and easy-to-use way of developing tree-based data analysis algorithms for both serial and parallel platforms. Our experience has shown that not only does our library save development time, it can also deliver excellent serial performance and parallel scalability. Furthermore, Ntropy makes it easy for an astronomer with little or noparallel programming experience to quickly scale their application to a distributed multiprocessor environment. By minimizing development time for efficient and scalable data analysis, we enable wide-scale knowledge discovery on massive datasets. Copyright 2007 ACM.
Recursive Maximum Likelihood (RML) and Expectation Maximization (EM) are a popular methodologies for estimating unknown static parameters in state-space models. We describe how a completely decentralized version of RM...
详细信息
ISBN:
(纸本)9789531841160
Recursive Maximum Likelihood (RML) and Expectation Maximization (EM) are a popular methodologies for estimating unknown static parameters in state-space models. We describe how a completely decentralized version of RML and EM can be implemented in dynamic graphical models through the propagation of suitable messages that are exchanged between neighboring nodes of the graph. the resulting algorithm can be interpreted as an extension of the celebrated Belief Propagation algorithm to compute likelihood gradients. this algorithm is applied to solve the sensor localization problem for sensor networks. An exact implementation is given for dynamic linear Gaussian models without loops.
Graph problems are finding increasing applications in high performance computing disciplines. Although many regular problems can be solved efficiently in parallel, obtaining efficient implementations for irregular gra...
详细信息
ISBN:
(纸本)9783540747413
Graph problems are finding increasing applications in high performance computing disciplines. Although many regular problems can be solved efficiently in parallel, obtaining efficient implementations for irregular graph problems remains a challenge. We propose techniques for designing and implementing efficient parallel algorithms for graph problems on symmetric multiprocessors and chip multiprocessors with a case study of parallel tree and connectivity algorithms. the problems we study represent a wide range of irregular problems that have fast theoretic parallel algorithms but no known efficient parallel implementations that achieve speedup without serious restricting assumptions about the inputs. We believe our techniques will be of practical impact in solving large-scale graph problems.
Obsolete hardware can be effectively reused through intelligent software optimization, which is possible only when source code is available. Virtual Distro Dispatcher (VDD) is a system that produces virtual machines o...
详细信息
ISBN:
(纸本)9783540747413
Obsolete hardware can be effectively reused through intelligent software optimization, which is possible only when source code is available. Virtual Distro Dispatcher (VDD) is a system that produces virtual machines on a central server and projects them on a number of costless physical terminals. VDD is the result of an extreme software optimisation based on virtualization and terminal servers. VDD creates and projects Linux distros that are completely customizable and different from each other. they are virtual desktop machines that can be used for testing or developing and are completely controllable directly from each terminal. Memory consumption has been strongly reduced without sacrificing performances. Test results are encouraging to proceed withthe research towards clustering.
this paper describes the performance evaluation to validate the superiority of UbiMDR framework. In ubiquitous application, the semantic operability is one of the most important issues to maximize the usability of sen...
详细信息
ISBN:
(纸本)9783540747413
this paper describes the performance evaluation to validate the superiority of UbiMDR framework. In ubiquitous application, the semantic operability is one of the most important issues to maximize the usability of sensors in sensor fields. However, existing frameworks are not suitable for the ubiquitous computing environment because of data heterogeneity between data elements. the MDR-based framework in ubiquitous computing provides the semantic interoperability among ubiquitous applications or sensor fields. In addition, the UbiMDR framework represents low costs for mapping or addition of new elements or operation compared to conventional framework.
暂无评论