The Movidius Myriad1 Platform is a multicore embedded platform primed to offer high performance and power efficiency for computer vision applications in mobile devices. The challenges of programming multicore environments are well known and skeleton programming offers a high-level programming alternative for parallel computing, intended to hide the complexities of the system from the programmer. The SkePU Skeleton Programming Framework includes backend implementations for CPU and GPU systems and it has the capacity to support more platforms by extending its backend implementations. With this master thesis project we aim to extend the SkePU Skeleton Programming Framework to provide support for execution in the Movidius Myriad1 embedded platform. Our SkePU backend for Myriad1 consists on a set of macros and functions to compose the different elements of a Myriad1 application, data communication structures to exchange data between the host systems and Myriad1, and a helper script and auxiliary files to generate a Myriad1 application.Evaluation and testing demonstrate that our backend is usable, however further optimizations are needed to obtain good performance that would make it practical to use in real life applications, particularly when it comes to data communication. As part of this project, we have outlined some improvements that could be applied to obtain better performance overall in the future, addressing the issues found with the methods of data communication.

No description available.

Thesis (Ph. D.)--Virginia Polytechnic Institute, 1975. / Also available via the Internet.

No description available.

published_or_final_version / abstract / Mathematics / Master / Master of Philosophy

No description available.

The existing component protocols, as well as new protocols introduced at runtime into NPSNET-V are written in their native programming language. As a result, they require authoring and compiling by a trained programmer. The long time frame required to change or introduce new protocols into NPSNET-V, a dynamically extensible virtual environment, detracts from the dynamicism of the virtual environment. Networking optimization thresholds to support NPSNET-V needed to be determined to ensure that the networking is performed efficiently, and system resources to other systems, such as graphics rendering, are maximized. This thesis implements component protocols described using Extensible Markup Language (XML) into NPSNET-V. These protocols are created with different fidelity resolutions for each protocol, which can be swapped at runtime based on the network state. Network testing was performed to find the ideal maximum packet rates based on the impact on CPU utilization and packet loss. By using XML, non-programmers can edit protocols for inclusion in a simulation at runtime. Important contributions include adding protocols to NPSNET-V with high-resolution and low-resolution versions, described by XML documents. Basic network optimization is added to NPSNET-V to take advantage of the protocolsα resolution switching ability. The network testing revealed a linear correlation between the packet sending rate and CPU utilization, and a polynomial correlation between the packet sending rate and percentage packet loss. / US Army (USA) author

by Yung Wai Lok. / Bibliography: leaves 36-37 / Thesis (M.Ph.)--Chinese University of Hong Kong, 1984

Wang Qing. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2006. / Includes bibliographical references (leaves 72-74). / Abstracts in English and Chinese. / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Literature survey --- p.2 / Chapter 1.2 --- Research carried out in this thesis --- p.4 / Chapter 2 --- Conventional Dynamic Programming --- p.7 / Chapter 2.1 --- Principle of optimality and decomposition --- p.7 / Chapter 2.2 --- Backward dynamic programming --- p.12 / Chapter 2.3 --- Forward dynamic programming --- p.15 / Chapter 2.4 --- Curse of dimensionality --- p.19 / Chapter 2.5 --- Singly constrained case --- p.21 / Chapter 3 --- Surrogate Constraint Formulation --- p.24 / Chapter 3.1 --- Conventional surrogate constraint formulation --- p.24 / Chapter 3.2 --- Surrogate dual search --- p.26 / Chapter 3.3 --- Nonlinear surrogate constraint formulation --- p.30 / Chapter 4 --- Convergent Surrogate Constraint Dynamic Programming: Objective Level Cut --- p.38 / Chapter 5 --- Convergent Surrogate Constraint Dynamic Programming: Domain Cut --- p.44 / Chapter 6 --- Computational Results and Analysis --- p.60 / Chapter 6.1 --- Sample problems --- p.61 / Chapter 7 --- Conclusions --- p.70

Typescript (photocopy). / Digitized by Kansas Correctional Industries / Department: Computer Science.