Talk:COMP 3000 Essay 1 2010 Question 7

Group 7

Let us start out by listing down our names and email id (preffered).

Gautam Akiwate <gautam.akiwate@gmail.com>

Patrick Young(rannath) <rannath@gmail.com>

Essay Rough

Start by placing the info here so we can sort through it. I'm going to go into full research/essay writing mode on Sunday if there isn't enough here.

So far I have: Three design choices I've seen:

Smallest possible footprint per-thread (being extremely light weight) - from everywhere --Rannath 00:28, 7 October 2010 (UTC)
least number (none if at all possible) of context switches per-thread - some linux implementation --Rannath 00:28, 7 October 2010 (UTC)
use of a "thread pool" - java picothreads article --Rannath 00:28, 7 October 2010 (UTC)

The idea is to reduce processor time and storage needed per-thread so you can have more in the same amount of space.--Rannath 00:28, 7 October 2010 (UTC)

Sources

A Webpage. However found it really interesting. NPTL: The New Implementation of Threads for Linux Gautam 22:18, 5 October 2010 (UTC)

Implementation of Scalable Blocking Locks using an Adaptative Thread Scheduler Gautam 22:11, 5 October 2010 (UTC)

A paper with low-footprint(lightweight) threads vs kernel threads (for Java :( ) http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.32.9043&rep=rep1&type=pdf --Rannath 00:23, 6 October 2010 (UTC)

a comparison of lightweight threads http://eigenclass.org/hiki/lightweight-threads-with-lwt --Rannath 00:23, 6 October 2010 (UTC)

a lightwight thread implementation for Unix http://www.usenix.org/publications/library/proceedings/sa92/stein.pdf --Rannath 00:49, 6 October 2010 (UTC)

Gbint 19:50, 5 October 2010 (UTC) Not in this group, but I thought that this paper was excellent: http://www.sandia.gov/~rcmurph/doc/qt_paper.pdf