Show simple item record

dc.contributor.advisorAykanat, Cevdet
dc.contributor.authorBultan, Tevfik
dc.date.accessioned2016-01-08T20:09:49Z
dc.date.available2016-01-08T20:09:49Z
dc.date.issued1992
dc.identifier.urihttp://hdl.handle.net/11693/17384
dc.descriptionAnkara : Department of Computer Engineering and Information Science and the Institute of Engineering and Science of Bilkent University, 1992.en_US
dc.descriptionThesis (Master's) -- Bilkent University, 1992.en_US
dc.descriptionIncludes bibliographical references.en_US
dc.description.abstractMoan Field Annealinp; (MFA) aJgoritlim, receñí,ly proposc'd for solving com binatorial optimization problems, combines the characteristics of nenral networks and simulated annealing. In this thesis, MFA is formulated for tlie mapping i)roblcm and the circuit partitioning problem. EHicient implementation schemes, which decrease the complexity of the proposed algorithms by asymptotical factors, are also given. Perlormances of the proposed MFA algorithms are evaluated in comparison with two well-known heuristics: simulated annealing and Kernighan-Lin. Results of the experiments indicate that MFA can be used as an alternative heuristic for the mapping problem and the circuit partitioning problem. Inherent parallelism of the MFA is exploited by designing efficient parallel algorithms for the proposed MFA heuristics. Parallel MFA algorithms proposed for solving the circuit partitioning problem are implemented on an iPS(J/2’ hypercube multicompute.r. Experimental results show that the proposed heuristics can be efficiently parallelized, which is crucial for algorithms that solve such computationally hard problems.en_US
dc.description.statementofresponsibilityBultan, Tevfiken_US
dc.format.extentxii, 69 leavesen_US
dc.language.isoEnglishen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectMean Field Annealingen_US
dc.subjectNeural Networksen_US
dc.subjectSimulated Annealingen_US
dc.subjectCombinatorial Optimizationen_US
dc.subjectMapping Problemen_US
dc.subjectCircuit Partitioning Problemen_US
dc.subjectParallel Processingen_US
dc.subjectMulticomputersen_US
dc.subject.lccQA402.5 .B85 1992en_US
dc.subject.lcshSimulated annealing (Mathematics).en_US
dc.subject.lcshMathematical optimization.en_US
dc.titleParallel mapping and circuit partitioning heuristics based on mean field annealingen_US
dc.typeThesisen_US
dc.departmentDepartment of Computer Engineeringen_US
dc.publisherBilkent Universityen_US
dc.description.degreeM.S.en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record