Publ3 search

Z6_60GI02O0O8IDC0QEJUJ26TJDI4

Error:

Javascript is disabled in this browser. This page requires Javascript. Modify your browser's settings to allow Javascript to execute. See your browser's documentation for specific instructions.

Publikační činnost

Probíhá načítání, čekejte prosím...

Record type:	stať ve sborníku (D)
Home Department:	Katedra informatiky a počítačů (31400)
Title:	Parallelization of Process Functional Language
Citace	Běhálek, M. a Šaloun, P. Parallelization of Process Functional Language. In: ECI 2006. Košice, Slovensko: TU Košice, 2006. TU Košice, 2006. s. 168-174. ISBN 80-8073-598-0.

Subtitle
Publication year:	2006
Obor:	Využití počítačů, robotika a její aplikace
Number of pages:	6
Page from:	168
Page to:	174
Form of publication:
ISBN code:	80-8073-598-0
ISSN code:
Proceedings title:	ECI 2006
Proceedings:
Publisher name:	TU Košice
Place of publishing:	Košice, Slovensko
Country of Publication:	Sborník vydaný v zahraničí
Název konference:	Electronic Computers and Informatics
Místo konání konference:	Herlany, Slovensko
Datum zahájení konference:
Typ akce podle státní příslušnosti účastníků:	Evropská akce
WoS code:
EID:

Key words in English:	process functional language; parallel; skeleton
Annotation in original language:	A Process Functional Programming Language (PFL) was developed to integrate good properties of imperative programming languages and functional programming languages. This article aims on a parallelization of PFL. Parallel programming is inherently harder than sequential programming. A programmer must not only describe what to compute, but also how to organize sub computations on the target architecture. This article describes different approaches for a parallelization of functional languages. Especially it concerns about algorithmic skeletons. This approach was used for parallelization of PFL.
Annotation in english language:	A Process Functional Programming Language (PFL) was developed to integrate good properties of imperative programming languages and functional programming languages. This article aims on a parallelization of PFL. Parallel programming is inherently harder than sequential programming. A programmer must not only describe what to compute, but also how to organize sub computations on the target architecture. This article describes different approaches for a parallelization of functional languages. Especially it concerns about algorithmic skeletons. This approach was used for parallelization of PFL.

References

Reference

R01:	RIV/61988987:17310/06:A1000HEM

Complementary Content

${loading}