The Loongson project is the first attempt to design highperformance general purpose microprocessors in China. It implements a four-issue general purpose RISC microprocessor based on 64-bit MIPS instruction set. Loong...
详细信息
ISBN:
(纸本)9781424442331
The Loongson project is the first attempt to design highperformance general purpose microprocessors in China. It implements a four-issue general purpose RISC microprocessor based on 64-bit MIPS instruction set. Loongson-2E is the latest version of the project. highperformance is an important design criterion for Ctyptographic symmetric primitives (include block ciphers and hash functions). This is the first paper which discusses how to optimize AES-128, SHA-256, SHA-512 and Whirlpool algorithms on Loongson-2E. Our programs are, to our best knowledge, the fastest implementations on Loongson-2E. This paper also proposed several new instructions for speedup symmetric primitives and a parallel hash function mode.
This work proposes a method to fine grain the ranking of solutions after they have been ranked by Pareto dominance, aiming to improve the performance of evolutionary algorithms oil many objective's optimization pr...
详细信息
ISBN:
(纸本)9783540896937
This work proposes a method to fine grain the ranking of solutions after they have been ranked by Pareto dominance, aiming to improve the performance of evolutionary algorithms oil many objective's optimization problems. The re-ranking method uses a randomized sampling procedure to choose, from sets of equally ranked solutions, those solutions that, will be given selective advantage,. The sampling procedure favors a good distribution of the, sampled solutions based on dominance regions wider than conventional Pareto dominance. We enhance, NSGA-II with the proposed method and test its performance on with up to M = 10 objectives. Experimental result's show that, convergence and diversity of the solutions found call improve remarkably oil 3 <= M <= 10 objectives problems.
Many videotexts exist in TV programs. Some videotexts provide valuable information. Thus, an efficient design to extract these videotexts is requested. Existing videotext extractors work on the PC platform and they ar...
详细信息
ISBN:
(纸本)9781424440993
Many videotexts exist in TV programs. Some videotexts provide valuable information. Thus, an efficient design to extract these videotexts is requested. Existing videotext extractors work on the PC platform and they are difficult to achieve real-time extraction and integration. Therefore, this work designs a videotext extractor on a dual-core platform. A distributed design framework for a dual-core platform is proposed. The extraction task is dispatched to the ARM and the DSP. The ARM core executes capture, display, control, and extraction threads. The DSP core performs algorithms. The ARM and the DSP communicate by buffers and solid channels. On the DSP side, some techniques are manipulated to optimize the videotext extractor. They include software pipeline, internal memory, adjusted program, assembly optimization, and DMA. To achieve highperformance, two transferred schemes of DMA are proposed. This system is implemented on the TI Davinci DM6446 platform. All input videos are 720 x 480 with 30 fps captured from real-time DVB-T system. The simulation result shows that this extractor can process the large-size frames, and all the videotext can be extracted. With this novel architecture, the extraction speed can be enhanced to 23 frames per second.
The rate-distortion optimization (RDO) technique is employed in H.264/AVC intra frame coding to achieve the best rate-distortion performance. But the computational complexity is very high because it encodes the curren...
详细信息
In this paper, we examine the data replication problem in a particular grid delivery network (GDN). In this system, the data are divided into fixed size blocks which must be replicated on hosts to decrease the total d...
详细信息
In this paper, we examine the data replication problem in a particular grid delivery network (GDN). In this system, the data are divided into fixed size blocks which must be replicated on hosts to decrease the total download time. We propose a probabilistic model to optimize the average download time of requests based on the hosts availability and the document size distribution. The objective function induced by this model is a nonlinear integer problem. It can be solved in real values by Lagrangian optimization. We prove that in a particular case, this problem can be reduced to a knapsack problem. We propose approximation algorithms and validate them using simulations with varying characteristics.
In the past decade, the scientific community has become more interested in Near Earth Objects (NEOs) and the threat they pose to existence of life on this planet. The recent trend in NEO deflection technique research ...
详细信息
This paper reports the comparison study of particle swarm optimization (PSO) and evolutionary particle swarm optimization (EPSO) algorithms and their application to the optimal capacitor placement in radial power dist...
详细信息
This paper reports the comparison study of particle swarm optimization (PSO) and evolutionary particle swarm optimization (EPSO) algorithms and their application to the optimal capacitor placement in radial power distribution system. Using JAVA language, software programs have been developed with PSO and 2 variant EPSO algorithms. The comparison study is then carried-out on the various versions of EPSO and PSO algorithms to analyze the performance of each algorithm in solving the capacitor placement problem. A power distribution system from Melaka, Malaysia has been used in this study. The results clearly indicate that EPSO is superior to PSO in finding the optimal solution and handling more complex, nonlinear objective functions due to its self-adaptability. However, EPSO is more computationally intense, requiring more computational time per iteration.
In resent years, research has taken an interest in design of approximation algorithms due to the requirement of these algorithms for solving many problems of science and engineering like system modeling, identificatio...
详细信息
In resent years, research has taken an interest in design of approximation algorithms due to the requirement of these algorithms for solving many problems of science and engineering like system modeling, identification of plants, controller design, fault detection, computer security, prediction of data sets etc. The area of Artificial Immune System (AIS) is emerging as an active and attractive field involving models, techniques and applications of greater diversity. In this paper a new optimization algorithm based on AIS is developed. The proposed algorithm has been suitably applied to develop practical applications like design of a new model for efficient approximation of nonlinear functions and identification of nonlinear systems in noisy environments. Simulation study of few benchmark function approximation and system identification problems are carried out to show superior performance of the proposed model over the standard methods in terms of response matching, accuracy of identification and convergence speed achieved.
In this paper, we propose a new particle swarm optimization (PSO), which is based on successive optimization in its parameter space, in order to overcome the difficulty for applying PSO to complex and high dimensional...
详细信息
In this paper, we propose a new particle swarm optimization (PSO), which is based on successive optimization in its parameter space, in order to overcome the difficulty for applying PSO to complex and high dimensional nonlinearoptimization problems. The proposed PSO consists of two types of optimization procedures; optimization in its decision variable space and optimization in its parameter space. Some numerical simulations using 6 types of typical benchmark problems verify the performance of the proposed PSO.
While the demand for memory capacity and performance continues to increase, current DDR memory implementations start to encounter limitations. At high data rates of 533MT/s and above, it becomes increasingly difficult...
详细信息
ISBN:
(纸本)9780863419317
While the demand for memory capacity and performance continues to increase, current DDR memory implementations start to encounter limitations. At high data rates of 533MT/s and above, it becomes increasingly difficult to support different combinations of DDR raw card types on the same platform due to the possible variations in load. This paper outlines a method of maximizing the DDR bus performance by utilizing hardware circuitry in the memory controller in connection with softwarealgorithms to adjust the DDR transaction timing relationships based on the populated memory configuration. The algorithm also compensate for the effects of ageing over the lifetime of the part. The techniques used in this work are related to DDR-2 but could also be applicable to DDR-3 and future technologies.
暂无评论