From: <jsa...@us...> - 2008-11-14 21:07:29
|
Revision: 103 http://flexotask.svn.sourceforge.net/flexotask/?rev=103&view=rev Author: jsauerbach Date: 2008-11-14 21:07:25 +0000 (Fri, 14 Nov 2008) Log Message: ----------- Provide full text links for paper. Modified Paths: -------------- trunk/flexotask/doc/flexotaskProgramming.html Modified: trunk/flexotask/doc/flexotaskProgramming.html =================================================================== --- trunk/flexotask/doc/flexotaskProgramming.html 2008-11-14 21:04:52 UTC (rev 102) +++ trunk/flexotask/doc/flexotaskProgramming.html 2008-11-14 21:07:25 UTC (rev 103) @@ -89,28 +89,47 @@ <p>The Flexible Task Graph systems is described in a paper in LCTES 2008, and the four programming models that it consolidates are each -described in an earlier paper. Here are links to all five papers. +described in an earlier paper. The Exotask work (which formed the +codebase that was extended to create the present codebase) also has a +longer paper that has been accepted but not yet published. Links to all six +papers are given here. <ul> -<li><a href="http://portal.acm.org/citation.cfm?id=1375659">Flexible +<li><a +href="http://domino.research.ibm.com/comm/research_people.nsf/pages/bacon.refereed-pubs.html/$FILE/Auerbach08Flexible-final.pdf">Flexible task graphs: a unified restricted thread programming model for java</a> by Joshua Auerbach, David F. Bacon, Rachid Guerraoui, Jesper -Honig Spring, and Jan Vitek, published in LCTES 2008. +Honig Spring, and Jan Vitek, published in LCTES 2008. Describes the present work. + <li><a -href="http://portal.acm.org/citation.cfm?id=1133255.1134015">Eventrons: +href="http://domino.research.ibm.com/comm/research_people.nsf/pages/bacon.refereed-pubs.html/$FILE/Spoonhower06Eventrons.pdf">Eventrons: a Safe Programming Construct for High-frequency Hard Real-time Applications</a> by D. Spoonhower, J. Auerbach, D. F. Bacon, P. -Cheng, and D. Grove, published in PLDI 2006. -<li><a href="http://portal.acm.org/citation.cfm?id=1254775">Java Takes -Flight: Time-portable Real-time Programming with Exotasks</a> by -J.Auerbach, D. F. Bacon, D. T. Iercan, C. M. Kirsch, V. T. Rajan, -H. R. Roeck, and R. Trummer, published in LCTES 2007 -<li><a href="http://portal.acm.org/citation.cfm?id=1254837">Reflexes: +Cheng, and D. Grove, published in PLDI 2006. + +<li><a +href="http://domino.research.ibm.com/comm/research_people.nsf/pages/bacon.refereed-pubs.html/$FILE/Auerbach07Java.pdf"> +Java Takes Flight: Time-portable Real-time Programming with Exotasks +</a> by J.Auerbach, D. F. Bacon, D. T. Iercan, C. M. Kirsch, +V. T. Rajan, H. R. Roeck, and R. Trummer, published in LCTES 2007 + +<li><a +href="http://domino.research.ibm.com/comm/research_people.nsf/pages/bacon.refereed-pubs.html/$FILE/Auerbach08LowLatency-submission.pdf">Low-Latency +Time-Portable Real-Time Programming with Exotasks</a> by J.Auerbach, +D. F. Bacon, D. T. Iercan, C. M. Kirsch, V. T. Rajan, H. R. Roeck, +and R. Trummer, accepted by TECS. A more detailed treatment of +Exotasks that also described the integration with Eventrons, a +precursor to this work. + +<li><a +href="http://www.cs.purdue.edu/homes/jv/pubs/VEE07.pdf">Reflexes: abstractions for highly responsive systems</a> by J. Spring, F. Pizlo, -R. Guerraoui, and J. Vitek, published in VEE 2007. -<li><a href="http://portal.acm.org/citation.cfm?id=1297043">Streamflex: -high-throughput stream programming in java</a> by J. Spring, J. Privat, -R. Guerraoui, J. Vitek, published in OOPSLA 2007 +R. Guerraoui, and J. Vitek, published in VEE 2007. + +<li><a +href="http://www.cs.purdue.edu/homes/jv/pubs/oopsla07.pdf">Streamflex: +high-throughput stream programming in java</a> by J. Spring, +J. Privat, R. Guerraoui, J. Vitek, published in OOPSLA 2007 </ul> <br><hr><h2><a name="application"></a>Notes for Application Programmers</h2> @@ -1022,7 +1041,7 @@ another area. <p>As mentioned in the Flexible Task Graphs paper and explained in -more detail in the LCTES 2007 Exotasks paper, the way that real-time +more detail in the two Exotasks papers, the way that real-time scheduling is expressed can vary according to the choice of a timing grammar. There are always at least two choices provided, but there will be more if additional timing grammar plugins have been installed. This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site. |