Open Access. Powered by Scholars. Published by Universities.®
Programming Languages and Compilers Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Software Engineering (4)
- Engineering (2)
- Aeronautical Vehicles (1)
- Aerospace Engineering (1)
- Biochemistry (1)
-
- Biochemistry, Biophysics, and Structural Biology (1)
- Business (1)
- Business Administration, Management, and Operations (1)
- Computer Engineering (1)
- Computer and Systems Architecture (1)
- Databases and Information Systems (1)
- Graphics and Human Computer Interfaces (1)
- Information Security (1)
- Life Sciences (1)
- OS and Networks (1)
- Other Computer Sciences (1)
- Systems Architecture (1)
- Technology and Innovation (1)
- Theory and Algorithms (1)
- Institution
Articles 1 - 6 of 6
Full-Text Articles in Programming Languages and Compilers
On The Interoperability Of Programming Languages Based On The Fork-Join Parallelism Model, Sushek Shekar
On The Interoperability Of Programming Languages Based On The Fork-Join Parallelism Model, Sushek Shekar
Electronic Thesis and Dissertation Repository
This thesis describes the implementation of MetaFork, a meta-language for concurrency platforms targeting multicore architectures. First of all, MetaFork is a multithreaded language based on the fork-join model of concurrency: it allows the programmer to express parallel algorithms assuming that tasks are dynamically scheduled at run-time. While MetaFork makes no assumption about the run-time system, it formally defines the serial C-elision of a MetaFork program. In addition, MetaFork is a suite of source-to-source compilers permitting the automatic translation of multithreaded programs between programming languages based on the fork-join model. Currently, this compilation framework supports the OpenMP and CilkPlus concurrency platforms. …
Reaper – Toward Automating Mobile Cloud Communication, Daniel R. Ward
Reaper – Toward Automating Mobile Cloud Communication, Daniel R. Ward
University of New Orleans Theses and Dissertations
Mobile devices connected to cloud based services are becoming a mainstream method of delivery up-to-date and context aware information to users. Connecting mobile applications to cloud service require significant developer effort. Yet this communication code usually follows certain patterns, varying accordingly to the specific type of data sent and received from the server. By analyzing the causes of theses variations, we can create a system that can automate the code creation for communication from a mobile device to a cloud server. To automate code creation, a general pattern must extracted. This general solution can then be applied to any database …
Type Classes And Instance Chains: A Relational Approach, John Garrett Morris
Type Classes And Instance Chains: A Relational Approach, John Garrett Morris
Dissertations and Theses
Type classes, first proposed during the design of the Haskell programming language, extend standard type systems to support overloaded functions. Since their introduction, type classes have been used to address a range of problems, from typing ordering and arithmetic operators to describing heterogeneous lists and limited subtyping. However, while type class programming is useful for a variety of practical problems, its wider use is limited by the inexpressiveness and hidden complexity of current mechanisms. We propose two improvements to existing class systems. First, we introduce several novel language features, instance chains and explicit failure, that increase the expressiveness of type …
Distortion Tolerant Source Code Using Viterbi Algorithm, Christopher Hankins
Distortion Tolerant Source Code Using Viterbi Algorithm, Christopher Hankins
Electrical Engineering Undergraduate Honors Theses
Convolutional codes are used in digital communication systems in order to protect information from distortion and increase system reliability. One of the most efficient methods for decoding convolutional codes is based on the Viterbi Algorithm. Considering the fundamental similarities between these channel codes and source codes, it is logical to postulate that the Viterbi Algorithm may also provide a basis for the implementation of an efficient lossy source code. In this thesis, the Viterbi Algorithm is used to used to compress digital data from a symmetric Bernoulli source. The Viterbi source code is simulated and shown to produce results which …
Integrated Development And Parallelization Of Automated Dicentric Chromosome Identification Software To Expedite Biodosimetry Analysis, Yanxin Li
Electronic Thesis and Dissertation Repository
Manual cytogenetic biodosimetry lacks the ability to handle mass casualty events. We present an automated dicentric chromosome identification (ADCI) software utilizing parallel computing technology. A parallelization strategy combining data and task parallelism, as well as optimization of I/O operations, has been designed, implemented, and incorporated in ADCI. Experiments on an eight-core desktop show that our algorithm can expedite the process of ADCI by at least four folds. Experiments on Symmetric Computing, SHARCNET, Blue Gene/Q multi-processor computers demonstrate the capability of parallelized ADCI to process thousands of samples for cytogenetic biodosimetry in a few hours. This increase in speed underscores the …
Senior Project Report - Doctest, Stephen Weessies
Senior Project Report - Doctest, Stephen Weessies
Computer Engineering
DocTest is a program that, simply put, allows a programmer or user to document STANAG 4586 (a standard for unmanned aerial vehicle interoperability) messages and test the vehicle system at Lockheed Martin [5]. The program is extensible to allow for further development aiding our software team to do what they do best and not get bogged down in tedious but necessary documentation. DocTest is also used to aid in testing, keeping track of the issues and bugs found and creating a document that captures each issue so an issue is not missed or forgotten. This program was made for use …