To appear in Proceedings of the 23rd ACM Symposium on Operating Systems Principles (SOSPâ11) This version is reformatted from the official version that appears in the conference proceedings. SILT: A Memory-Efficient, High-Performance Key-Value Store Hyeontaek Lim1, Bin Fan1, David G. Andersen1, Michael Kaminsky2 1Carnegie Mellon University, 2Intel Labs ABSTRACT SILT (Small Index Large Table) is a
OSDI'04: Sixth Symposium on Operating System Design and Implementation, San Francisco, CA (2004), pp. 137-150 MapReduce is a programming model and an associated implementation for processing and generating large data sets. Users specify a map function that processes a key/value pair to generate a set of intermediate key/value pairs, and a reduce function that merges all intermediate values associa
Proceedings of the 19th ACM Symposium on Operating Systems Principles, ACM, Bolton Landing, NY (2003), pp. 20-43 We have designed and implemented the Google File System, a scalable distributed file system for large distributed data-intensive applications. It provides fault tolerance while running on inexpensive commodity hardware, and it delivers high aggregate performance to a large number of cli
Appears in the Proceedings of the 5th USENIX Conference on File and Storage Technologies (FASTâ07), February 2007 Failure Trends in a Large Disk Drive Population Eduardo Pinheiro, Wolf-Dietrich Weber and Luiz Andr´e Barroso Google Inc. 1600 Amphitheatre Pkwy Mountain View, CA 94043 {edpin,wolf,luiz}@google.com Abstract It is estimated that over 90% of all new information produced in the world is
2 Methodology 2.1 What is a disk failure? While it is often assumed that disk failures follow a simple fail-stop model (where disks either work perfectly or fail absolutely and in an easily detectable manner [22,24]), disk failures are much more complex in reality. For example, disk drives can experience latent sector faults or transient performance problems. Often it is hard to correctly attribut
Informatics PhD Theses and MSc Dissertations Informatics Dissertations are made available as and when they are approved in their final form. Any relevant and published thesis can be found on the Edinburgh Research Archive. Informatics Forum, 10 Crichton Street, Edinburgh, EH8 9AB, Scotland, UK Tel: +44 131 651 5661, Fax: +44 131 651 1426, E-mail: [email protected] Please contact our webad
Answer (1 of 12): Note: this is slightly biased to the problems of scalable online processing systems (mostly data storage and messaging). As such I may be leaving out papers related to other (equally important) topics such as HPC, security in distributed systems and may be leaving out important ...
Mapreduce & Hadoop Algorithms in Academic Papers (4th update â May 2011) Follow @atbrox Itâs been a year since I updated the mapreduce algorithms posting last time, and it has been truly an excellent year for mapreduce and hadoop â the number of commercial vendors supporting it has multiplied, e.g. with 5 announcements at EMC World only last week (Greenplum, Mellanox, Datastax, NetApp, and Snaplog
æè¿SVM(Support Vector Machine)å¨ãã®å¾©ç¿ããã¦ããã®ã§æåã©ããã®ãã¼ã«ã¨ãããã«é¢é£ããè«æãã¾ã¨ãããå®å ¨ã«å人ç¨ã¡ã¢ãªã®ã§æãããããããããã¾ã§åèç¨åº¦ã«ã ãã¼ã«ã¯è²ã ããããã©ä½¿ãã®ãç®çãªãå®çªã®svmlightãlibsvmãããæ°ããããæè¿ã ã¨liblinearãæµè¡ã£ã¦ãããSVMã¨ããã°ã«ã¼ãã«é¢æ°ã¨ãã¼ã¸ã³æ大åã ããã©ãæè¿ã§ã¯ã«ã¼ãã«ã¯ç·å½¢ã§ãããã¨ããæµãã«ãªã£ã¦ãã¦ããï¼å人çã«ã¯pegasosããããæãç·å½¢ã«ã¼ãã«ï¼ãªã³ã©ã¤ã³å¦ç¿ã«ãªã£ã¦ãã¦èªåã§ä½ã£ã¦éã¶ã«ã¯è¯ãã¨æã£ã¦ãããã¾ãsvmsgdã¯"straightforward stochastic gradient descent"ã¨è¨ã£ã¦ãããã®ã®é常ã«é«æ§è½ã§ããããå®ç¾ããããã®æ§ã ãªå·¥å¤«ãæ½ããã¦ãã¦å®è£ ãå¦ã¶ä¸ã§å¤§å¤åèã«ãªããããã«ã¯æãã¦ããªãããã©ãç·å½¢ã«
Disclaimer: The opinions expressed here are my own and do not necessarily represent those of current or past employers. Recent CommentsRaffaele on David Patterson Retires After 40 YearsJames Hamilton on David Patterson Retires After 40 YearsJames Hamilton on Pat SelingerMariana Carvalho on Pat SelingerRaffaele Santopaolo on David Patterson Retires After 40 YearsJames Hamilton on Seagate HAMRTom Da
ãªãªã¼ã¹ãé害æ å ±ãªã©ã®ãµã¼ãã¹ã®ãç¥ãã
ææ°ã®äººæ°ã¨ã³ããªã¼ã®é ä¿¡
å¦çãå®è¡ä¸ã§ã
j次ã®ããã¯ãã¼ã¯
kåã®ããã¯ãã¼ã¯
lãã¨ã§èªã
eã³ã¡ã³ãä¸è¦§ãéã
oãã¼ã¸ãéã
{{#tags}}- {{label}}
{{/tags}}