Hybrid combinators for distributed evaluation of functional programs = 함수 프로그램의 분산 수행을 위한 하이브리드 컴비네이터

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 230
  • Download : 0
This pater presents a strategy for automatically decomposing functional programs into new combinatiors with an optimal grain and distributing them on distributied-memory multicomputers. The program transformation technique proposed here accepts a lambda expression and generates program-derived combinators which are fine-tuned to have a right granularity for a given multiprocessor architectrue. The right granularity is decided by analyzing the weight for each program-derived combinator during translation. We call aprogram-derived combinator at just the right level of granularity the hybird combinator, whcih is composed of a fixed set of combinators suitable for spawning the parallel elements and partitioning them. The hybrid combinator provides an alternative method to the representation and synchronization of processes. This pater shows the parallel graph reduction process, where the hybrid combinators act as the controlling mechanisms by directing when and which subgraph is to be distributed.
Advisors
Cho, Jung-Wan조정완
Description
한국과학기술원 : 전산학과,
Publisher
한국과학기술원
Issue Date
1991
Identifier
61705/325007 / 000785179
Language
eng
Description

학위논문(박사) - 한국과학기술원 : 전산학과, 1991.2, [ [vi], 80 p. ]

URI
http://hdl.handle.net/10203/32984
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=61705&flag=dissertation
Appears in Collection
CS-Theses_Ph.D.(박사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0