Serwis Infona wykorzystuje pliki cookies (ciasteczka). Są to wartości tekstowe, zapamiętywane przez przeglądarkę na urządzeniu użytkownika. Nasz serwis ma dostęp do tych wartości oraz wykorzystuje je do zapamiętania danych dotyczących użytkownika, takich jak np. ustawienia (typu widok ekranu, wybór języka interfejsu), zapamiętanie zalogowania. Korzystanie z serwisu Infona oznacza zgodę na zapis informacji i ich wykorzystanie dla celów korzytania z serwisu. Więcej informacji można znaleźć w Polityce prywatności oraz Regulaminie serwisu. Zamknięcie tego okienka potwierdza zapoznanie się z informacją o plikach cookies, akceptację polityki prywatności i regulaminu oraz sposobu wykorzystywania plików cookies w serwisie. Możesz zmienić ustawienia obsługi cookies w swojej przeglądarce.
An efficient parallel algorithm for a new permutation generation method is presented. The crucial task in our permutation generation algorithm is starter sets generation where listing n! permutation is dependent on starter sets. Thus the task of starter sets generation is partitioned. However the parallel algorithm with 12 initial starter sets is less efficient when numbers of processors are more...
A parallel implementation of a DCT-based motion estimation algorithm (DXT-ME) for 2D images/signals is presented for a parallel scalable DSP system called PARNEU. PARNEU was used to test the performance of the parallelism. The DCT-based motion estimation can be used for video coding instead of the more frequently used full search block-matching approach (BKM-ME). The DCT-based system has lower computational...
A scalable realisation of a two dimensional (2D) fast wavelet transform (FWT) is presented and compared to an earlier implementation of discrete wavelet transform (DWT), which uses matrix multiplication method. Parallelisation and mapping possibilities are analysed. The main emphasis is in minimising communication requirements and utilising local communication. Measured performance figures verify...
Present paper shows that the system of residual classes is quite promising for usage in modern computing systems, especially for performing operations with multi-digit numbers. The analytical expressions and the conditions which allowed calculating all versions of modules for a given number in perfect shape system of residual classes were obtained.
Complex networks are relational data sets commonly represented as graphs. The analysis of their intricate structure is relevant to many areas of science and commerce, and data sets may reach sizes that require distributed storage and processing. We describe and compare programming models for distributed computing with a focus on graph algorithms for large-scale complex network analysis. Four frameworks...
After studying the compressed sensing theory and its main reconstruction algorithm-Matching Pursuit (MP) algorithm, this paper proposes a new approach to improve the speed of MP algorithm, and it describes how to build a Beowulf parallel computing system with 8 PCs. Its parallel computations is implemented by Message-Passing-Interface(MPI), and a 100Mb/s high speed Ethernet network interconnects all...
Major goal in designing multicomputer networks is to include fault tolerance capability so that the system can continue to operate correctly after losing some of its basic components. This is usually achieved by introducing redundancy, i.e., Adding spare processors and links to the network. However, due to the limitation on the number of links adjacent to a node in VLSI design, it is important to...
The contribution tries to sketch the development of a certain kind of technology, namely user-specific computational technologies which promise an increase in gaining individual freedom. It was a promise that increasingly led to a predominance of managed 'freedoms' and hence, to an increased formatization of technical tools and individual perception alike. The overall effect was that a seemingly increase...
A terrain aided navigation algorithm has been developed through off-line trials which is suited for operations on an underwater glider. This method has been developed to enable persistent measurements using underwater gliders in regions where surface access is difficult or not possible. The algorithm is based on a jittered bootstrap particle filter. During two sets of off-line trials composed of a...
This article briefly describes the development of our country's new scientific direction -- the "programming automation", and recounts the most significant developments of programming languages, compilers and operating systems. Special attention is paid to the development of automating the or biter's "BURAN" on-board software, as well as the software for testing and prelaunch of...
Internal memory devices and systems of four generations of computers and computer systems have been considered in this paper. These devices and systems were developed by M.A. Kartsev and under his supervision since early 1950s until 1983, from the computer M-2 to the system M-13. Features and positive properties of memory developments have been noted. They have largely determined high performance...
Practical realizations of 3D forward/inverse separable discrete transforms, such as Fourier transform, cosine/sine transform, etc. are frequently the principal limiters that prevent many practical applications from scaling to a large number of processors. Specifically, existing approaches, which are based primarily on 1D or 2D data decompositions, prevent the 3D transforms from effectively scaling...
A-Cell is a high-level abstraction of fine-grained parallelism specifically designed to be applicable to all range of parallel devices from super computers based on CPUs or GPUs, to network of embedded devices. To achieve this, A-Cell adopts a programming model called "connectionist computing" and with that takes a leap step away from Turing programming model. Also, in contrast with most...
Today many applications are developed using distributed technologies such as cluster, cloud and grid computing. These applications demand more resources for computation and storage. They demand flexible scaling and improved performance. Application now days can make use of multiple nodes (machines) to get the tasks completed. In this paper we discuss the, implementation details of a grid computing...
For computer systems, it is essential the establishment of policies for reducing consumption and avoiding the waste of energy. However, traditional approaches for retrieving energy consumption information are not suitable for creating effective policies. In this paper, we present a power estimation model that provides detailed information about energy consumption of processors and devices, by applying...
In this paper an implemented software system for identification of best fitting distribution of sample data is described. Some modifications and additions of the known statistical approaches are presented aiming the practical application of the distribution identification task. Additionally the cloud computing approach is applied in order to process the sample data series in parallel that makes significantly...
With the increasing popularity of multicomputers, efficient way of communication within its processors is a popular area of research. Multicomputers refer to a computer system that has multiple processors, they have high computational power and they can perform multiple tasks concurrently. Mesh and Torus are some of the commonly used network topologies in building multicomputer systems. Their performance...
In this paper, we study the problem of optimizing the error generated in the allocation of processing elements to tasks, based on real-time scheduling. The makespan of the tasks to be scheduled is the same, in the computational grid. Tasks to be assigned to processing elements are randomly generated and are mapped to processors. Scheduling is done, considering real-time environment and mapping is...
This paper presents a hierarchical formal verification method for cryptographic processors based on a combination of a word-level computer algebra procedure and a bit-level decision procedure using PPRM (Positive Polarity Reed-Muller) expansion. In the proposed method, the entire datapath structure of a cryptographic processor is described in the form of a hierarchical graph . The correctness of the...
Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.