메뉴 건너뛰기




Volumn , Issue , 2009, Pages 267-278

Disaggregated memory for expansion and sharing in blade servers

Author keywords

Disaggregated memory; Memory blades; Memory capacity expansion; Power and cost efficiencies

Indexed keywords

ARCHITECTURAL BUILDINGS; BLADE SERVERS; BUILDING BLOCKES; COLOCATIONS; COMMODITY-BASED SYSTEMS; COST EFFICIENCY; DATA CENTERS; DISAGGREGATION; MEMORY CAPACITY; MEMORY SYSTEMS; MULTIPLE SERVERS; NEW SYSTEM; PERFORMANCE BENEFITS; POWER CONSUMPTION; POWER COSTS; REMOTE MEMORY; SHARING MEMORIES; VIRTUALIZATION LAYERS;

EID: 70450227674     PISSN: 10636897     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1555754.1555789     Document Type: Conference Paper
Times cited : (387)

References (43)
  • 1
    • 35648995516 scopus 로고    scopus 로고
    • The Landscape of Parallel Computing Research: A View from Berkeley. UC Berkeley EECS Tech Report UCB/EECS-2006-183
    • Dec
    • K. Asanovic et al. The Landscape of Parallel Computing Research: A View from Berkeley. UC Berkeley EECS Tech Report UCB/EECS-2006-183, Dec. 2006.
    • (2006)
    • Asanovic, K.1
  • 2
    • 84869685339 scopus 로고    scopus 로고
    • VMWare Performance Team Blogs, Scale up with Large Memory
    • VMWare Performance Team Blogs. Ten Reasons Why Oracle Databases Run Best on VMWare "Scale up with Large Memory." http://tinyurl.com/cudjuy
    • Ten Reasons Why Oracle Databases Run Best on VMWare
  • 3
    • 84868969760 scopus 로고    scopus 로고
    • Spending Moore's Dividend
    • MSR-TR-2008-69, May 2008
    • J. Larus. Spending Moore's Dividend. Microsoft Tech Report MSR-TR-2008-69, May 2008
    • Microsoft Tech Report
    • Larus, J.1
  • 10
    • 84869679096 scopus 로고    scopus 로고
    • http://apotheca.hpl.hp.com/pub/datasets/animation-bear/
  • 11
    • 0037619265 scopus 로고    scopus 로고
    • Web Search for a Planet: The Google Cluster Architecture
    • March/April
    • L. Barroso, J. Dean and U. Hoelzle. Web Search for a Planet: The Google Cluster Architecture. IEEE Micro, 23(2), March/April 2003.
    • (2003) IEEE Micro , vol.23 , Issue.2
    • Barroso, L.1    Dean, J.2    Hoelzle, U.3
  • 12
    • 70450287136 scopus 로고    scopus 로고
    • E. Felten and J. Zahorjan. Issues in the implementation of a remote memory paging system. University of Washington CSE TR 91-03-09, March 1991.
    • E. Felten and J. Zahorjan. Issues in the implementation of a remote memory paging system. University of Washington CSE TR 91-03-09, March 1991.
  • 14
    • 1642376855 scopus 로고    scopus 로고
    • The network RamDisk: Using remote memory on heterogeneous NOWs
    • M. Flouris and E. Markatos. The network RamDisk: Using remote memory on heterogeneous NOWs. Cluster Computing, Vol. 2, Issue 4, 1999.
    • (1999) Cluster Computing , vol.2 , Issue.4
    • Flouris, M.1    Markatos, E.2
  • 20
    • 0026839484 scopus 로고
    • The Stanford DASH Multiprocessor
    • Mar
    • D. Lenoski et al. The Stanford DASH Multiprocessor. IEEE Computer, 25(3), Mar. 1992.
    • (1992) IEEE Computer , vol.25 , Issue.3
    • Lenoski, D.1
  • 26
    • 0030083764 scopus 로고    scopus 로고
    • TreadMarks: Shared Memory Computing on Networks of Workstations
    • C. Amza et al. TreadMarks: Shared Memory Computing on Networks of Workstations. IEEE Computer, 29(2), 1996.
    • (1996) IEEE Computer , vol.29 , Issue.2
    • Amza, C.1
  • 29
    • 70450274262 scopus 로고    scopus 로고
    • ScaleMP. The Versatile SMP (vSMP) Architecture and Solutions Based on vSMP Foundation. White paper at http://www.scalemp.com/prod/technology/how-does- it-work/
    • ScaleMP. The Versatile SMP (vSMP) Architecture and Solutions Based on vSMP Foundation. White paper at http://www.scalemp.com/prod/technology/how-does- it-work/
  • 30
    • 0002546979 scopus 로고
    • The compression cache: Using online compression to extend physical memory
    • F. Douglis. The compression cache: using online compression to extend physical memory. In Proc. of 1993 Winter USENIX Conference, 1993.
    • (1993) Proc. of 1993 Winter USENIX Conference
    • Douglis, F.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.