Method and apparatus for utilizing long-path and short-path timing constraints in an electronic-design-automation tool

• US 7,207,020 B1
• Filed: 02/09/2004
• Issued: 04/17/2007
• Est. Priority Date: 02/09/2004
• Status: Expired due to Fees

• Current Assignee: Altera Corporation (Intel Corporation)
• Original Assignee: Altera Corporation (Intel Corporation)
• Inventors: Fung, Ryan, Betz, Vaughn, Chow, William
• Primary Examiner(s): Kik; Phallaka
• Application Number:
  US10/774,883
• Time in Patent Office: 1,163 Days
• Field of Search: 716/6, 716/9, 716/10, 716/16, 716/18
• US Class Current: 716/113
• CPC Class Codes: G06F 30/34 for reconfigurable circuits, e.g. field programmable gate arrays [FPGA] or programmable logic devices [PLD]

Abstract

A method for designing a system includes generating minimum and maximum delay budgets for connections from long-path and short-path timing constraints. The system is designed in response to the minimum and maximum delay budgets.

Claims

1. A method for designing a system, comprising:

generating minimum delay budgets for connections from short-path timing constraints, wherein generating the minimum delay budgets for connections comprises allocation of positive and negative slack using successive-over-relaxation where more slack than is available is allocated; and

designing the system in response to the minimum delay budgets.

2. The method of claim 1, wherein allocation of positive and negative slack using successive-over-relaxation comprises:

performing short-path timing analysis to determine short-path slack values; and

allocating the short-path slack values determined by the short-path timing analysis.

3. The method of claim 1, wherein allocation of positive and negative slack using successive-over-relaxation occurs in response to short-path slack values, connection weightings, and a multiplier indicating how much over-allocation should take place.

4. A method for designing a system, comprising:

generating maximum delay budgets for connections from long-path timing constraints, wherein generating the maximum delay budgets for connections comprises allocation of positive and negative slack using successive-over-relaxation where more slack than is available is allocated; and

designing the system in response to the maximum delay budgets.

5. The method of claim 4, wherein allocation of positive and negative slack using successive-over-relaxation comprises:

performing long-path timing analysis to determine long-path slack values; and

allocating the long-path slack values determined by the long-path timing analysis.

6. The method of claim 4, wherein allocation of positive and negative slack using successive-over-relaxation occurs in response to long-path slack values, connection weightings, and a multiplier indicating how much over-allocation should take place.

7. A method for designing a system, comprising:

generating minimum and maximum delay budgets for connections from long-path and short-path timing constraints, wherein for each connection the minimum and maximum delay budgets are determined such that at least one of the minimum delay budgets and maximum delay budgets is determined with consideration of the other; and

designing the system in response to the minimum and maximum delay budgets.

8. The method of claim 7, wherein generating the minimum and maximum delay budgets for connections comprises finding a set of connection delays that attempt to satisfy the short-path and long-path timing constraints.

9. The method of claim 8, wherein generating the minimum and maximum delay budgets for connections further comprises allocating short-path and long-path slack.

10. The method of claim 9, wherein allocating the long-path and short-path slack comprises:

performing long-path timing analysis to determine long-path slack values;

allocating the long-path slack values determined by the long-path timing analysis;

performing short-path timing analysis to determine short-path slack values; and

allocating the short-path slack values determined by the short-path timing analysis.

11. The method of claim 10, wherein allocating the short-path slack values comprises subtracting delay from temporary delays in response to the short-path slack values and connection weightings.

12. The method of claim 10, wherein allocating the long-path slack values comprises adding delay to temporary delays in response to the long-path slack values and connection weightings.

13. The method of claim 12, wherein the connection weightings are determined by a unit weighting scheme.

14. The method of claim 12, wherein the connection weightings are determined based on how much delay can be added before a practical limit is reached or before all relevant slack is allocated.

15. The method of claim 10, wherein the maximum delay budgets are determined from the allocation of the long-path slack values.

16. The method of claim 10, wherein the minimum delay budgets are determined from the allocation of the short-path slack values.

17. The method of claim 10, wherein the method iterates between performing short-path timing analysis and allocating short-path slack values, and performing long-path timing analysis and allocating long-path slack values, to re-generate minimum and maximum delay budgets, respectively.

18. The method of claim 8, wherein finding a set of connection delays that attempt to satisfy the short-path and long-path timing constraints comprises:

performing short-path timing analysis to determine short-path slack values;

fixing any short-path timing constraint violations determined by the short-path timing analysis;

performing long-path timing analysis to determine long-path slack values; and

fixing any long-path timing constraint violations determined by the long-path timing analysis.

