TomP2P, a P2P-based key-value pair storage library
TomP2PTomP2P is a DHT with additional features, such as storing multiple values for a key. Each peer has a table (either disk-based or memory-based) to store its values. A single value can be queried / updated with a secondary key. The underlying communication framework uses Java NIO to handle many concurrent connections. DevelopmentTomP2P uses github for development and issue tracking. In case ca
Chordアルゴリズムã«ã‚ˆã‚‹DHT入門
今回ã¯DHTを実ç¾ã™ã‚‹ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã§ã‚る「Chordã€ã®ç´°ã‹ã„解説スライドを作æˆã—ã¾ã—ãŸã€‚ （ 掲載URL： http://did2.blog64.fc2.com/blog-entry-347.html ） Chordã®èª¬æ˜Žã¯ãŸãã•ã‚“書ã‹ã‚Œã¦ã„ã¾ã™ã€‚ ã‚‚ã¡ã‚ã‚“ã€ãれらã¨åŒã˜ã‚ˆã†ã«æ›¸ã„ãŸã®ã§ã¯ã»ã¨ã‚“ã©æ„味ãŒãªã„ã¨æ€ã†ã®ã§ã€ 論文をèªã‚“ã§ã‚‚ã™ãã«ã¯åˆ†ã‹ã‚‰ãªã„全体åƒã‹ã‚‰ã€ã©ã“ãŒé‡è¦ã‹ã€ã©ã®ç‚¹ã«ã‚ˆã£ã¦ãƒ¡ãƒªãƒƒãƒˆãŒç”Ÿã¾ã‚Œã¦ã„ã‚‹ã‹ãªã©ã«æ³¨ç›®ã—ã¤ã¤ã€é£²ã¿è¾¼ã¿ã‚„ã™ã„ストーリーã«ãªã‚‹ã‚ˆã†ã«æ³¨æ„ã—ã¾ã—ãŸã€‚ ãªãŠã‹ã¤ã€å‡ºæ¥ã‚‹ã ã‘è«–æ–‡ã«æ²¿ã†ã‚ˆã†ã«æ°—を付ã‘ã¦ã¿ã¾ã—ãŸã€‚Read less
Chordアルゴリズムã«ã‚ˆã‚‹DHT入門
Chordアルゴリズムã®è§£èª¬ãƒšãƒ¼ã‚¸ã§ã™ã€‚ 掲載コンテンツã¸ã®ãƒªãƒ³ã‚¯å…ˆã‚’変更ã™ã‚‹å¯èƒ½æ€§ãŒã‚ã‚‹ã®ã§ã€ãƒ–ックマークやリンクã¯ã€ã“ã®ãƒšãƒ¼ã‚¸ã«ãŠé¡˜ã„ã—ã¾ã™ã€‚ Chordã¯ã€DHT（Distributed Hash Table）ã¨å‘¼ã°ã‚Œã‚‹ç¨®é¡žã®Peer-to-Peerアルゴリズムã§ã™ã€‚ 特ã«ã€æ§‹é€ 化オーãƒãƒ¬ã‚¤ï¼ˆStructured Overlay Network）ã¨å‘¼ã°ã‚Œã‚‹ãƒ«ãƒ¼ãƒ†ã‚£ãƒ³ã‚°æ‰‹æ³•ã«ç‰¹å¾´ãŒã‚ã‚Šã¾ã™ã€‚ 解説スライドã§ã¯ã€ãã‚‚ãã‚‚DHTã¨ã¯ä½•ãªã®ã‹ã¨ã„ã†åˆæ©çš„ãªã“ã¨ã‹ã‚‰ã€successorã‚„predecessorã€finger tableã¨å‘¼ã°ã‚Œã‚‹Chordã®æœ‰åãªçµŒè·¯è¡¨ã®è§£èª¬ã‚„ã€å¤šãã®è§£èª¬ã§ã¯ã‚ã¾ã‚Šè§¦ã‚Œã‚‰ã‚Œã‚‹ã“ã¨ãŒãªã„ã‘ã‚Œã©ã‚‚ãã‚ã‚ã¦é‡è¦ã§ã‚ã‚‹ã€ãƒãƒƒãƒˆãƒ¯ãƒ¼ã‚¯ã®æ§‹ç¯‰æ–¹æ³•ï¼ˆjoin・stabilize）ã«ã¤ã„ã¦ã‚‚詳細ã«è§£èª¬ã—ã¦ã„ã¾ã™ã€‚ スライドã®ãƒšãƒ¼ã‚¸æ•°ã¯å¤šã„ã§ã™ãŒã€ï¼‘ページ当ãŸã‚Šå¹³å‡æ•°ç§’ã§èªã‚ã‚‹ã¯
Amazon's Dynamo - All Things Distributed
Amazon's DynamoOctober 02, 2007 • 4557 words In two weeks we’ll present a paper on the Dynamo technology at SOSP, the prestigious biannual Operating Systems conference. Dynamo is internal technology developed at Amazon to address the need for an incrementally scalable, highly-available key-value storage system. The technology is designed to give its users the ability to trade-off cost, consistency
inforno :: Python: 勉強ãŒã¦ã‚‰DHT(Kademliaã£ã½ã„ã‚‚ã®)を実装ã—ã¾ã—ãŸ
å‰ã€…ã‹ã‚‰ä¸€åº¦ã˜ã£ãり勉強ã—ãªã„ã¨ãªãã¨æ€ã£ã¦ã„ãŸDHTã¾ã‚ã‚Šã®å‹‰å¼·ãŒã¦ã‚‰Kademliaã£ã½ã„ã‚‚ã®ã‚’Pythonã§å®Ÿè£…ã—ã¦ã¿ã¾ã—ãŸã€‚ Kademliaã¯ã„ã‚ã„ã‚実装ãŒã‚ã‚‹ã®ã§ã€ã‚½ãƒ¼ã‚¹ã‚’èªã‚“ã˜ã‚ƒã†ã¨ç”ãˆã¿ã¡ã‚ƒã£ãŸæ„Ÿã˜ã«ãªã‚‹ã‹ãªãƒ¼ã¨æ€ã£ã¦ã€å…ƒè«–文㨠首藤様ã®è³‡æ–™ ãらã„ã—ã‹è¦‹ãšã«å®Ÿè£…ã—ã¦ã¿ã¾ã—ãŸã€‚ã®ã§ã€ã„ã‚ã„ã‚é–“é•ã£ã¦ã‚‹ã‹ã‚‚知れã¾ã›ã‚“ãŒï½¥ï½¥ï½¥ã€‚ 本家Kademliaã¨ã®ä¸»ãªé•ã„㯠UDPã§ã¯ãªãTCPを使ã£ã¦ã„ã‚‹ ãƒãƒ¼ã‚«ãƒ«ç’°å¢ƒã—ã‹ã‚‚ã£ã¦ã„ãªã„ã®ã§ã€UDPパケットãŒãƒã‚¹ã—ã‚„ã™ã„å ´åˆ(WAN)を想定ã—ã¦å®Ÿè£…ã™ã‚‹ã®ãŒã‚ã‚“ã©ãã•ã„。 よã£ã¦RPC-IDã‚’ã¤ã‘ã¦ã„ãªã„。 パケットã®åˆ†å‰²ã‚„å†é€ã‚‚TCPã«ãŠã¾ã‹ã›ã€‚ original publisherã‹ã‚‰ä¸€å®šæ™‚é–“publishã‚’å—ã‘ãªãã¦ã‚‚ã‚¤ãƒ³ãƒ‡ãƒƒã‚¯ã‚¹æƒ…å ±ã‚’expireã—ã¦ã„ãªã„ 実装ã™ã‚‹ã®ã¯ç°¡å˜ã§ã™ã€‚ ノードãŒãƒãƒƒãƒˆãƒ¯ãƒ¼ã‚¯ã«å‚åŠ ã—ãŸã¨ãã€Indexæƒ…å ±ã‚’
ã„ã¾åˆ†æ•£ã‚·ã‚¹ãƒ†ãƒ ãŒé¢ç™½ã„ç†ç”± - Blog by Sadayuki Furuhashi
最近 クラウド ã¨ã„ã†å˜èªžãŒæµè¡Œã—ã¦ã„ã¾ã™ãŒã€ã€Œå¤§è¦æ¨¡ãªè¨ˆç®—資æºã‚’低コストã§æä¾›ã—ã¦ãれるトコãƒãŒã‚るらã—ã„ã®ã§ã€è‡ªå‰ã§æŒã£ã¦ã„ãŸè¨ˆç®—資æºã‚’委託ã—ã¡ã‚ƒãˆã°é‹ç”¨ã™ã‚‹æ‰‹é–“も知è˜ã‚‚è¦ã‚‰ãªã„ã—ã€ãã‚‚ãもサーãƒãƒ¼ã‚’è²·ã†è²»ç”¨ã‚’çœã‘ã¡ã‚ƒã†ã‹ã‚‰å¬‰ã—ã„ã€ã¨ã„ã†ç™ºæƒ³ã«åŸºã¥ã„ã¦ã„るらã—ãã€ã—ã‹ã—技術的ã«ã¯ 大è¦æ¨¡ãªè¨ˆç®—資æºã‚’低コストã§æ§‹ç¯‰ã™ã‚‹æŠ€è¡“ ãŒãƒã‚¤ãƒ³ãƒˆã§ã—ょã†ã€‚ 大è¦æ¨¡ãªè¨ˆç®—資æºã‚’ã©ã†ã‚„ã£ã¦å®‰ã構築ã™ã‚‹ã‹ã€‚ 従æ¥ã¯ã€ã‚·ã‚¹ãƒ†ãƒ ã®èƒ½åŠ›ã‚’高ã‚ã‚‹ãŸã‚ã«ã¯ã€é«˜æ€§èƒ½ãƒ»é«˜æ©Ÿèƒ½ï¼ˆãれゆãˆé«˜ä¾¡ãªï¼‰ãƒžã‚·ãƒ³ã‚’å°Žå…¥ã™ã‚‹ã¨ã„ã†ã‚¹ã‚±ãƒ¼ãƒ«ã‚¢ãƒƒãƒ—ã®æ‰‹æ³•ãŒæŽ¡ã‚‰ã‚Œã¦ã„ãŸã®ã ãŒã€ã“ã®æ‰‹æ³•ã§ã¯10å€ã«æ€§èƒ½ã‚’上ã’ã‚‹ãŸã‚ã«ã€ãŸã¨ãˆã°30å€ã®ã‚³ã‚¹ãƒˆãŒã‹ã‹ã‚‹ã‹ã‚‚ã—ã‚Œãªã„。スケールアップã¨æ¯”ã¹ã¦ã‚¹ã‚±ãƒ¼ãƒ«ã‚¢ã‚¦ãƒˆã§ã¯ã€å°Žå…¥ã—ãŸã‚³ã‚¹ãƒˆã«ã»ã¼æ¯”例ã—ã¦ã€ãƒ‘フォーマンスã®å‘上ãŒè¦‹è¾¼ã‚る。 『UNIX magazine 2009å¹´4月å·ã€ p.31 *1 何百万円もã™
Scalable, Distributed Data Structures for Internet Service Construction
Next: 1. Introduction Scalable, Distributed Data Structures for Internet Service Construction Steven D. Gribble, Eric A. Brewer, Joseph M. Hellerstein, and David Culler The University of California at Berkeley {gribble,brewer,jmh,culler}@cs.berkeley.edu Abstract This paper presents a new persistent data management layer designed to simplify cluster-based Internet service construction. This self-ma
P2Pã¨åˆ†æ•£ãƒãƒƒã‚·ãƒ¥ãƒ†ãƒ¼ãƒ–ル〜ãã®ï¼‘
ã•ã¦ã€P2Pã§ã¯æœ€è¿‘「分散ãƒãƒƒã‚·ãƒ¥ãƒ†ãƒ¼ãƒ–ルã€ã¨ã„ã†ã‚ーワードをよãèžãã¾ã™ã€‚分散ãƒãƒƒã‚·ãƒ¥ãƒ†ãƒ¼ãƒ–ルã¤ã„ã¦ã¯å¾Œã§ç´¹ä»‹ã—ã¾ã™ãŒã€ã“れを用ã„ã‚‹ã¨ãƒ«ãƒ¼ãƒ†ã‚£ãƒ³ã‚°ã€æ¤œç´¢ãŒé«˜é€Ÿã«ã€ã—ã‹ã‚‚P2Pãƒãƒƒãƒˆãƒ¯ãƒ¼ã‚¯å…¨ä½“ã«å¯¾ã—ã¦é©ç”¨ã™ã‚‹ã“ã¨ãŒã§ãã¾ã™ã€‚例ãˆã°æ—¢ã«eMuleã¨å‘¼ã°ã‚Œã‚‹ãƒ•ã‚¡ã‚¤ãƒ«å…±æœ‰ã‚·ã‚¹ãƒ†ãƒ ã§ã¯åˆ†æ•£ãƒãƒƒã‚·ãƒ¥ãƒ†ãƒ¼ãƒ–ルã®ä¸€ç¨®ã§ã‚ã‚‹kademliaãŒä½¿ã‚ã‚Œã¦ã„ã¾ã™ã€‚ã§ã¯ãã‚‚ãも分散ãƒãƒƒã‚·ãƒ¥ãƒ†ãƒ¼ãƒ–ルã¨ã¯ã©ã†ã„ã†ã‚‚ã®ãªã®ã§ã—ょã†ã‹ï¼Ÿãれを説明ã™ã‚‹ã«ã¯ã¾ãšæ¤œç´¢ã§ä½¿ã‚れるãƒãƒƒã‚·ãƒ¥æ³•ã‚’説明ã™ã‚‹å¿…è¦ãŒã‚ã‚Šã¾ã™ã€‚ [ãŠçŸ¥ã‚‰ã›]分散ãƒãƒƒã‚·ãƒ¥ãƒ†ãƒ¼ãƒ–ル（ＤＨＴ）ã«ã¤ã„ã¦ã‚ã‹ã‚Šã‚„ã™ã解説ã—ãŸãƒšãƒ¼ã‚¸ã‚’作りã¾ã—ãŸã€‚ ＤＨＴã«èˆˆå‘³ã®ã‚ã‚‹æ–¹ã¯ã¾ãšã“ã¡ã‚‰ã‚’ã”覧下ã•ã„。 分散ãƒãƒƒã‚·ãƒ¥ãƒ†ãƒ¼ãƒ–ル（ＤＨＴ）入門〜ãã®ï¼‘ ãƒãƒƒã‚·ãƒ¥æ³• 今ã€ã‚るデータベースを考ãˆã¦ãã ã•ã„。ã“ã“ã«ã¯äººã®åå‰ã¨èº«é•·ãŒæ›¸ã„ã¦ã‚るテーブルã¨ã—ã¾ã—ょã†ã€‚例ãˆã° table_1={
1
リリースã€éšœå®³æƒ…å ±ãªã©ã®ã‚µãƒ¼ãƒ“スã®ãŠçŸ¥ã‚‰ã›
最新ã®äººæ°—エントリーã®é…ä¿¡
j次ã®ãƒ–ックマーク
kå‰ã®ãƒ–ックマーク
lã‚ã¨ã§èªã‚€
eコメント一覧を開ã
oページを開ã
Google Code Archive - Long-term storage for Google Code Project Hosting.
{{#tags}}- {{label}}
{{/tags}}