Polymorphic computing abstraction for heterogeneous architectures

Simple item page
dc.contributor.advisor Akhilesh Tyagi
dc.contributor.author Ponpandi, Swamy
dc.contributor.department Electrical and Computer Engineering
dc.date 2018-08-11T13:53:30.000
dc.date.accessioned 2020-06-30T02:57:53Z
dc.date.available 2020-06-30T02:57:53Z
dc.date.copyright Thu Jan 01 00:00:00 UTC 2015
dc.date.embargo 2001-01-01
dc.date.issued 2015-01-01
dc.description.abstract <p>Integration of multiple computing paradigms onto system on chip (SoC) has pushed the boundaries of design space exploration for hardware architectures and computing system software stack. The heterogeneity of computing styles in SoC has created a new class of architectures referred to as Heterogeneous Architectures. Novel applications developed to exploit the different computing styles are user centric for embedded SoC. Software and hardware designers are faced with several challenges to harness the full potential of heterogeneous architectures. Applications have to execute on more than one compute style to increase overall SoC resource utilization. The implication of such an abstraction is that application threads need to be polymorphic. Operating system layer is thus faced with the problem of scheduling polymorphic threads. Resource allocation is also an important problem to be dealt by the OS. Morphism evolution of application threads is constrained by the availability of heterogeneous computing resources. Traditional design optimization goals such as computational power and lower energy per computation are inadequate to satisfy user centric application resource needs. Resource allocation decisions at application layer need to permeate to the architectural layer to avoid conflicting demands which may affect energy-delay characteristics of application threads. We propose Polymorphic computing abstraction as a unified computing model for heterogeneous architectures to address the above issues. Simulation environment for polymorphic applications is developed and evaluated under various scheduling strategies to determine the effectiveness of polymorphism abstraction on resource allocation. User satisfaction model is also developed to complement polymorphism and used for optimization of resource utilization at application and network layer of embedded systems.</p>
dc.format.mimetype application/pdf
dc.identifier archive/lib.dr.iastate.edu/etd/14608/
dc.identifier.articleid 5615
dc.identifier.contextkey 8049364
dc.identifier.doi https://doi.org/10.31274/etd-180810-4161
dc.identifier.s3bucket isulib-bepress-aws-west
dc.identifier.submissionpath etd/14608
dc.identifier.uri https://dr.lib.iastate.edu/handle/20.500.12876/28793
dc.language.iso en
dc.source.bitstream archive/lib.dr.iastate.edu/etd/14608/Ponpandi_iastate_0097E_15071.pdf|||Fri Jan 14 20:23:30 UTC 2022
dc.subject.disciplines Computer Engineering
dc.subject.keywords Computer Engineering
dc.subject.keywords Heterogeneous Architectures
dc.subject.keywords Network on chips
dc.subject.keywords Polymorphism
dc.subject.keywords Scheduling
dc.subject.keywords User satisfaction
dc.title Polymorphic computing abstraction for heterogeneous architectures
dc.type article
dc.type.genre dissertation
dspace.entity.type Publication
relation.isOrgUnitOfPublication a75a044c-d11e-44cd-af4f-dab1d83339ff
thesis.degree.level dissertation
thesis.degree.name Doctor of Philosophy
File
Original bundle
Now showing 1 - 1 of 1
Name:
Ponpandi_iastate_0097E_15071.pdf
Size:
4.82 MB
Format:
Adobe Portable Document Format
Description:
Download
Collections
Theses and Dissertations