An algorithm is presented for volume rendering in environments of parallel virtual machines. To reduce the communication cost, as well as to guarantee the locality of all subtasks, the volume data is divided into an...An algorithm is presented for volume rendering in environments of parallel virtual machines. To reduce the communication cost, as well as to guarantee the locality of all subtasks, the volume data is divided into and organized as a series of slices. The task subdivision algorithm produces acceptable load balancing by maintaining and employing a database of performance indices. An asynchronous binary method merges all partial images in O(logn) time. An efficient development platform based on TCP/IP and Socket standards can help parallelize various rendering algorithms on virtual machines. Our algorithm was implemented on this platform using the classical client/server paradigm. The scalabilities of both task size and host number were tested experimentally.展开更多
Software component library is the essential part of reuse-based softwaredevelopment. It is shown that making use of a single component library to store all kinds ofcomponents and from which components are searched is ...Software component library is the essential part of reuse-based softwaredevelopment. It is shown that making use of a single component library to store all kinds ofcomponents and from which components are searched is very inefficient. We construct multi-librariesto support software reuse and use PVM as development environments to imitate large-scale computer,which is expected to fulfill distributed storage and parallel search of components efficiently andimprove software reuse.展开更多
In this paper we describe an implementation of some kinds of parallel genetic algorithms on the PVM,Parallel Virtual Machine, a portable parallel environment. We give details of a genetic algorithm running On many sma...In this paper we describe an implementation of some kinds of parallel genetic algorithms on the PVM,Parallel Virtual Machine, a portable parallel environment. We give details of a genetic algorithm running On many small subpopulations with an occasional identification and exchange of their useful information among subpopulations by means of message-passing functions of PVM. In this work, experiments were done to compare the parallel genetic algorithm and traditional sequential genetic algorithms.展开更多
文摘An algorithm is presented for volume rendering in environments of parallel virtual machines. To reduce the communication cost, as well as to guarantee the locality of all subtasks, the volume data is divided into and organized as a series of slices. The task subdivision algorithm produces acceptable load balancing by maintaining and employing a database of performance indices. An asynchronous binary method merges all partial images in O(logn) time. An efficient development platform based on TCP/IP and Socket standards can help parallelize various rendering algorithms on virtual machines. Our algorithm was implemented on this platform using the classical client/server paradigm. The scalabilities of both task size and host number were tested experimentally.
基金Supported by the National High Performance Computation Foundation(984057)
文摘Software component library is the essential part of reuse-based softwaredevelopment. It is shown that making use of a single component library to store all kinds ofcomponents and from which components are searched is very inefficient. We construct multi-librariesto support software reuse and use PVM as development environments to imitate large-scale computer,which is expected to fulfill distributed storage and parallel search of components efficiently andimprove software reuse.
文摘In this paper we describe an implementation of some kinds of parallel genetic algorithms on the PVM,Parallel Virtual Machine, a portable parallel environment. We give details of a genetic algorithm running On many small subpopulations with an occasional identification and exchange of their useful information among subpopulations by means of message-passing functions of PVM. In this work, experiments were done to compare the parallel genetic algorithm and traditional sequential genetic algorithms.
