Block-Aware Instruction Set Architecture

ACM Transactions on Architecture and Code Optimization

Volumn 3, Issue 3, 2006, Pages 327-357

  Zmily, Ahmad ^a   Kozyrakis, Christos ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

Basic block; Branch prediction; Decoupled architecture; Instruction fetch; Instruction set architecture; Software hints

Indexed keywords

EID: 38849096758     PISSN: 15443566     EISSN: 15443973     Source Type: Journal    
DOI: 10.1145/1162690.1162694     Document Type: Article

References (27)

1. Adler, M., Gibbons, P., and Matias, Y. 2002. Scheduling Space Sharing for Internet Advertising. J. Sched. 5, 2, 103-119.
2. Balas, E. and Zemel, E. 1980. An Algorithm for Large Zero-One Knapsack Problems. Oper. Res. 28, 1130-1154.
3. Barnhart, C., Johnson, E., Nemhauser, G., Savelsbergh, M., and Vance, P. 1998. Branch and Price : Column Generation for Solving Huge Integer Programs. Oper. Res. 46, 316-329.
4. Bazaraa, M., Sherali, H., and Shetty, C. 1993. Nonlinear Programming Theory and Algorithms. John Wiley & Sons, New York, NY.
5. Buchwalter, C., Ryan, M., and Martin, D. 2001. The State of Online Advertising: Data Covering Fourth Quarter 2000. Tech. rep., Ad Relevance (A Jupiter Media Metrix company). February.
6. Everett III, H. 1963. Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources. Oper. Res. 11, 399-417.
7. Fisher, M. 1981. The Lagrangian Relaxation Method for Solving Integer Programming Problems. Management Science 27, 1-18.
8. Garey, M. and Graham, R. 1975. Bounds for Multiprocessor Scheduling with Resource Constraints. SIAM J. Comput. 4, 2, 187-200.
9. Geoffrion, A. 1974. Lagrangean Relaxation for Integer Programming. Mathematical Programming Study 2, 82-114.
10. Guignard, M. and Kim, S. 1987. Lagrangean Decomposition: a Model Yielding Stronger Lagrangean Bounds. Mathematical Programming 39, 215-228.
11. Haney, K. 2001. Online Ad Spending Rakes in $2 Billion. eBiz Daily, April 06, 2001. http://www.digitrends.net/ebna/index_11402.html.
12. Held, M. and Karp, R. 1970. The Traveling Salesman Problem and Minimum Spanning Trees. Oper. Res. 18, 1138-1162.
13. Held, M. and Karp, R. 1971. The Traveling Salesman Problem and Minimum Spanning Trees: Part II. Mathematical Programming 1, 6-25.
14. Ilog, Inc. 2001. ILOG CPLEX 7. 5 User's Manual. ILOG, Inc., Gentilly, France.
15. Interactive Advertising Beureau 2001. Internet Ad Revenue Report. Fourth Quarter of 2000, April, 2001. http://www. iab. net/forms/qreport. html.
16. Kumar, S., Jacob, V., and Sriskandarajah, C. 2000. Scheduling Advertising at a Web Site. In 10th Annual Workshop On Information Technologies and Systems. Sydney, Australia.
17. Kumar, S., Jacob, V., and Sriskandarajah, C. 2001a. Hybrid Genetic Algorithms for Scheduling Advertising on a Web Page. In Proceedings of the Twenty-Second International Conference on Information Systems (ICIS). New Orleans, LA.
18. Kumar, S., Jacob, V., and Sriskandarajah, C. 2001b. Scheduling Advertisements on a Web Page to Maximize Space Utilization. Working Paper. School of Management, The University of Texas at Dallas.
19. Langheinrich, M., Nakamura, A., Abe, N., Kamba, T., and Koseki, Y. 1999. Unintrusive Customization Techniques for Web Advertising. In 8th International World Wide Web Conference., Toronto, Canada, 181-194.
20. Lindo Systems, Inc. 2001. LINDO Callable Library User's Manual. LINDO Systems, Inc.
21. Martello, S., Pisinger, D., and Toth, P. 2000. New Trends in Exact Algorithms for the 0-1 Knapsack Problem. Europ. J. Oper. Res. 123, 325-332.
22. Martin, r. 1999. Large Scale Linear and Integer Programming : A Unified Approach. Kluwer Academic Press, Boston, MA.
23. Menon, S. and Schräge, L. 2002. Order Allocation for Stock Cutting in the Paper Industry. Oper. Res. 50, 2, 324-332.
24. Nemhauser, G. and Wolsey, L. 1988. Integer and Combinatorial Optimization. Wiley Interscience Series in Discrete Mathematics and Optimization, New York, New York.
25. Pinedo, M. 1995. Scheduling Theory, Algorithms and Systems. Prentice Hall, New Jersey.
26. Pisinger, D. 1997. A Minimal Algorithm for the 0-1 Knapsack Problem. Oper. Res. 45, 758-767.
27. Schrijver, A. 1986. Theory of Linear and Integer Programming. John Wiley & Sons, New York, NY.