Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/2639
Title: Provably efficient scheduling for relaxed multithreaded computations
Authors: Gordienko, Maksim.
Keywords: DRNTU::Engineering::Computer science and engineering::Computer systems organization::Computer-communication networks
Issue Date: 2003
Abstract: 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.
URI: http://hdl.handle.net/10356/2639
Rights: Nanyang Technological University
Fulltext Permission: restricted
Fulltext Availability: With Fulltext
Appears in Collections:SCSE Theses

Files in This Item:
File Description SizeFormat 
SCE-THESES_65.pdf
  Restricted Access
472.22 kBAdobe PDFView/Open

Google ScholarTM

Check

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.