Provably efficient scheduling for relaxed multithreaded computations

Provably efficient scheduling for relaxed multithreaded computations

In this thesis, we study the problem of efficient scheduling of the dynamic parallel multi-threaded computation in terms of their execution time, space requirements and communication cost.

Saved in:
Bibliographic Details
Main Author: Gordienko, Maksim.
Other Authors: Hsu, Wen Jing
Format: Theses and Dissertations
Published: 2008
Subjects:
DRNTU::Engineering::Computer science and engineering::Computer systems organization::Computer-communication networks
Online Access:http://hdl.handle.net/10356/2639
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Description
Summary:In this thesis, we study the problem of efficient scheduling of the dynamic parallel multi-threaded computation in terms of their execution time, space requirements and communication cost.

Similar Items