Use of parallelism in finite state machines. Mathematical level

Krivoulya, G. F.; Nemchenko, O.

Публікація:
Use of parallelism in finite state machines. Mathematical level

dc.contributor.author	Krivoulya, G. F.
dc.contributor.author	Nemchenko, O.
dc.date.accessioned	2016-09-06T08:34:47Z
dc.date.available	2016-09-06T08:34:47Z
dc.date.issued	2004
dc.description.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 [1]. 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.	uk_UA
dc.identifier.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)	uk_UA
dc.identifier.uri	http://openarchive.nure.ua/handle/document/2131
dc.language.iso	en	uk_UA
dc.publisher	EWDTW	uk_UA
dc.subject	Parallelism	uk_UA
dc.subject	FSM	uk_UA
dc.subject	thread	uk_UA
dc.subject	process	uk_UA
dc.subject	asynchronous automation	uk_UA
dc.title	Use of parallelism in finite state machines. Mathematical level	uk_UA
dc.type	Article	uk_UA
dspace.entity.type	Publication