We use cookies to improve your experience with our site.

Indexed in:

SCIE, EI, Scopus, INSPEC, DBLP, CSCD, etc.

Submission System
(Author / Reviewer / Editor)
Advanced Search
Volume 20 Issue 5
September  2005
Turn off MathJax
Article Contents
Abstract
References
Related Articles
Ying Chen, Karthik Ranganathan, Vasudev V. Pai, David J. Lilja, Kia Bazargan. A Novel Memory Structure for Embedded Systems: Flexible Sequential andRandom Access Memory[J]. Journal of Computer Science and Technology, 2005, 20(5): 596-606.
Citation: Ying Chen, Karthik Ranganathan, Vasudev V. Pai, David J. Lilja, Kia Bazargan. A Novel Memory Structure for Embedded Systems: Flexible Sequential andRandom Access Memory[J]. Journal of Computer Science and Technology, 2005, 20(5): 596-606.
shu

A Novel Memory Structure for Embedded Systems: Flexible Sequential andRandom Access Memory

  • 1Department of Electrical and ComputerEngineering, University of Minnesota, 200 Union St. S.E.Minneapolis, MN 55455, U.S.A.
    2Data Communications Division, Cypress Semiconductor Corp., 198Champion Ct., San Jose, CA 95134, U.S.A.
    3Marvell Semiconductor, 5400 Bayfront Plaza, Mailstop E-201,Santa Clara, CA 95054, U.S.A.

