Optimal memory time Cache partitioning in chip-multiprocessors
Optimal memory time Cache partitioning(OMTP) was proposed.The OMTP can get the average access invalidation overheads of different application and Cache line distributation about Cache hit through the characteristic obtain unit.According to which the OMTP can allocate proper Cache capacity to competi...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2012-04-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/1000-436X(2012)04-0136-07/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1841539908961828864 |
|---|---|
| author | Hao LI Lun-guo XIE |
| author_facet | Hao LI Lun-guo XIE |
| author_sort | Hao LI |
| collection | DOAJ |
| description | Optimal memory time Cache partitioning(OMTP) was proposed.The OMTP can get the average access invalidation overheads of different application and Cache line distributation about Cache hit through the characteristic obtain unit.According to which the OMTP can allocate proper Cache capacity to competitive process,so the overall performance of the program can achieve optimizied.The experiment results showed that OMTP had higher miss rate compared with utility-based Cache partitioning(UCP),but it had better IPC throughput and weighted speedup,OMTP improved throughput by average 3.1% and weighted speedup by average 1.3% over UCP. |
| format | Article |
| id | doaj-art-8523d44799ff4e539215cec36205a4d4 |
| institution | Kabale University |
| issn | 1000-436X |
| language | zho |
| publishDate | 2012-04-01 |
| publisher | Editorial Department of Journal on Communications |
| record_format | Article |
| series | Tongxin xuebao |
| spelling | doaj-art-8523d44799ff4e539215cec36205a4d42025-01-14T06:31:44ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2012-04-013313614259661741Optimal memory time Cache partitioning in chip-multiprocessorsHao LILun-guo XIEOptimal memory time Cache partitioning(OMTP) was proposed.The OMTP can get the average access invalidation overheads of different application and Cache line distributation about Cache hit through the characteristic obtain unit.According to which the OMTP can allocate proper Cache capacity to competitive process,so the overall performance of the program can achieve optimizied.The experiment results showed that OMTP had higher miss rate compared with utility-based Cache partitioning(UCP),but it had better IPC throughput and weighted speedup,OMTP improved throughput by average 3.1% and weighted speedup by average 1.3% over UCP.http://www.joconline.com.cn/zh/article/doi/1000-436X(2012)04-0136-07/chip-multiprocessorshared CacheCache partitioningoptimal memory time Cache partitioning |
| spellingShingle | Hao LI Lun-guo XIE Optimal memory time Cache partitioning in chip-multiprocessors Tongxin xuebao chip-multiprocessor shared Cache Cache partitioning optimal memory time Cache partitioning |
| title | Optimal memory time Cache partitioning in chip-multiprocessors |
| title_full | Optimal memory time Cache partitioning in chip-multiprocessors |
| title_fullStr | Optimal memory time Cache partitioning in chip-multiprocessors |
| title_full_unstemmed | Optimal memory time Cache partitioning in chip-multiprocessors |
| title_short | Optimal memory time Cache partitioning in chip-multiprocessors |
| title_sort | optimal memory time cache partitioning in chip multiprocessors |
| topic | chip-multiprocessor shared Cache Cache partitioning optimal memory time Cache partitioning |
| url | http://www.joconline.com.cn/zh/article/doi/1000-436X(2012)04-0136-07/ |
| work_keys_str_mv | AT haoli optimalmemorytimecachepartitioninginchipmultiprocessors AT lunguoxie optimalmemorytimecachepartitioninginchipmultiprocessors |