Fair cooperative multithreading

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4703 LNCS, Issue , 2007, Pages 272-286

  Boudol, Gérard ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CONTEXT FREE GRAMMARS; THEOREM PROVING;

COOPERATIVE MULTITHREADING; FINITE COMPUTATION; STRATIFICATION;

MATHEMATICAL MODELS;

EID: 38149079697     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74407-8_19     Document Type: Conference Paper

References (35)

1. Adya, A., Howell, J., Theimer, M., Bolosky, W.J., Douceur, H.R.: Cooperative task management without manual stack management or, Event-driven programming is not the opposite of threaded programming, Usenix ATC (2002)
2. Anderson, T.E., Bershad, B.N., Lazowska, E.D., Levy, H.M.: Scheduler activations: effective kernel support for the user-level management of parallelism. ACM Trans, on Computer Systems 10(1), 53-79 (1992)
3. Banga, G., Druschel, P., Mogul, J. C.: Better operating sytem features for faster network servers. ACM SIGMETRICS Performance Evaluation Review 26(3), 23-30 (1998)
4. Barendregt, H.: Lambda Calculi with Types. In: Abramsky, S., Gabbay, D.M., Maibaum, T.S.E. (eds.) Handbook of Logic in Computer Science, pp. 117-309. Oxford University Press, Oxford (1992)
5. von Berhen, R., Condit, J., Brewer, E.: Why events are a bad idea (for highconcurrency servers). In: Proceedings of HotOS IX (2003)
6. von Berhen, R., Condit, J., Zhou, F., Necula, G.C., Brewer, E.: Capriccio: scalable threads for Internet services. In: SOSP'03 (2003)
7. Benton, N., Leperchey, B.: Relational reasoning in a nominal semantics for storage. In: Urzyczyn, P. (ed.) TLCA 2005. LNCS, vol. 3461, pp. 86-101. Springer, Heidelberg (2005)
8. Birkedal, L., Harper, R.: Relational interpretation of recursive types in an operational setting. Information and Computation 155(1-2), 3-63 (1999)
9. Bohr, N., Birkedal, L.: Relational reasoning for recursive types and references. In: Kobayashi, N. (ed.) APLAS 2006. LNCS, vol. 4279, pp. 79-96. Springer, Heidelberg (2006)
10. Boudol, G.: ULM, a core programming model for global computing. In: Schmidt, D. (ed.) ESOP 2004. LNCS, vol. 2986, pp. 234-248. Springer, Heidelberg (2004)
11. Boudol, G.: On typing information flow. In: Van Hung, D., Wirsing, M. (eds.) ICTAC 2005. LNCS, vol. 3722, pp. 366-380. Springer, Heidelberg (2005)
12. Boussinot, F.: FairThreads: mixing cooperative and preemptive threads in C. Concurrency and Computation: Practice and Experience 18, 445-469 (2006)
13. Dabrowski, F., Boussinot, F.: Cooperative threads and preemptive computations. In: Proceeding of TV'06, Workshop on Multithreading in Hardware and Software: Formal Approaches to Design and Verification, FLoC'06 (2006)
14. Epardaud, S.: Mobile reactive programming in ULM. In: Proc. of the Fifth ACM SIGPLAN Workshop on Scheme and Functional Programming, pp. 87-98. ACM Press, New York (2004)
15. Filliâtre, J.-C.: Verification of non-functional programs using interpretations in type theory. J. Functional Programming 13(4), 709-745 (2003)
16. Girard, J.-Y., Lafont, Y., Taylor, P.: Proofs and Types. Cambridge Tracts in Theoretical Computer Science, vol. 7. Cambridge University Press, Cambridge (1989)
17. Kleene, S.C.: On the interpretation of intuitionistic number theory. J. of Symbolic Logic 10, 109-124 (1945)
18. Krivine, J.-L.: Lambda-Calcul: Types et Modèles, Masson, Paris (1990). English translation Lambda-Calculus, Types and Models, Ellis Horwood (1993)
19. Landin, P.J.: The mechanical evaluation of expressions. Computer Journal 6, 308-320 (1964)
20. Lucassen, J.M., Gifford, D.K.: Polymorphic effect systems. In: POPL'88, pp. 47-57 (1988)
21. Mandel, L., Pouzet, M.: ReactiveML, a reactive extension to ML. In: PPDP'05, pp. 82-93 (2005)
22. Mitchell, J.C.: Foundations for Programming Languages. MIT Press, Cambridge (1996)
23. Ousterhout, J.: Why threads are a bad idea (for most purposes), presentation given at the 1996 Usenix ATC (1996)
24. Pitts, A., Stark, I.: Operational reasoning for functions with local state. In: Gordon, A., Pitts, A. (eds.) Higher-Order Operational Techniques in Semantics, pp. 227-273. Publication of the Newton Institute, Cambridge Univ. Press (1998)
25. Plotkin, G.: Lambda-definability and logical relations. Memo SAI-RM-4, University of Edinburgh (1973)
26. Pucella, R.: Reactive programming in Standard ML. In: IEEE Intern. Conf. on Computer Languages, pp. 48-57. IEEE Computer Society Press, Los Alamitos (1998)
27. Sangiorgi, D.: Termination of processes. Math. Struct, in Comp. Science 16, 1-39 (2006)
28. Serrano, M., Boussinot, F., Serpette, B.: Scheme fair threads. In: PPDP'04, pp. 203-214 (2004)
29. Talpin, J.-P., Jouvelot, P.: The type and effect discipline. Information and Computation 111, 245-296 (1994)
30. Tait, W.: Intensional interpretations of functionals of finite type I. J. of Symbolic Logic 32, 198-212 (1967)
31. Tait, W.: A realizability interpretation of the theory of species. Logic Colloquium, Lecture Notes in Mathematics, vol. 453, pp. 240-251 (1975)
32. Tofte, M., Talpin, J.-P.: Region-based memory management. Information and Computation 132(2), 109-176 (1997)
33. Welsh, M., Culler, D., Brewer, E.: SEDA: an architecture for well-conditioned, scalable internet services. In: SOSP'01, pp. 230-243 (2001)
34. Wright, A., Felleisen, M.: A syntactic approach to type soundness. Information and Computation 115(1), 38-94 (1994)
35. Yoshida, N., Berger, M., Honda, K.: Strong normalisation in the π-calculus. Information and Computation 191(2), 145-202 (2004)