发明名称 |
Data allocation into multiple memories for concurrent access |
摘要 |
Data is allocated into multiple memories with selective variable replication for maximizing performance by minimizing concurrent memory access conflicts. Requirements for concurrent access are summarized in a transformed concurrent access graph. Graph vertices are merged to disallow variable replication. All potential graph merges that cause a reduction in machine cycle time are identified. The ratios of saved cycles/memory cost in bytes are then computed for each potential merge. The potential merges are then sorted by their saved cycles/bytes ratio. Finally, potential merges resulting in replicated variables are selected based on their cycles/bytes ratios until a predefined memory target size is achieved. Either graph coloring or clique partitioning can be used to allocate variables into memory banks.
|
申请公布号 |
US5966143(A) |
申请公布日期 |
1999.10.12 |
申请号 |
US19970949356 |
申请日期 |
1997.10.14 |
申请人 |
MOTOROLA, INC. |
发明人 |
BRETERNITZ, JR., MAURICIO |
分类号 |
G06F9/45;(IPC1-7):G06F9/45 |
主分类号 |
G06F9/45 |
代理机构 |
|
代理人 |
|
主权项 |
|
地址 |
|