Please use this identifier to cite or link to this item:
http://localhost:8081/xmlui/handle/123456789/9209
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Katiyar, Ela | - |
dc.date.accessioned | 2014-11-18T11:23:10Z | - |
dc.date.available | 2014-11-18T11:23:10Z | - |
dc.date.issued | 1990 | - |
dc.identifier | M.Tech | en_US |
dc.identifier.uri | http://hdl.handle.net/123456789/9209 | - |
dc.guide | Gupta, J. P. | - |
dc.description.abstract | Next generation of computer is aimed to achieve increased performance by exploiting the inherent parallelism existing in problem and using a large number of cheep processor chips available through VLSI technology. Declarative languages based on lambda calculus are known as function languages. They allow parallel evaluation in a natural manner and lack the notion of assignment. These languages can be used to progran a large number of chips with no side effects introduced. The lambda calculus possesses several features of programming languages but still has a simple syntax. The Beta reduction rule is the basic- reduction rule of lambda calculus. Lambda expressions can be evaluated in normal order or in applicative order and these orders can be implemented through string or graph reduction. The G machine developed by Johnsson and Augustossn is a fast implementation of graph reduction based on supercombina-tor compilation. It takes imput as.a supercombinator definition and utilizes fast recursion. The execution speed can be further increased by executing G code in parallel. In present work an algorithm is developed which checks the inherent parallelism in any problem and executes independent G codes in parallel. This is implemented through pipelined data driven computation model in which executable packets consisting of G codes and other information are processed in a pipeline of several processors. | en_US |
dc.language.iso | en | en_US |
dc.subject | ELECTRONICS AND COMPUTER ENGINEERING | en_US |
dc.subject | SUPERCOMBINATOR PROGRAM | en_US |
dc.subject | DATA FLOW MACHINE | en_US |
dc.subject | GRAPH REDUCTION | en_US |
dc.title | PARALLEL EVALUATION OF SUPERCOMBINATOR PROGRAM ON A DATA FLOW MACHINE- | en_US |
dc.type | M.Tech Dessertation | en_US |
dc.accession.number | 245283 | en_US |
Appears in Collections: | MASTERS' THESES (E & C) |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
ECD245283.pdf | 3.22 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.