a unified framework for schedule and storage optimization
play

A Unified Framework for Schedule and Storage Optimization William - PowerPoint PPT Presentation

A Unified Framework for Schedule and Storage Optimization William Thies, Frdric Vivien*, Jeffrey Sheldon, and Saman Amarasinghe MIT Laboratory for Computer Science * ICPS/LSIIT, Universit Louis Pasteur http://compiler.lcs.mit.edu/aov


  1. Answering Question #1 • Given θ (i, j) = i + j, what is the shortest valid occupancy vector v ? i j

  2. Answering Question #1 • Given θ (i, j) = i + j, what is the shortest valid occupancy vector v ? i j

  3. Answering Question #1 • Given θ (i, j) = i + j, what is the shortest valid occupancy vector v ? � Solution: v = (1, 1) i j

  4. Answering Question #1 • Given θ (i, j) = i + j, what is the shortest valid occupancy vector v ? � Solution: v = (1, 1) i j

  5. Answering Question #1 • Given θ (i, j) = i + j, what is the shortest valid occupancy vector v ? � Solution: v = (1, 1) i j

  6. Answering Question #1 • Given θ (i, j) = i + j, what is the shortest valid occupancy vector v ? � Solution: v = (1, 1) i j

  7. Answering Question #1 • Given θ (i, j) = i + j, what is the shortest valid occupancy vector v ? � Solution: v = (1, 1) i j

  8. Answering Question #1 • Given θ (i, j) = i + j, what is the shortest valid occupancy vector v ? � Solution: v = (1, 1) i j

  9. Answering Question #1 • Given θ (i, j) = i + j, what is the shortest valid occupancy vector v ? � Solution: v = (1, 1) i j

  10. Answering Question #1 • Given θ (i, j) = i + j, what is the shortest valid occupancy vector v ? � Solution: v = (1, 1) i j

  11. Answering Question #1 • Given θ (i, j) = i + j, what is the shortest valid occupancy vector v ? � Solution: v = (1, 1) i j

  12. Answering Question #1 • Given θ (i, j) = i + j, what is the shortest valid occupancy vector v ? � Solution: v = (1, 1) i j

  13. Answering Question #1 • Given θ (i, j) = i + j, what is the shortest valid occupancy vector v ? � Solution: v = (1, 1) i j

  14. Answering Question #1 • Given θ (i, j) = i + j, what is the shortest valid occupancy vector v ? � Solution: v = (1, 1) i j

  15. Answering Question #1 • Given θ (i, j) = i + j, what is the shortest valid occupancy vector v ? � Solution: v = (1, 1) i j

  16. Answering Question #1 • Given θ (i, j) = i + j, what is the shortest valid occupancy vector v ? � Why not v = (0, 1)? i j

  17. Answering Question #1 • Given θ (i, j) = i + j, what is the shortest valid occupancy vector v ? � Why not v = (0, 1)? i j

  18. Answering Question #1 • Given θ (i, j) = i + j, what is the shortest valid occupancy vector v ? � Why not v = (0, 1)? i j

  19. Answering Question #1 • Given θ (i, j) = i + j, what is the shortest valid occupancy vector v ? � Why not v = (0, 1)? i j

  20. Answering Question #1 • Given θ (i, j) = i + j, what is the shortest valid occupancy vector v ? � Why not v = (0, 1)? i j

  21. Answering Question #1 • Given θ (i, j) = i + j, what is the shortest valid occupancy vector v ? � Why not v = (0, 1)? i j

  22. Answering Question #1 • Given θ (i, j) = i + j, what is the shortest valid occupancy vector v ? � Why not v = (0, 1)? i j

  23. Answering Question #1 • Given θ (i, j) = i + j, what is the shortest valid occupancy vector v ? � Why not v = (0, 1)? ??? i j

  24. Answering Question #2 • Given v = (0, 1), what is the range of valid schedules θ ? i j

  25. Answering Question #2 • Given v = (0, 1), what is the range of valid schedules θ ? � θ (i, j) is between: θ (i, j) = 2 ∗ i + j (inclusive) θ (i, j) = i (exclusive) i j

  26. Answering Question #2 • Given v = (0, 1), what is the range of valid schedules θ ? � θ (i, j) is between: θ (i, j) = 2 ∗ i + j (inclusive) θ (i, j) = i (exclusive) i j

  27. Answering Question #2 • Given v = (0, 1), what is the range of valid schedules θ ? � θ (i, j) is between: θ (i, j) = 2 ∗ i + j (inclusive) θ (i, j) = i (exclusive) i j

  28. Answering Question #2 • Given v = (0, 1), what is the range of valid schedules θ ? � θ (i, j) is between: θ (i, j) = 2 ∗ i + j (inclusive) θ (i, j) = i (exclusive) i j

  29. Answering Question #2 • Given v = (0, 1), what is the range of valid schedules θ ? � θ (i, j) is between: θ (i, j) = 2 ∗ i + j (inclusive) θ (i, j) = i (exclusive) i j

  30. Answering Question #2 • Given v = (0, 1), what is the range of valid schedules θ ? � θ (i, j) is between: θ (i, j) = 2 ∗ i + j (inclusive) θ (i, j) = i (exclusive) i j

  31. Answering Question #2 • Given v = (0, 1), what is the range of valid schedules θ ? � θ (i, j) is between: θ (i, j) = 2 ∗ i + j (inclusive) θ (i, j) = i (exclusive) i j

  32. Answering Question #2 • Given v = (0, 1), what is the range of valid schedules θ ? � Lets try θ (i, j) = 2 ∗ i + j i j

  33. Answering Question #2 • Given v = (0, 1), what is the range of valid schedules θ ? � Lets try θ (i, j) = 2 ∗ i + j i j

  34. Answering Question #2 • Given v = (0, 1), what is the range of valid schedules θ ? � Lets try θ (i, j) = 2 ∗ i + j i j

  35. Answering Question #2 • Given v = (0, 1), what is the range of valid schedules θ ? � Lets try θ (i, j) = 2 ∗ i + j i j

  36. Answering Question #2 • Given v = (0, 1), what is the range of valid schedules θ ? � Lets try θ (i, j) = 2 ∗ i + j i j

  37. Answering Question #2 • Given v = (0, 1), what is the range of valid schedules θ ? � Lets try θ (i, j) = 2 ∗ i + j i j

  38. Answering Question #2 • Given v = (0, 1), what is the range of valid schedules θ ? � Lets try θ (i, j) = 2 ∗ i + j i j

  39. Answering Question #2 • Given v = (0, 1), what is the range of valid schedules θ ? � Lets try θ (i, j) = 2 ∗ i + j i j

  40. Answering Question #2 • Given v = (0, 1), what is the range of valid schedules θ ? � Lets try θ (i, j) = 2 ∗ i + j i j

  41. Answering Question #2 • Given v = (0, 1), what is the range of valid schedules θ ? � Lets try θ (i, j) = 2 ∗ i + j i j

  42. Answering Question #2 • Given v = (0, 1), what is the range of valid schedules θ ? � Lets try θ (i, j) = 2 ∗ i + j i j

  43. Answering Question #2 • Given v = (0, 1), what is the range of valid schedules θ ? � Lets try θ (i, j) = 2 ∗ i + j i j

  44. Answering Question #2 • Given v = (0, 1), what is the range of valid schedules θ ? � Lets try θ (i, j) = 2 ∗ i + j i j

  45. Answering Question #2 • Given v = (0, 1), what is the range of valid schedules θ ? � Lets try θ (i, j) = 2 ∗ i + j i j

  46. Answering Question #2 • Given v = (0, 1), what is the range of valid schedules θ ? � Lets try θ (i, j) = 2 ∗ i + j i j

  47. Answering Question #3 • What is the shortest v that is valid for all legal affine schedules? i j

  48. Answering Question #3 • What is the shortest v that is valid for all legal affine schedules? � Range of legal θ i j

  49. Answering Question #3 • What is the shortest v that is valid for all legal affine schedules? � Range of legal θ i j

  50. Answering Question #3 • What is the shortest v that is valid for all legal affine schedules? � Range of legal θ i j

  51. Answering Question #3 • What is the shortest v that is valid for all legal affine schedules? � Range of legal θ i j

  52. Answering Question #3 • What is the shortest v that is valid for all legal affine schedules? � Range of legal θ i j

  53. Answering Question #3 • What is the shortest v that is valid for all legal affine schedules? � Range of legal θ i j

Recommend


More recommend