• DocumentCode
    2140569
  • Title

    Matching the speed gap between SRAM and DRAM

  • Author

    Wang, Feng ; Hamdi, Mounir

  • Author_Institution
    Dept. of Comput. Sci. & Eng., Hong Kong Univ. of Sci. & Technol., Hongkong
  • fYear
    2008
  • fDate
    15-17 May 2008
  • Firstpage
    104
  • Lastpage
    109
  • Abstract
    With the constantly increasing Internet traffic, buffers are becoming major bottlenecks for todaypsilas high-end routers. In particular, router buffers are required to have both high speed and large capacities, which are hard to build with current single memory technology, such as SRAM or DRAM. A general approach is to make a combination of the SRAM and DRAM and exploit advantages from both. The main obstacle is to find a way matching the speed gap between them. And the requirement to maintain multiple flows in the system further complicates the problem. In this paper, we first investigate previous solutions that use different access granularities to match the speed gap. We point out their intrinsic scaling problems when the number of flows increases. Then, we propose to use parallelism to match the speed gap. Numerical studies and simulations both show that our proposal can theoretically support any number of flows in the router with just little SRAM under practical traffic. In addition, the memory management algorithm is also more scalable compared to those in previous solutions.
  • Keywords
    DRAM chips; SRAM chips; network routing; storage management chips; DRAM; Internet traffic; SRAM; high-end router; memory management algorithm; speed gap matching technique; Computer science; Internet; Memory management; Numerical simulation; Packet switching; Parallel processing; Random access memory; Scheduling algorithm; Tail; Traffic control;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    High Performance Switching and Routing, 2008. HSPR 2008. International Conference on
  • Conference_Location
    Shanghai
  • Print_ISBN
    978-1-4244-1981-4
  • Electronic_ISBN
    978-1-4244-1982-1
  • Type

    conf

  • DOI
    10.1109/HSPR.2008.4734429
  • Filename
    4734429