19. The method of claim 18, wherein fixing any short-path violations comprises adding delay in response to the short-path slack values and connection weightings.

20. The method of claim 18, wherein fixing any long-path violations comprises subtracting delay in response to the long-path slack values and connection weightings.

21. The method of claim 20, wherein the connection weightings are determined by a unit weighting scheme.

22. The method of claim 20, wherein the connection weightings are determined based on how much delay can be subtracted before a practical limit is reached or all relevant violations are resolved.

23. The method of claim 7, wherein, for each connection, a maximum delay budget generated is greater or equal to a minimum delay budget determined for a respective connection.

24. The method of claim 7, wherein, the method attempts to optimize some function of a distance between minimum and maximum connection delay budgets.

25. The method of claim 7, wherein designing the system in response to the maximum and minimum delay budgets comprises generating a synthesis strategy.

26. The method of claim 25, wherein generating the synthesis strategy comprises determining whether to add or remove levels of logic.

27. The method of claim 25, wherein generating the synthesis strategy comprises determining whether to use slower or faster variants of a functional block.

28. The method of claim 25, wherein generating the synthesis strategy comprises determining whether to use faster or slower logic structures.

29. The method of claim 25, wherein generating the synthesis strategy comprises determining whether to use faster or slower logic inputs.

30. The method of claim 25, wherein generating the synthesis strategy comprises determining whether dedicated routing resources should be used or avoided.

31. The method of claim 7, wherein designing the system in response to the maximum and minimum delay budgets comprises generating a placement strategy.

32. The method of claim 31, wherein generating the placement strategy comprises determining how to place functional blocks so that dedicated routing resources are used or avoided.

33. The method of claim 31, wherein generating the placement strategy comprises determining whether to place a first functional block closer or further apart from a second functional block.

34. The method of claim 31, wherein generating the placement strategy comprises determining how to place two functional blocks to increase or decrease the routing delay between them.

35. The method of claim 7, wherein designing the system in response to the maximum and minimum delay budgets comprises generating a routing strategy.

36. The method of claim 35, wherein generating the routing strategy comprises determining whether to use more or fewer routing resources.

37. The method of claim 35, wherein generating the routing strategy comprises determining whether to use slower or faster routing resources.

38. The method of claim 35, wherein generating the routing strategy comprises determining whether to use buffers to slow down or speed up routes.

39. The method of claim 7, wherein generating the maximum delay budgets for connections comprises generating lower and upper limits on connection delay.

40. The method of claim 7, wherein generating the minimum delay budgets for connections comprises generating lower and upper limits on connection delay.

41. A machine-readable medium having stored thereon sequences of instructions, the sequences of instructions including instructions which, when executed by a processor, causes the processor to perform:

generating minimum and maximum delay budgets for connections from long-path and short-path timing constraints, wherein for each connection the minimum and maximum delay budgets are determined such that at least one of the minimum delay budgets and maximum delay budgets is determined with consideration of the other; and

designing a system in response to the minimum and maximum delay budgets.

42. The machine-readable medium of claim 41, wherein generating the minimum and maximum delay budgets for connections comprises finding a set of connection delays that attempt to satisfy the short-path and long-path timing constraints.

43. The machine-readable medium of claim 42, wherein finding a set of connection delays that attempt to satisfy the short-path and long-path timing constraints comprises:

performing short-path timing analysis to determine short-path slack values;

fixing any short-path timing constraint violations determined by the short-path timing analysis;

performing long-path timing analysis to determine long-path slack values; and

fixing any long-path timing constraint violations determined by the long-path timing analysis.

44. The machine-readable medium of claim 43, wherein fixing any short-path violations comprises adding delay in response to the short-path slack values and connection weightings.

45. The machine-readable medium of claim 43, wherein fixing any long-path violations comprises subtracting delay in response to the long-path slack values and connection weightings.

46. The machine-readable medium of claim 41, wherein generating the minimum and maximum delay budgets for connections, in part, involves allocating short-path and long-path slack.

47. The machine-readable medium of claim 46, wherein allocating the long-path and short-path slack comprises:

performing long-path timing analysis to determine long-path slack values;

allocating the long-path slack values determined by the long-path timing analysis;

performing short-path timing analysis to determine short-path slack values; and

allocating the short-path slack values determined by the short-path timing analysis.

48. The machine-readable medium of claim 47, wherein allocating the long-path slack values comprises adding delay to temporary delays in response to the long-path slack values and connection weightings.

49. The machine-readable medium of claim 47, wherein allocating the short-path slack values comprises subtracting delay from temporary delays in response to the short-path slack values and connection weightings.