• DocumentCode
    2009132
  • Title

    Memory allocation in information storage networks

  • Author

    Jiang, Anxiao ; Bruck, Jehoshua

  • Author_Institution
    Dept. of Electr. Eng., California Inst. of Technol., Pasadena, CA, USA
  • fYear
    2003
  • fDate
    29 June-4 July 2003
  • Firstpage
    453
  • Abstract
    Memory allocation problem in information storage networks is studied in this paper. The memory allocation problem is a sub-problem of a file storage scheme, which bounds file-retrieving delays in a heterogeneous information network, under both fault-free and faulty circumstances. This paper also presents an algorithm of complexity O(q|V|3) which finds an optimal memory allocation for a tree network G=(V,E), where |V| is the number of vertices and q is the average cardinality of a requirement set.
  • Keywords
    fault tolerant computing; graph theory; storage management; fault-free circumstances; file storage scheme; file-retrieving delays; heterogeneous information network; information storage network; memory allocation problem; tree network; Intelligent networks;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 2003. Proceedings. IEEE International Symposium on
  • Print_ISBN
    0-7803-7728-1
  • Type

    conf

  • DOI
    10.1109/ISIT.2003.1228470
  • Filename
    1228470
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2009132