The proceedings contain 65 papers. The topics discussed include: an energy efficient clustering protocol using minimum spanning tree for wireless sensor networks;DOA estimation for rectangular linear array antenna in ...
ISBN:
(纸本)9783642240362
The proceedings contain 65 papers. The topics discussed include: an energy efficient clustering protocol using minimum spanning tree for wireless sensor networks;DOA estimation for rectangular linear array antenna in frequency non selective slow fading MIMO channels;vector quantization based face recognition using integrated adaptive fuzzy clustering;transformation of active reference graph into passive reference graph for distributed garbage collection;face recognition using fuzzy neural network classifier;impulse noise removal from grayscale images using fuzzy genetic algorithm;reliability estimation of mobile agents for service discovery in MANET;a state-of-the-art survey on ids for mobile ad-hoc networks and wireless mesh networks;manipulating objects through hand gesture recognition in virtual environment;efficient ID-based signature scheme from bilinear map;and sleep scheduler protocol for network reliability in wireless sensor networks.
A parallel design and implementation of the Self-Organizing Map (SOM) neural computing model is proposed. The parallel design of SOM is implemented in a parallel virtual machine (PVM) environment of a distributed syst...
详细信息
A parallel design and implementation of the Self-Organizing Map (SOM) neural computing model is proposed. The parallel design of SOM is implemented in a parallel virtual machine (PVM) environment of a distributed system. A practical realization of SOM algorithm is investigated, the construction of computing module in parallel virtual machine is discussed, the communication methods and an optimization of messages passing between multiple processes are proposed, and the parallel programming technique and a PVM implementation of SOM neural computing model are given and discussed in detail.
Neural system, as processors of time-sequence patterns, have been successfully applied to several speaker-dependent speech recognition computing. They can be efficiently implemented by a pipeline architecture. In this...
详细信息
Neural system, as processors of time-sequence patterns, have been successfully applied to several speaker-dependent speech recognition computing. They can be efficiently implemented by a pipeline architecture. In this paper, a parallel time-delay speech recognition computing for VLSI neural systems is presented. The system design methodology is to emphasize a coordination between computational model, architectural description, and VLSI systolic implementation. Examples of time-delay speech recognition applications to VLSI neural system design and performance analysis are given to illustrate effectiveness of the parallel computation.
In this paper, we present an original approach for the design and execution of distributed applications that require numerous tasks of variable grain. The approach is based on the concept of task cluster which is an e...
详细信息
In this paper, we present an original approach for the design and execution of distributed applications that require numerous tasks of variable grain. The approach is based on the concept of task cluster which is an entity that groups tasks with strong logical interaction and that guarantees efficient communications between them. We describe the implementation of the model, that mainly relies on the use of lightweight processes as support for the distributed tasks. We also illustrates the use of the proposed approach on real size applications where it has improved both the ease of design and the performance.
This paper presents the coherent parallel programming concept using a new parallel language called C (pronounced C parallel). The language is based on the standard C language with a small set of extended constructs fo...
详细信息
This paper presents the coherent parallel programming concept using a new parallel language called C (pronounced C parallel). The language is based on the standard C language with a small set of extended constructs for parallelism and process interaction. At the core of C is a structured construct called coherent region, which facilitates the development of coherent programs, i.e., parallel programs that are structured, determinate, terminative, and compositional. We present the basic features of C and show that coherent region is a versatile construct.
An effective automatic parallelizer is critical for users to exploit the resources of parallel computers. Researcher has gained much progress in recent years. This paper introduces AFT, a new generation parallelizing ...
详细信息
An effective automatic parallelizer is critical for users to exploit the resources of parallel computers. Researcher has gained much progress in recent years. This paper introduces AFT, a new generation parallelizing compiler that we developed. It integrates many advanced techniques in an effective and efficient system. The experiment result shows that AFT is able to achieve notable parallelization on many programs.
This paper surveys the program dependence analysis technique for parallel and/or distributed programs and its applications from the viewpoint of software engineering. We present primary program dependences which may e...
详细信息
ISBN:
(纸本)0818678763
This paper surveys the program dependence analysis technique for parallel and/or distributed programs and its applications from the viewpoint of software engineering. We present primary program dependences which may exist in a parallel and/or distributed program, a general approach to define, analyze, and represent these program dependences formally, and applications of an explicit program dependence based representation for parallel and/or distributed programs in various software engineering activities. We also suggest some research problems on this direction.
An efficient assignment of tasks to the processors is imperative for achieving a fast job turnaround time in a parallel or distributed environment. The assignment problem is well known to be NP-complete, except in a f...
详细信息
An efficient assignment of tasks to the processors is imperative for achieving a fast job turnaround time in a parallel or distributed environment. The assignment problem is well known to be NP-complete, except in a few special cases. Thus heuristics are used to obtain suboptimal solutions in reasonable amount of time. While a plethora of such heuristics have been documented in the literature, in this paper we aim to develop techniques for finding optimal solutions under the most relaxed assumptions. We propose a best-first search based parallel algorithm that generates optimal solution for assigning an arbitrary task graph to an arbitrary network of homogeneous or heterogeneous processors. The parallel algorithm running on the Intel Paragon gives optimal assignments for problems of medium to large sizes. We believe our algorithms to be novel in solving an indispensable problem in parallel and distributedcomputing.
In this work, it is argued that because of recent advance of network & CPU technologies, workstation clusters are poised to become the primary parallelcomputing infrastructure for science and engineering computin...
详细信息
In this work, it is argued that because of recent advance of network & CPU technologies, workstation clusters are poised to become the primary parallelcomputing infrastructure for science and engineering computing. After analyzing and comparing the communication performance of three popular networks: 10Mbps Ethernet, 100Mbps Ethernet and 640Mbps Myrinet on an experimental workstation cluster, it is pointed that two main factors hinder the wider application of workstation cluster. These problems are overcome by implementing two workstation cluster systems for different performance/price rate requirements.
This paper introduces an algorithm that can generate huge node dataflow by compiling existing programs. The purpose of this algorithm is to improve the speed of parallel processing and utilize the large amount of exis...
详细信息
ISBN:
(纸本)0818678763
This paper introduces an algorithm that can generate huge node dataflow by compiling existing programs. The purpose of this algorithm is to improve the speed of parallel processing and utilize the large amount of existing program resourses. In addition, this idea of huge node data flow algorithm can also be used in distributed processing and multi-thread processing.
暂无评论