Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
An Implementation of the Vat Programming Abstraction
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology.
2016 (Belarusian)Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
Abstract [en]

When the hardware industry hit the power-wall around the year 2005,increasing computer performance through increasing the clock-speed wasno longer a practical option. The only practical way to ensure increasingperformance where to start using multi core CPUs. This shifted the bur-den of computing performance to the programmer. But with parallel pro-gramming came many problems due to concurrent programmings inherentlack of causality. Reactive programming is a programming paradigm forconcurrent programming that provides a layer for abstracting away theintricacies of handling external concurrent events.In this thesis we have been implementing and examining Vats which isa reactive storage abstraction that offers to provide safety and a flexible way ofgoverning behavior and synchronization of data flow in an event driven program. Wehave made some comparisons between Vats and other known storage abstractionsfor reactive programming and we have also used Vats to implement the generation ofscale free graphs in order to see how they can be used to solve actual problems.This thesis contains the first ever implementation and application ofVats and as such no firm conclusions can be drawn regarding their power andusefulness, but during this implementation and evaluation, no major shortcomings orissues that could not be fixed have been encountered. The brief comparison betweenVats and the other known reactive storage constructs gives an indications that Vatshave a greater expressive power than the constructs compared against. The issuesthat where resolved during the implementation of Vats have provided a betterunderstanding of how Vats are to work as a practical tool for programmers. Eventhough we draw no conclusions about Vats in this thesis we do find that they areconceptually sound and that further testing and implementation wouldnot be a waste of time.

Place, publisher, year, edition, pages
2016. , p. 42
Series
IT ; 16091
National Category
Engineering and Technology
Identifiers
URN: urn:nbn:se:uu:diva-310990OAI: oai:DiVA.org:uu-310990DiVA, id: diva2:1058323
Educational program
Bachelor Programme in Computer Science
Supervisors
Examiners
Available from: 2016-12-20 Created: 2016-12-20 Last updated: 2016-12-20Bibliographically approved

Open Access in DiVA

fulltext(723 kB)77 downloads
File information
File name FULLTEXT01.pdfFile size 723 kBChecksum SHA-512
156fa032eb8885e038b8a7c77b86b08c3f91e2c85da83157c3c531cf0d279baa92f4f8dec5f147aca8658c928c3cc161fc75e17ac2589ce2ccb57626bd41f040
Type fulltextMimetype application/pdf

By organisation
Department of Information Technology
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar
Total: 77 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 445 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf