Please use this identifier to cite or link to this item: http://localhost:8081/xmlui/handle/123456789/9209
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKatiyar, Ela-
dc.date.accessioned2014-11-18T11:23:10Z-
dc.date.available2014-11-18T11:23:10Z-
dc.date.issued1990-
dc.identifierM.Techen_US
dc.identifier.urihttp://hdl.handle.net/123456789/9209-
dc.guideGupta, J. P.-
dc.description.abstractNext 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.isoenen_US
dc.subjectELECTRONICS AND COMPUTER ENGINEERINGen_US
dc.subjectSUPERCOMBINATOR PROGRAMen_US
dc.subjectDATA FLOW MACHINEen_US
dc.subjectGRAPH REDUCTIONen_US
dc.titlePARALLEL EVALUATION OF SUPERCOMBINATOR PROGRAM ON A DATA FLOW MACHINE-en_US
dc.typeM.Tech Dessertationen_US
dc.accession.number245283en_US
Appears in Collections:MASTERS' DISSERTATIONS (E & C)

Files in This Item:
File Description SizeFormat 
ECD245283.pdf3.22 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.