Efficient Storage Management for Temporary Values in Concurrent Programming Languages
暂无分享,去创建一个
[1] Brian A. Wichmann,et al. Rationale for the design of the Ada programming language , 1979, SIGP.
[2] John K. Ousterhout,et al. Scheduling Techniques for Concurrent Systems , 1982, ICDCS.
[3] Niklaus Wirth,et al. Modula: A language for modular multiprogramming , 1977, Softw. Pract. Exp..
[4] David R. Ditzel,et al. Register allocation for free: The C machine stack cache , 1982, ASPLOS I.
[5] Mary Lou Soffa,et al. The Performance Evaluation of Control Implementations , 1982, IEEE Transactions on Software Engineering.
[6] John K. Ousterhout. Scheduling Techniques for Concurrebt Systems. , 1982, ICDCS 1982.
[7] Laszlo A. Belady,et al. Dynamic space-sharing in computer systems , 1969, Commun. ACM.
[8] George Radin,et al. The 801 minicomputer , 1982, ASPLOS I.
[9] Butler W. Lampson,et al. On the transfer of control between contexts , 1974, Symposium on Programming.
[10] Daniel G. Bobrow,et al. A model and stack implementation of multiple environments , 1973, CACM.
[11] Butler W. Lampson,et al. Fast procedure calls , 1982, ASPLOS I.
[12] Per Brinch Hansen,et al. The Architecture of Concurrent Programs , 1977 .
[13] Richard K. Johnsson,et al. An overview of the mesa processor architecture , 1982, ASPLOS I.
[14] John K. Ousterhout,et al. Medusa: An experiment in distributed operating system structure (Summary) , 1979, SOSP '79.
[15] Niklaus Wirth. Design and implementation of modula , 1977, Softw. Pract. Exp..
[16] Richard L. Sites. How to Use 1000 Registers , 1979 .
[17] Andrew S. Tanenbaum,et al. Implications of structured programming for machine architecture , 1978, CACM.