Following the long tradition of this well established event, the 5thinternational Workshop on High-Level parallel Programming Modelsand Supportive Environments (HIPS 2000) provides a forum for researchers and develop...
ISBN:
(纸本)354067442X
Following the long tradition of this well established event, the 5thinternational Workshop on High-Level parallel Programming Modelsand Supportive Environments (HIPS 2000) provides a forum for researchers and developers from both academia and industry to meet and discuss the newest approaches and results in this active research area. It is again held in conjunction with IPDPS (formerly known as IPPS/SPDP), one of the premier events in the area of parallel and distributed processing.
Withthe development of network technology, distributedparallelcomputing with multi processors as its basis is becoming a new kind of efficient parallelcomputing method. We introduce a parallel neurocomputing envir...
详细信息
Withthe development of network technology, distributedparallelcomputing with multi processors as its basis is becoming a new kind of efficient parallelcomputing method. We introduce a parallel neurocomputing environment-HCPC (heterogeneous computer parallelcomputing), which is realized in a network of UNIX workstations and microcomputers. Capabilities of HCPC are tested through the realization of an ART1 neural network model.
We present an efficient distributed dynamic channel allocation algorithm for mobile communications systems. the algorithm is based upon the mutual exclusion model, where the channels are grouped by the number of cells...
详细信息
We present an efficient distributed dynamic channel allocation algorithm for mobile communications systems. the algorithm is based upon the mutual exclusion model, where the channels are grouped by the number of cells in a cluster and each group of channels cannot be shared concurrently within the cluster. We discuss the algorithm and prove its correctness. We also show that the algorithm requires at most (worst case) O(N/sub g/*N/sub n/logN/sub n/) messages, where N/sub g/ is the number of groups and N/sub n/ is the number of neighbors. this is compared to Choy's (1995) algorithm which requires O(N/sub g//sup 2/*N/sub n/), where N/sub g/ is the number of groups. Our simulation experiments indicate that the DDRA algorithm outperforms previous schemes. A 5% reduction in the denial rate, and a 10-30% reduction in the acquisition time channel were obtained using our algorithm when compared to the previous algorithm.
Using the parallel Substitution Algorithm, as a formal model of parallel computations, two examples of distributed architecture are given for implementation of fast parallel algorithms: for the maximal independent set...
详细信息
ISBN:
(纸本)3540663630
Using the parallel Substitution Algorithm, as a formal model of parallel computations, two examples of distributed architecture are given for implementation of fast parallel algorithms: for the maximal independent set problem and the minimum weighted vertex cover one.
A software package is introduced to aid in the teaching of courses in parallel processing, particularly topics such as software distributed shared memory, memory consistency models, and synchronization mechanisms. the...
详细信息
the programming of distributed memory architectures can be significantly facilitated by abstract, application-oriented models. the Promoter model reconciles generality and easiness of use by a new concept of high-leve...
详细信息
ISBN:
(纸本)3540663630
the programming of distributed memory architectures can be significantly facilitated by abstract, application-oriented models. the Promoter model reconciles generality and easiness of use by a new concept of high-level data parallelism that leads to distributed types withparallel operations. the model enables the user to describe the spatial structures for a wide spectrum of numerical and non-numerical application in a uniform algebraic formalism, so that the compiler can readily generate the optimized message-passing program.
DEALed is a tool suite for development of distributed systems using DEAL language. DEAL is being developed at Eindhoven University of Technology as a part of DEDOS project. Area of application of the DEALed is the dev...
详细信息
ISBN:
(纸本)3540663630
DEALed is a tool suite for development of distributed systems using DEAL language. DEAL is being developed at Eindhoven University of Technology as a part of DEDOS project. Area of application of the DEALed is the development of the distributed real-time safety-critical control systems.
Hardware-based speculative parallelization of non-analyzable codes on distributed modulo scheduling multiprocessors is challenging. A scheme to parallelize codes that have a modest number of cross-iteration dependence...
详细信息
ISBN:
(纸本)0769500048
Hardware-based speculative parallelization of non-analyzable codes on distributed modulo scheduling multiprocessors is challenging. A scheme to parallelize codes that have a modest number of cross-iteration dependences is proposed. Simulation results suggest that the scheme is promising: a 16-processor parallel execution of 4 important loops runs 4.2 and 31 times faster than two different serial executions of the loops.
the semidicretization of a time-dependent nonlinear partial differential equation leads to a large-scale initial value problem for ordinary differential equations which often cannot be solved in a reasonable time on a...
详细信息
ISBN:
(纸本)3540663630
the semidicretization of a time-dependent nonlinear partial differential equation leads to a large-scale initial value problem for ordinary differential equations which often cannot be solved in a reasonable time on a sequential computer. We investigate in what extent can be practically exploited the idea of parallelism across method in the case of such large problems, and using a distributed computational system.
暂无评论