Please use this identifier to cite or link to this item:
|Title:||Use of parallelism in finite state machines. Mathematical level|
|Citation:||Krivoulya G. Use of parallelism in finite state machines. Mathematical level/O. Nemchenko, G. Krivoulya//Proceedings of East-West Design & Test Workshop (EWDTW’04)|
|Abstract:||The method of the description of parallel systems using finite state machines is examined. The mathematical model proposed in this article can use both for the description and for synthesis of synchronous and asynchronous parallel systems with usage of abstractions of parallel programming: threads, processes, flags, mutexes, semaphores and complex synchronizations. One of methods of computing systems productivity rising is usage of parallelism in operation. Exists two ways of parallel data processing: strictly parallelism and command pipe . The command pipe is present at personal computers, parallel processing is present, as a rule, in specialized computing systems - on parallel computers. Parallel computer architectures strongly differ one from each other. In There is a problem of code portability - the program fulfilled effectively on one system, practically does not use resources on another. In other words, there is weak program portability and the compiled code for parallel computers. Parallelism can be created on the basis of several computing units. Such system becomes complicated over availability of such units, commutative equipment and interconnection interfaces. It is much better to create the parallel arrangement in one chip with the required architecture. In this case the programmable logic CPLD, FPGA, can be used. In this article the mathematical model of a parallel finite state machine (FSM) digital automaton is discussed which can be used for the description of parallel algorithms and for its synthesis.|
|Appears in Collections:||Кафедра автоматизації проектування обчислювальної техніки (АПОТ)|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.