In distributed task ready queue organizations, task routing refers to how ready tasks are assigned to processors in the system and task scheduling refers to how these tasks are scheduled on the assigned processor. In ...
详细信息
作者:
Sorel, Y.INRIA
Domaine de Voluceau Rocquencourt B.P.105 Le Chesnay Cedex78153 France
Massively Parallel computing Systems (MPCS) provide high performance computing generally used to accelerate numerical computation applications. We present a methodology called "Algorithm Architecture Adequation&q...
详细信息
computing is often viewed as a tool and a computing system is typically treated as a toolbox of applications for performing operations such as calculations and data storage and transfer. Currently, humans develop thes...
详细信息
This paper describes a Massively Parallel computing System, named Recursively structured Parallel Computer-RSPC, designed to work as a dataflow distributed computer, and presents the design of the matching store of ea...
详细信息
The main algorithms for sequential and parallel discrete event simulations are introduced. A set of different simulators is evaluated and compared using a transputer-based multicomputer: sequential, parallel conservat...
详细信息
The proceedings contain 53 papers. The special focus in this conference is on Parallel Scientific computing. The topics include: Computational fluid dynamics on workstation clusters in industrial environments;PVM impl...
ISBN:
(纸本)9783540587125
The proceedings contain 53 papers. The special focus in this conference is on Parallel Scientific computing. The topics include: Computational fluid dynamics on workstation clusters in industrial environments;PVM implementations of advection-chemistry modules of air pollution models;a parallel tree N-body code for heterogeneous clusters;parallel computation of the eigenstructure of toeplitz-plus-hankel matrices on multleomputers;computing eigenvalues of sparse matrices on the connection machine;preliminary experiences with extrapolation methods for parallel solution of differential algebraic equations;a transform approach to fast matrix multiplication;quantum mechanical treatment of reactive scattering problems;load-balancing procedure for distributed short- range molecular dynamics;parallel distributed 2-D short-range molecular dynamics on networked workstations;implementation of parallel lattice gas program on workstations under PVM;constructing numerical software libraries for high-performance computing environments;the CERFACS experience;towards an automatic portation of programs from nCUBE2 to KSR1;a new algorithm for the traveling salesman problem on networked workstations;nonlinear finite element problems on parallel computers;the challenge of portable libraries for high performance machines;two enhancements in a partitioned sparse code;nonlinear dynamics in biochemical control systems;scientific software libraries for scalable architectures;parallel interval methods for perturbed linear systems;limiting factors in high performance computing;programming the convex exemplar series SPP system;parallelization of HIRLAM on MIMD platforms;simulation of fluid dynamical flow problems;real time simulation in a cluster computing environment and parallel computations in molecular dynamics.
Complex optimisation problems with many degrees of freedom are often characterised by the enormously large configuration space, typically O(e(N)) or O(N!). The idea of simulated annealing (SA) proposed by Kirkpatrick ...
Complex optimisation problems with many degrees of freedom are often characterised by the enormously large configuration space, typically O(e(N)) or O(N!). The idea of simulated annealing (SA) proposed by Kirkpatrick has been applied to the complex optimisation problems, which can be treated as annealing a statistical mechanical system from high temperature to low temperature;however, the SA is terribly slow for large problem sizes in typically O(N3 In N) time. We discover the hybrid algorithm (HA), which is based on a hybrid mechanism which combines conventional heuristics with low temperature simulated annealing (LTSA), which could be parallelised easily. The HA is a new approach of resolving optimisation problems with O(N) complexity where information propagation can be inhibited by restraining the range of searches in the configuration space. We use the HA to resolve several famous combinatorial optimisation problems, including the travelling salesman problem (TSP) of large sizes up to 1 000 000 cities within 3 to 5 percent of the optimal value in linear time and other nonuniformly distributed TSPs as well. We shall also discuss the applicability of the HA to the optimisation problems in general.
The Open Software Foundation (OSF) distributedcomputing Environment (DCE) is an integrated set of services that facilitates the construction, use and maintenance of distributed applications in a heterogeneous computi...
详细信息
Continuous advancements in the field of high speed computer networks and real-time distributed database technology have made new applications in the field of medical imaging possible. The Global PACS prototype is one ...
详细信息
ISBN:
(纸本)0819414603
Continuous advancements in the field of high speed computer networks and real-time distributed database technology have made new applications in the field of medical imaging possible. The Global PACS prototype is one such application which has been implemented on a national scale via wide area networks. It integrates different system components, such as imaging equipment, viewing workstations, database management and the archive system, fiber optic networks and a high-speed backbone network. Global PACS includes a distributed database archive system spread throughout wide geographical areas and interconnected via the internet and NSFNET. This paper presents a new approach using a file management system for a Global PACS distributed database management and archive system. The file management system allows collaboration between Local and Remote viewing workstations in Global PACS. The image GIF files are stored and retrieved under a UNIX file management system on several servers on the internet. The file management system is used to access different multimedia files, such as image, voice and video data, from Global PACS servers on the internet. The file management approach reduces unnecessary DBMS overhead and supports real-time applications for Global PACS. The UNIX RPC (Remote Procedure Call) facility is used for real-time query and FTP (File Transfer Protocol) is used for image file transfer. This system has been integrated with the remote consultation and diagnosis system in Global PACS. The distributed file management system has been tested over the local Ethernet at the University Medical Center and over the internet/NSFNET to Wake Forest University, on distributed Global PACS servers. Query and image retrieval tests using the file management system have shown excellent performance. Future features of this system will include the use of the Open Software Foundation distributedcomputing Environment services. This research is sponsored by the National Science Fou
We present a system for the integration of computer vision tasks in a distributed environment. This system, called DeViouS, is based on the client/server model and runs in a heterogeneous environment of Unix workstati...
详细信息
We present a system for the integration of computer vision tasks in a distributed environment. This system, called DeViouS, is based on the client/server model and runs in a heterogeneous environment of Unix workstations. It takes advantage of the free cycles in modern workstation environments to distribute and speed up the execution of vision tasks. Two primary goals of DeViouS are to provide a practical distributed system and a research environment for vision computing. DeViouS is based on a modular design that allows experimentation in various aspects of algorithm design, scheduling and network programming. It can make use of any existing computer vision package with very minor changes to DeViouS. DeViouS has been tested in an environment of SUN and Digital workstations and has shown substantial improvements in speed over sequential computing with negligible overhead.< >
暂无评论