Quality of Service in an Information Economy

ACM Transactions on Internet Technology

Volumn 3, Issue 4, 2003, Pages 291-333

  Braumand, R ^a   Kemper, A ^a   Kossmann, D ^b  

^a UNIVERSITY OF PASSAU   (Germany)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

Design; Performance; Quality of Service

Indexed keywords

EID: 85011104435     PISSN: 15335399     EISSN: 15576051     Source Type: Journal    
DOI: 10.1145/945846.945847     Document Type: Article

References (40)

1. Agrawal, H and Horgan, J. 1990. Dynamic program slicing. In Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation., ACM, New York, 246-256.
2. Agrawal, H., DeMillo, R., and Spafford, E. 1993. Debugging with dynamic slicing and backtracking. Software Practice and Experience 23, 6, 589-616.
3. Ammons, G. and Larus, J. R. 1998. Improving data flow analysis with path profiles. In Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation., ACM, New York, 72-84.
4. Ball, T. and Larus, J. R. 1996. Efficient path profiling. In Proceedings of the IEEE/ACM International Symposium on Microarchitecture., IEEE/ACM, New York, 46-57.
5. Bodik, R., Gupta, R., and Soffa, M. L. 1998. Complete removal of redundant expressions. In Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation. ACM, New York, 1-14.
6. Burtscher, M. 2004. VPC3: A fast and effective trace-compression algorithm. In Proceedings of the SIGMETRICS Conference., ACM, New York, 167-176.
7. Burtscher, M. and Jeeradit, M. 2003. Compressing extended program traces using value predictors. In Proceedings of the 12th International Conference on Parallel Architectures and Compilation Techniques. IEEE. 159-169.
8. Burtscher, M. and Zorn, B. G. 1999. Exploring last n value prediction. In Proceedings of the International Conference on Parallel Architectures and Compilation Techniques., IEEE., 66-76.
9. Calder, B., Feller, P., and Eustace, A. 1997. Value profiling. In Proceedings of the 30th IEEE/ACM International Symposium on Microarchitecture., IEEE/ACM, New York, 259-269.
10. Chilimbi, T. M. 2001. Efficient representations and abstractions for quantifying and exploiting data reference locality. In Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation., ACM, New York, 191-202.
11. Chilimbi, T. M. and Hirzel, M. 2002. Dynamic hot data stream prefetching for general-purpose programs. In Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation., ACM, New York, 199-209.
12. Duesterwald, E., Gupta, R., and Soffa, M. L. 1992. Rigorous data flow testing through output influences. In Proceedings of the 2nd Irvine Software Symposium. 131-145.
13. Goeman, B., Vandierendonck, H., and Bosschere, K. 2001. Differential FCM: increasing value prediction accuracy by improving table usage efficiency. In Proceedings of the Seventh International Symposium on High Performance Computer Architecture. IEEE-CS. 207-216.
14. Gupta, N. and Rao, P. 2001. Program execution based module cohesion measurement. In Proceedings of the 16th IEEE International Conference on Automated Software Engineering., IEEE., 144-153.
15. Gupta, R., Berson, D., and Fang, J. Z. 1998. Path profile guided partial redundancy elimination using speculation. In Proceedings of the IEEE International Conference on Computer Languages. IEEE. 230-239.
16. Jacobson, Q., Rotenberg, E., and Smith, J. E. 1997. Path-based next trace prediction. In Proceedings of the 30th IEEE/ACM International Symposium on Microarchitecture., IEEE/ACM, New York, 14-23.
17. Jaramillo, C., Gupta, R., and Soffa, M. L. 1999. Comparison checking: an approach to avoid debugging of optimized code. In Proceedings of the ACM SIGSOFT 7th Symposium on Foundations of Software Engineering and 8th European Software Engineering Conference., LNCS 1687, Springer Verlag, New York, 268-284.
18. Joseph, D. and Grunwald, D. 1997. Prefetching using Markov predictors. In Proccedings of the International Symposium on Computer Architecture. IEEE/ACM, New York, 252-263.
19. Kamkar, M. 1993. Interprocedural dynamic slicing with applications to debugging and testing. PhD Thesis, Linkoping University, Sweden.
20. KleinOsowski, A. J. and Lilja, D. J. 2002. MinneSPEC: a new SPEC benchmark workload for simulation-based computer architecture research. Computer Architecture Letters 1.
21. Korel, B. and Laski, J. 1988. Dynamic program slicing. Information Processing Letters 29, 3, 155-163.
22. Korel, B. and Rilling, J. 1997. Application of dynamic slicing in program debugging. In Proceedings of the Automated and Algorithmic Debugging. 43-59.
23. Larus, J. R. 1999. Whole program paths. In Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation., ACM, New York, 259-269.
24. Lipasti, M. H. and Shen, J. P. 1996. Exceeding the dataflow limit via value prediction. In Proceedings of the 29th IEEE/ACM International Symposium on Microarchitecture., IEEE/ACM, New York, 226-237.
25. Nevil-Manning, C. G. and Witten, I. H. 1997. Linear-time, incremental hierarchy inference for compression. In Proceedings of the Data Compression Conference., IEEE-CS., 3-11.
26. Perelman, E., Hamerly, G. Biesbrouck, M. V. Sherwood, T. and Calder, B. 2003. Using SimPoint for accurate and efficient simulation. In Proceedings of the SIGMETRICS the International Conference on Measurement and Modeling of Computer Systems., ACM, New York, 318-319.
27. Rubin, S., Bodik, R., and Chilimbi, T. 2002. An efficient profile-analysis framework for data layout optimizations. In Proceedings of the 29th SIGPLAN-SIGACT Symposium on Principles of Programming Languages., ACM, New York, 140-153.
28. Sazeides, Y. 2003. Instruction-isomorphism in program execution. In Proceedings of the Value Prediction Workshop.
29. Sazeides, Y. and Smith, J. E. 1997a. The predictability of data values. In Proceedings of the 30th IEEE/ACM International Symposium on Microarchitecture., IEEE/ACM, New York, 248-258.
30. Sazeides, Y. and Smith, J. E. 1997b. Implementations of context based value predictors. Technical Report ECE-97-8, University of Wisconsin-Madison. Trimaran Compiler Research Infrastructure, 1997. Tutorial Notes.
31. Venkatesh, G. A. 1995. Experimental results from dynamic slicing of C programs. ACM Transactions on Programming Languages and Systems 17, 2, 197-216.
32. Weiser, M. 1982. Program slicing. IEEE Transactions on Software Engineering SE-10, 4, 352357.
33. Yang, J. and Gupta, R. 2002. Frequent value locality and its applications. ACM Transactions on Embedded Computing Systems 1, 1, 79-105.
34. Young, C. and Smith, M. D. 1998. Better global scheduling using path profiles. In Proceedings of the IEEE/ACM International Symposium on Microarchitecture. IEEE/ACM, New York, 115-123.
35. Zhang, Y. and Gupta, R. 2001. Timestamped whole program path representation and its applications. In Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation., ACM, New York, 180-190.
36. Zhang, Y. and Gupta, R. 2002. Data compression transformations for dynamically allocated data structures. In Proceedings of the International Conference on Compiler Construction., LNCS 2304, Springer Verlag, New York, 14-28.
37. Zhang, X., Gupta, R., and Zhang, Y. 2003. Precise dynamic slicing algorithms. In Proceedings of the IEEE/ACM International Conference on Software Engineering., IEEE/ACM, New York, 319-329.
38. Zhang, X. and Gupta, R. 2004. Cost effective dynamic program slicing. In Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation., ACM, New York, 94-106.
39. Zhang, X. and Gupta, R. 2005. Matching execution histories of program versions. In Proceedings of the Joint 10th European Software Engineering Conference and 13th SIGSOFT Symposium on the Foundations of Software Engineering., ACM, to appear., 189-206.
40. Zilles, C. B. and Sohi, G. 2000. Understanding the backward slices of performance degrading instructions. In Proceedings of the IEEE/ACM 27th International Symposium on Computer Architecture., IEEE/ACM, New York, 172-181.