Tightening the bounds on feasible preemption points

Show simple item record

dc.contributor.author Ramaprasad, Harini
dc.contributor.author Mueller, Frank
dc.date.accessioned 2007-01-04T20:00:40Z
dc.date.available 2007-01-04T20:00:40Z
dc.date.issued 2005
dc.identifier.uri ftp://ftp.ncsu.edu/pub/unity/lockers/ftp/csc_anon/tech/2005/TR-2005-48.pdf
dc.identifier.uri http://www.lib.ncsu.edu/resolver/1840.4/835
dc.format.extent 266179 bytes
dc.format.mimetype application/pdf
dc.format.mimetype application/pdf
dc.language.iso en
dc.publisher North Carolina State University. Dept. of Computer Science
dc.relation.ispartofseries TR-2005-48
dc.relation.ispartofseries Department of Computer Science Technical Report
dc.title Tightening the bounds on feasible preemption points
dc.type Technical report

Files in this item

Files Size Format View
TR-2005-48.pdf 259.9Kb PDF View/Open

This item appears in the following Collection(s)

Show simple item record