More Information
  • Revised Date: July 21, 2005
  • Published Date: September 14, 2005
    Abstract
  • The on-chip memory performance of embedded systems directly affects thesystem designers' decision about how to allocate expensive silicon area.A novel memory architecture, flexible sequentialand random access memory (FSRAM), is investigated for embedded systems.To realize sequential accesses, small ``links'' are added to each row in the RAMarray to point to the next row to be prefetched. The potential cachepollution is ameliorated by a small sequential access buffer(SAB). To evaluate the architecture-level performance of FSRAM, we ranthe Mediabench benchmark programs on a modified version of theSimpleScalar simulator. Our results show that the FSRAM improvesthe performance of a baseline processor with a 16KB data cache up to55%, with an average of 9%; furthermore, the FSRAM reduces 53.1% ofthe data cache miss count on average due to its prefetching effect. Wealso designed RTL and SPICE models of the FSRAM, which show thatthe FSRAM significantly improves memory access time, while reducingpower consumption, with negligible area overhead.
    • FullText(HTML)
    • References (18)
  • [1]
    Panda P R, Dutt N D, Nicolau A. Data cache sizing for embedded processor applications. Technical Report TCS-TR-97-31, University of California, Irvine, June 1997.
    [2]
    Panda P R, Dutt N D, Nicolau A. Architectural exploration and optimization of local memory in embedded systems. International Symposium on System Synthesis (ISSS 97), Antwerp, Sept. 1997.
    [3]
    Shiue W, Chakrabati C. Memory exploration for low power embedded systems. In IEEE/ACM Proc. 36th. Design Automation Conference (DAC'99), New Orleans, Louisana, U.S.A., June 1999.
    [4]
    Moon J, Athas W C, Beerel P A, Draper J T. Low-power sequential access memory design. IEEE 2002 Custom Integrated Circuits Conference, Orlando, FL, U.S.A., June 2002, pp.741--744.
    [5]
    Sbeyti H, Niar S, Eeckhout L. Adaptive prefetching for multimedia applications in embedded systems. DATE'04, EDA IEEE, Paris, France, February 16--18, 2004.
    [6]
    Pimentel A D, Hertzberger L O, Struik P, Wolf P. Hardware versus hybrid data prefetching in multimedia processors: A case study. In Proc. The IEEE Int. Performance, Computing and Communications Conference (IPCCC 2000), Phoenix, USA, Feb. 2000, pp.525--531.
    [7]
    Zucker D F, Flynn M J, Lee R B. A comparison of hardware prefetching techniques for multimedia benchmarks. In Proceedings of the International Conferences on Multimedia Computing and Systems, Himshima, Japan, June 1996, p.236.
    [8]
    V De La Luz, M Kandemir, I Kolcu. Automatic data migration for reducing energy consumption in multi-bank memory systems. Design Automation Conference, Anaheim, CA, U.S.A., 2002, pp.213--218.
    [9]
    Ying Chen, Karthik Ranganathan, Amit Puthenveetil, Kia Bazargan, David J Lilja. FSRAM: Flexible sequential and random access memory for embedded systems. Laboratory for Advanced Research in Computing Technology and Compilers, Technical Report No. ARCTiC 04-01, February, 2004.
    [10]
    Doug Burger, Todd M Austin. The SimpleScalar tool set version 2.0. Technical Report 1342, Computer Sciences Department, University of Wisconsin, June 1997.
    [11]
    Lee L, Potkonjak M, Mangione-Smith W H. Mediabench: A tool for evaluating and synthesizing multimedia and communications systems. In Proc. The 30th Annual International Symposium on Microarchitecture (Micro 30), December 1997, pp.330--335.
    [12]
    Intel Corporation. The Intel Xscale Microarchitecture technical summary. Technical report, 2001. Http://www.intel.com/ design/intelxscale/xscaledatasheet4.htm,
    [13]
    http://www.cse.psu.edu/\verb!~!mdl/mediabench.tar.gz
    [14]
    Smith J E, Hsu W C. Prefetching in supercomputer instruction caches. In Proc. Supercomputing92, 1992, pp.588--597.
    [15]
    VanderWiel S P, Lilja D J. Data prefetch mechanisms. ACM Computing Surveys, June 2000, 32(2): 174--199.
    [16]
    Lilja D J. Measuring Computer Performance. Cambridge University Press, 2000.
    [17]
    Joseph D, Grunwald D. Prefetching using Markov predictors. In Proc. The International Symposium on Computer Architecture, Denver, Colorado, U.S.A., June 1997, pp.252--263.
    [18]
    Koppelman D M. Neighborhood prefetching on multiprocessors using instruction history. International Conference on Parallel Architectures and Compilation Techniques, October 2000, pp.123--132.
    • Relative Articles

  • Related Articles

    [1]Fu-Zhen Zhuang, Ying-Min Zhou, Hao-Chao Ying, Fu-Zheng Zhang, Xiang Ao, Xing Xie, Qing He, Hui Xiong. Sequential Recommendation via Cross-Domain Novelty Seeking Trait Mining[J]. Journal of Computer Science and Technology, 2020, 35(2): 305-319. DOI: 10.1007/s11390-020-9945-z
    [2]Zhi-Guo Wan, Robert H. Deng, David Lee, Ying Li. MicroBTC: Efficient, Flexible and Fair Micropayment for Bitcoin Using Hash Chains[J]. Journal of Computer Science and Technology, 2019, 34(2): 403-415. DOI: 10.1007/s11390-019-1916-x
    [3]HONG Jinwei, CHEN Guoliang, ZHANG Zhaoqing. Supporting Flexible Data Distribution in Software DSMs[J]. Journal of Computer Science and Technology, 2000, 15(5): 445-452.
    [4]Xu Shiyi, G.P.Dias. The Methodology of Testability Prediction for Sequential Circuits[J]. Journal of Computer Science and Technology, 1996, 11(6): 529-541.
    [5]Wang Hui, Liu Dayou, Wang Yafei. Sequential Back-Propagation[J]. Journal of Computer Science and Technology, 1994, 9(3): 252-260.
    [6]Xiang Dong, Wei Daozheng. GLOBAL: A Design for Random Testability Algorithm[J]. Journal of Computer Science and Technology, 1994, 9(2): 182-192.
    [7]Wang Wenzhang, Lu Yingping. A New Method for State Simplification in Incompletely Specified Sequential Machines[J]. Journal of Computer Science and Technology, 1992, 7(3): 274-283.
    [8]Xing Hancheng, Li Chunlin, Xing Dongsheng. Improvements to the Control Techniques of Sequential Inference Machines——from Instructions to Hardware Organization[J]. Journal of Computer Science and Technology, 1991, 6(1): 66-73.
    [9]Chen Haibo, Ci Yungui. Speedup Studies of Leading Iteration Model for Non-DO Loops in Comparison with Sequential Iteration Model[J]. Journal of Computer Science and Technology, 1989, 4(2): 147-154.
    [10]Xu Xiaoshu. Simplification of Multivalued Sequential SULM Network by Using Cascade Decomposition[J]. Journal of Computer Science and Technology, 1986, 1(4): 84-95.
    • Supplements (0)

Catalog

    Get Citation
    XML
    Article views (27) PDF downloads (1259) Cited by()
    Related

    Copyright ©2025 JCST, All Rights Reserved     京ICP备05002829号-1

    Institute of Computing Technology, Chinese Academy of Sciences
    P.O. Box 2704, Beijing 100190, P.R. China

    Tel.: 86-10-62610746 E-mail: jcst@ict.ac.cn

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return