Skip to main content

Get the best research tool on the web today,and free!
Connect with people with common interests!

Play Webslides

jun zhang's Bookmarks tagged no_tag → View Popular

You are here: Diigo Home > jun zhang's Bookmarks

Ads by Google

Expand All 1 - 13 of 13

4Expand

Threading models: So many different ways to get stuff done. at time to bleed

Tags: no_tag on 2008-10-28 -All Annotations (4) -About

more fromtimetobleed.com

5Expand

I/O models: how you move your data matters at time to bleed

Tags: no_tag on 2008-10-28 -All Annotations (5) -About

more fromtimetobleed.com

6Expand

How to Design Programs: An Introduction to Computing and Programming

Tags: no_tag on 2008-10-25 and saved by3 people -All Annotations (6) -About

more fromwww.htdp.org

2Expand

H.323、SIP、MGCP、H.248和软交换 - 统一通信 net.ChinaUnix.net

Tags: no_tag on 2008-10-14 -All Annotations (2) -About

more fromnet.chinaunix.net

4Expand

Shuttleworth: Python needs to focus on future - News - heise open source UK

Tags: no_tag on 2008-09-18 -All Annotations (4) -About

more fromwww.heise-online.co.uk

1Expand

祥林嫂精神恍惚痛苦呼唤之关于Suffix Tree - 负暄琐话 - CSDNBlog

Tags: no_tag on 2008-09-14 and saved by2 people -All Annotations (2) -About

more fromblog.csdn.net

3Expand

Eli Bendersky’s website » Blog Archive » Initializing an array in constant time

一个有趣的算法，在固定时间初始化数组

Tags: no_tag on 2008-08-27 -All Annotations (0) -About

more fromeli.thegreenplace.net

2Expand

Dr. Dobb's | Choose Concurrency-Friendly Data Structures | m 27, 2008

Tags: no_tag on 2008-08-07 -All Annotations (0) -About

more fromwww.ddj.com

1Expand

Dr. Dobb's | Choose Concurrency-Friendly Data Structures | m 27, 2008

Tags: no_tag on 2008-08-07 -All Annotations (0) -About

more fromwww.ddj.com

6Expand

Distributed Hash Tables, Part I

Tags: no_tag on 2008-08-06 and saved by3 people -All Annotations (0) -About

more fromwww.linuxjournal.com

First, take the key and hash it to generate a key
of exactly k bits. Treat this number as a node ID, and determine which
node is its successor by starting at any point in the ring and working
clockwise until a node is found whose ID is closest to but still greater
than the key. The node you find is the node responsible for storage and lookup for
that particular key (Listing 2).
The new node
is responsible for some portion of the keys for which the predecessor node
was responsible. In order to ensure that all lookups work
without fail, the appropriate portion of keys should be copied to the new
node before the predecessor node changes its next node pointer to point
to the new node.
Therefore, n/2 traversed nodes can be quite slow.
In order to achieve better performance, the Chord design adds a layer to
access O(log n) performance.
each node stores a “finger table” containing the
addresses of k
nodes.
the finger table needs to be
kept up to date.

1Expand

Chord (distributed hash table) - Wikipedia, the free encyclopedia

Tags: no_tag on 2008-08-04 and saved by2 people -All Annotations (0) -About

more fromen.wikipedia.org

1Expand

Non-blocking synchronization - Wikipedia, the free encyclopedia

Tags: no_tag on 2008-08-04 -All Annotations (0) -About

more fromen.wikipedia.org

1Expand

DBA notes - Web 2.0 网站架构、优化数据库架构

Tags: no_tag on 2008-07-30 and saved by14 people -All Annotations (0) -About

more fromwww.dbanotes.net

1 - 13 of 13

List 20 50 100

Notation: * = Private bookmark and comment|… = Clipping [?] | … = Public highlight [?]

jun zhang's Related Tags

Selected tags

no_tag

Related tags

See More Top Contributors

Alexandre Enkerli Kyle Doerksen cheaptoys games goodigg crazyoldwisdom sriks6711

Related Groups on Diigo

KDR Tau Chapter

Members (2)

bookmarks (1)
alwaha

Members (3)

bookmarks (1)
1PPPRET-PM

Members (1)

bookmarks (1)