Two classic problems that are computationally intensive and show good speedup and scalability when solved in a parallel programming environment are used to test the different resource allocation and management algorit...
详细信息
ISBN:
(纸本)0769514324
Two classic problems that are computationally intensive and show good speedup and scalability when solved in a parallel programming environment are used to test the different resource allocation and management algorithms used with the node intrusion and failure experiment. We divide the adaptive resource allocation experiments into two groups: (i) automatic survivability and scalability (ii) assessment of real-time quality of service (QoS). In the former, we use different algorithms to detect failed programs, host and network resources and idle times, computing an allocation, enactment of an allocation, and restart notification. We also use different techniques to detect dynamic paths that are receiving poor QoS possibly due to overload and to "scale up" such paths via reallocation. In the latter case, we use different fitness functions to classify the connections and the resources available on the nodes and study the effects of these on the overall resource allocation and the eventual speedup.
In this paper, we developed an efficient optimization algorithm for MOSFET parameters extraction in VDSM ULSI circuit design, which combines a search-space smoothing strategy, smoothes a large number of local barriers...
详细信息
ISBN:
(纸本)0780366778
In this paper, we developed an efficient optimization algorithm for MOSFET parameters extraction in VDSM ULSI circuit design, which combines a search-space smoothing strategy, smoothes a large number of local barriers and makes conventional heuristic search much more efficient. The experiment was implemented with a parallel programming strategy on a distributed multi-computer system with an improved computing efficiency. With such an algorithm, we can obtain global solution much easier and more accurate than conventional searching algorithms, and parameter extraction automation can make it possible to synthesize automatically simple analog circuits with a small number of transistors, and such a computing service business that is implemented on a parallel computing system can be supplied to users through internet services and various local networks.
We propose a massively parallel reconfigurable processor architecture targetted for the implementation of advanced wireless communication algorithms featuring matrix computations. A design methodology for programming ...
详细信息
We propose a massively parallel reconfigurable processor architecture targetted for the implementation of advanced wireless communication algorithms featuring matrix computations. A design methodology for programming and configuring the processor architecture is developed. The design entry point is the space representation of the algorithm in Simulink. The Simulink description is parsed and the algorithm's dependence flow graph is derived, which is scheduled and space-time mapped onto the proposed architecture. The compiler reconfigures the switch boxes of the proposed hierarchical interconnection network in the architecture. An energy consumption model is derived, and design examples are provided that demonstrate the enhanced energy efficiency of the proposed architecture compared to a state of the art programmable DSP.
Adaptive utilization of resources in a highly heterogeneous computational environment such as the Grid is a difficult question. In this paper, we address an object-oriented approach to the solution using requirement-d...
详细信息
Adaptive utilization of resources in a highly heterogeneous computational environment such as the Grid is a difficult question. In this paper, we address an object-oriented approach to the solution using requirement-driven parallel objects. Each parallel object is a self-described, shareable and passive object that resides in a separate memory address space. The allocation of the parallel object is driven by the constraints on the resource on which the object will live. A new parallel programming paradigm is presented in the context of ParoC++-a new parallel object-oriented programming environment for high performance distributed computing. ParoC++ extends C++ for supporting requirement-driven parallel objects and a runtime system that provides services to run ParoC++ programs in distributed environments. An industrial application on realtime image processing is used as a test case to the system. The experimental results show that the ParoC++ model is efficient and scalable and that it makes easier to adapt parallel applications to dynamic environments.
Cryptography has become an important discipline, especially for computer and communication system. There are various methods and algorithms in cryptography which require multiplication of large numbers. These multipli...
详细信息
Cryptography has become an important discipline, especially for computer and communication system. There are various methods and algorithms in cryptography which require multiplication of large numbers. These multiplications of large numbers normally require high computing power and need to be completed in 'real-time'. In this paper, Karatsuba algorithm is investigated for speeding up the performance of multiplying large integers using distributed workstations (server-clients). Also included in this paper is a comparison of various methods in implementing Karatsuba algorithm.
暂无评论