閫氬父32浣峜pu浣跨敤2綰ч〉琛ㄦ満鍒跺氨宸茶凍澶燂紝浣嗗埌64浣嶆椂浠ｏ紝2綰ч〉琛ㄤ細(xì)浣塊〉琛ㄧ殑欏規(guī)ュ墽澧炲姞錛屾墍浠ラ氬父浼?xì)鋴社敤鏇村鐨剻宓琛ňUф暟銆?br /> ia64/ppc64/alpha浣跨敤3綰ч〉琛紝x86_64浣跨敤鍒?綰ч〉琛ㄣ備負(fù)鍏煎榪欎簺妯″瀷錛?.6.11涔嬪悗浣跨敤浜嗙粺涓鐨?綰ч〉琛ㄦā鍨?br /> Global Directory
Upper Directory
Middle Directory
Page Table
閽堝涓嶅悓鐨勬灦鏋勶紝璁劇疆姣忎竴綰т笉鍚岀殑鍦板潃浣嶆暟錛?鐨勮瘽灝辨槸涓嶄嬌鐢ㄨ繖涓綰ч〉琛ㄦ満鍒躲?br />
cache
澶歝pu鐜涓紝姣忎釜cpu鏈夎嚜宸辯殑cache錛屽cache鐨勬洿鏂版湁紜歡鏈哄埗淇濊瘉閫氱煡鍏朵粬鐨刢pu榪涜鍚屾銆?鐪熺殑鍚?)
tlb
鐢ㄦ潵cache欏佃〃錛屽姞閫熷湴鍧鐨勮漿鎹㈤熷害銆傛瘡涓猚pu鏈夎嚜宸辯殑tlb錛屼絾涓嶉渶瑕佸悓姝ワ紝鍥犱負(fù)鍦板潃杞崲鍜岃繘紼嬬浉鍏熾?br />
]]>
NPTL:
2.6鍚庡姞鍏ョ殑鏂板疄鐜幫紝redhat as涓?.4灝卞彲浠ユ敮鎸併傛洿絎﹀悎pthread鐨勮鑼冦傜敤鎴風(fēng)嚎紼嬪拰鍐呮牳綰跨▼閲囧彇1:1妯″紡錛屾敮鎸乫loating stack銆?br />
]]>
綆鍗曠殑渚嬪瓙錛宧otspot瑙ｆ瀽妯″紡涓璱const_0鐨勫搴旀眹緙栦唬鐮侊細(xì)
iconst_0 3 iconst_0 [0xb4d98120, 0xb4d98160] 64 bytes
0xb4d98120: sub esp, 0x4
0xb4d98123: fstp dword [esp]
0xb4d98126: jmp 0x1e
0xb4d9812b: sub esp, 0x8
0xb4d9812e: fstp qword [esp]
0xb4d98131: jmp 0x13
0xb4d98136: push edx
0xb4d98137: push eax
0xb4d98138: jmp 0xc
0xb4d9813d: push eax
0xb4d9813e: jmp 0x6
0xb4d98143: push eax
0xb4d98144: xor eax, eax
0xb4d98146: movzx ebx, byte [esi+0x1]
0xb4d9814a: inc esi
0xb4d9814b: jmp dword near [ebx*4+0x6900680]
]]>
1 涓鴻緭鍏ヨ妭鐐規(guī)瀯寤轟竴涓崟鑺傜偣鐨勬爲(wèi) // MAKE_SET
2 瀵規(guī)瘡涓瓙鑺傜偣錛岄掑綊璋冪敤璇ョ畻娉曞畬鎴愬瓙鏍?wèi)鍐呮墍鏈夋煡璇紝
鍐嶅皢瀛愯妭鐐圭殑ancester鎸囧悜鏈妭鐐癸紝褰掑茍緇撴灉鏍?nbsp; // UNION
3 澶勭悊瀹屾墍鏈夊瓙鑺傜偣鍚庯紝灝嗘湰鑺傜偣鏍囦負(fù)checked
4 閬嶅巻鏌ヨ闆嗕腑鍜岃鑺傜偣鏈夊叧鐨勬煡璇紝媯鏌ュ彟涓涓妭鐐規(guī)槸鍚﹀凡鏍囦負(fù)checked錛屽鏋滄槸鐨勮瘽璇存槑
1錛?璇ヨ妭鐐瑰湪鏈妭鐐圭殑瀛愭爲(wèi)
2錛?璇ヨ妭鐐瑰拰鏈妭鐐瑰湪鍙︿竴鑺傜偣鐨勫瓙鏍?wèi)涓Q岃屼笖璇ヨ妭鐐瑰凡琚煡璇?br /> 鏃犺鍝鎯呭喌錛屾鏌ヨ鑺傜偣鎵鍦ㄦ爲(wèi)鐨勬牴灝辨槸榪欎袱涓妭鐐圭殑LCA鑺傜偣
濡傛灉娌℃湁鏍囪瘑checked錛屽彧闇綆鍗曡煩榪囷紝褰撻亶鍘嗗埌璇ヨ妭鐐規(guī)椂灝卞彲浠ュ畬鎴愭煡璇簡
涓嬮潰鏄痡ava鐨勫疄鐜頒唬鐮佸拰綆鍗曟祴璇?br />
import java.util.*;
public class Tarjan{
static void lca( Node p, ArrayList<Query> q ){
MAKE_SET(p);
//FIND(p).ancester=p;
for( Node i : p.childs){
lca( i, q );
UNION( p, i );
FIND(p).ancester=p;
}
p.checked=true;
for( Query query : q ){
if( query.p1==p ){
if( query.p2.checked ){
query.result=FIND(query.p2);
}
}else if( query.p2==p ){
if( query.p1.checked ){
query.result=FIND(query.p1);
}
}else{
continue;
}
}
}
static void MAKE_SET( Node p ){
p.ancester = p;
}
static Node FIND( Node p ){
Node r=p;
for( ; r.ancester!=r; r=r.ancester );
return r;
}
static void UNION( Node p, Node q ){
q.ancester=p;
}
public static void main( String args[] ){
// create tree
Node p[]=new Node[24];
p[0]=new Node(0,null); // root
p[1]=new Node(1,p[0]);
p[2]=new Node(2,p[0]);
p[3]=new Node(3,p[0]);
p[4]=new Node(4,p[1]);
p[5]=new Node(5,p[1]);
p[6]=new Node(6,p[1]);
p[7]=new Node(7,p[2]);
p[8]=new Node(8,p[2]);
p[9]=new Node(9,p[3]);
p[10]=new Node(10,p[3]);
p[11]=new Node(11,p[3]);
p[12]=new Node(12,p[4]);
p[13]=new Node(13,p[4]);
p[14]=new Node(14,p[6]);
p[15]=new Node(15,p[8]);
p[16]=new Node(16,p[10]);
p[17]=new Node(17,p[10]);
p[18]=new Node(18,p[14]);
p[19]=new Node(19,p[14]);
p[20]=new Node(20,p[17]);
p[21]=new Node(21,p[17]);
p[22]=new Node(22,p[17]);
p[23]=new Node(23,p[11]);
// make lca query
ArrayList< Query > q= new ArrayList<Query>();
q.add( new Query(p[15], p[19]));
q.add( new Query(p[21], p[16]));
q.add( new Query(p[14], p[14]));
q.add( new Query(p[4], p[23]));
q.add( new Query(p[23], p[16]));
// lca
lca( p[0], q );
// dump results
for( Query item : q ){
System.out.println( item.p1+":"+item.p2+": result is:"+item.result );
}
}
}
class Node{
public Node( int id, Node parent ){
this.id=id;
if( parent != null ){
parent.childs.add(this);
}else{
assert this.id==0;
}
this.checked=false;
this.ancester=null;
this.childs=new ArrayList<Node>();
}
int id;
ArrayList<Node> childs;
public String toString(){
return "Node:<"+id+">";
}
Node ancester; // used for lca search
boolean checked; // used for lca search
}
class Query{
public Query( Node p1, Node p2 ){
assert p1!=null && p2!=null;
this.p1=p1;
this.p2=p2;
this.result=null;
}
Node p1;
Node p2;
Node result;
}
public class Tarjan{
static void lca( Node p, ArrayList<Query> q ){
MAKE_SET(p);
//FIND(p).ancester=p;
for( Node i : p.childs){
lca( i, q );
UNION( p, i );
FIND(p).ancester=p;
}
p.checked=true;
for( Query query : q ){
if( query.p1==p ){
if( query.p2.checked ){
query.result=FIND(query.p2);
}
}else if( query.p2==p ){
if( query.p1.checked ){
query.result=FIND(query.p1);
}
}else{
continue;
}
}
}
static void MAKE_SET( Node p ){
p.ancester = p;
}
static Node FIND( Node p ){
Node r=p;
for( ; r.ancester!=r; r=r.ancester );
return r;
}
static void UNION( Node p, Node q ){
q.ancester=p;
}
public static void main( String args[] ){
// create tree
Node p[]=new Node[24];
p[0]=new Node(0,null); // root
p[1]=new Node(1,p[0]);
p[2]=new Node(2,p[0]);
p[3]=new Node(3,p[0]);
p[4]=new Node(4,p[1]);
p[5]=new Node(5,p[1]);
p[6]=new Node(6,p[1]);
p[7]=new Node(7,p[2]);
p[8]=new Node(8,p[2]);
p[9]=new Node(9,p[3]);
p[10]=new Node(10,p[3]);
p[11]=new Node(11,p[3]);
p[12]=new Node(12,p[4]);
p[13]=new Node(13,p[4]);
p[14]=new Node(14,p[6]);
p[15]=new Node(15,p[8]);
p[16]=new Node(16,p[10]);
p[17]=new Node(17,p[10]);
p[18]=new Node(18,p[14]);
p[19]=new Node(19,p[14]);
p[20]=new Node(20,p[17]);
p[21]=new Node(21,p[17]);
p[22]=new Node(22,p[17]);
p[23]=new Node(23,p[11]);
// make lca query
ArrayList< Query > q= new ArrayList<Query>();
q.add( new Query(p[15], p[19]));
q.add( new Query(p[21], p[16]));
q.add( new Query(p[14], p[14]));
q.add( new Query(p[4], p[23]));
q.add( new Query(p[23], p[16]));
// lca
lca( p[0], q );
// dump results
for( Query item : q ){
System.out.println( item.p1+":"+item.p2+": result is:"+item.result );
}
}
}
class Node{
public Node( int id, Node parent ){
this.id=id;
if( parent != null ){
parent.childs.add(this);
}else{
assert this.id==0;
}
this.checked=false;
this.ancester=null;
this.childs=new ArrayList<Node>();
}
int id;
ArrayList<Node> childs;
public String toString(){
return "Node:<"+id+">";
}
Node ancester; // used for lca search
boolean checked; // used for lca search
}
class Query{
public Query( Node p1, Node p2 ){
assert p1!=null && p2!=null;
this.p1=p1;
this.p2=p2;
this.result=null;
}
Node p1;
Node p2;
Node result;
}
嫻嬭瘯浣跨敤鐨勬爲(wèi)錛?br />
0
+--------------+--------------------+
| | |
1 2 3
+-----+------+ +---+ +-------+---------+
| | | | | | | |
4 5 6 7 8 9 10 11
+---+ + + +--+------+ |
| | | | | | 23
12 13 14 15 16 17
+--------+ +----+----+
| | | | |
18 19 20 21 22
PS錛屽樊鐐瑰繕浜嗭紝紲漧p鐢熸棩蹇箰
]]>
涓鑸潵璇達(dá)紝鍦ㄥ爢涓婂垎閰嶇殑鏁堢巼瑕佷綆浜庢爤錛屻備緥濡傚爢鏄叏灞鐨勶紝鍦ㄥ綰跨▼紼嬪簭涓浣跨敤閿佹潵榪涜鍚屾錛屼笉宸х殑鏄紝緇濆ぇ閮ㄥ垎鐨刯ava紼嬪簭閮芥槸澶氱嚎紼嬬殑銆傚彟涓鏂歸潰錛岄殢鐫瀵硅薄鐨勭敓鎴愬拰閿姣侊紝鍫嗕笂浼?xì)漶旂敓纰庣墖锛岄渶瑕佷竴涓垨澶氫釜freelist鏉ョ淮鎶わ紝榪欐牱涔熼犳垚棰濆鐨勫紑閿錛屼互鍙婄┖闂村埄鐢ㄧ殑浣庢晥銆?br />
浣嗚繖鏄竴鑸琧紼嬪簭鍛樼悊瑙ｇ殑heap綆＄悊鏈哄埗錛屼篃鍥犳鏈塩紼嬪簭鍛樻寚璐ava鐨勫唴瀛樼鐞嗘晥鐜囦綆涓嬨傚叾瀹炲湪jvm鐨勫疄鐜頒腑錛屽畠浼?xì)鐢ㄨ嚜宸辩殑鏂瑰紡鏉ソ帯鐞嗗爢锛屽寮簀ava鐨勬晥鐜囥備互Hotspot涓轟緥錛屾瘡涓嚎紼嬮兘浼?xì)鎷ユ湁涓孌佃嚜宸辯殑絀洪棿縐頒負(fù)TLAB(Thread Local Alloc Buffer)錛岃繖鍧楃┖闂村洜涓哄睘浜庣嚎紼嬬嫭鏈夛紝鎵浠ュ湪鍏朵腑鍒嗛厤瀵硅薄涓嶉渶瑕佸姞閿侊紝鍏跺疄鍜屾爤涓鏍鳳紝鍒嗛厤瀵硅薄鍙灝嗕竴涓寚閽堝鍔爏izeof(object)鍗沖彲銆傚鏋滃璞″お澶ц秴鍑轟簡tlab鐨勫墿浣欑┖闂達(dá)紝姝ゆ椂鏈夊縐嶉夋嫨錛?br /> 鍦╤eap鐨剆hare絀洪棿涓垎閰嶏紝
閲嶆柊鍒嗛厤涓鍧梩lab
鍦╫ld generation涓垎閰?br /> 瑙﹀彂gc錛岄噴鏀懼凡鏈夌┖闂淬?br /> 鍏蜂綋閫夋嫨浣曠鏂瑰紡鐢卞唴瀛樼殑鍒╃敤鎯呭喌鍜宩vm鐨勫唴瀛樼鐞嗙瓥鐣ュ喅瀹氥傜敱澶氫釜鍙傛暟鍙互榪涜璋冩暣銆傛墍浠ュ湪緇濆ぇ閮ㄥ垎鎯呭喌涓嬶紙銆?0%錛夛紝jvm涓璞＄殑鍒嗛厤鍜屾爤涓鏍烽珮鏁堛?br />
鍏充簬瀵硅薄鐨勯噴鏀撅紝灝辨槸java涓憲鍚嶇殑gc鏉ヨ礋璐ｄ簡錛屽叧浜巊c鐨勪粙緇嶅濡傜墰姣涳紝鑰屼笖鍏朵腑鐨勬柟寮忓拰絳栫暐灞傚嚭涓嶇┓錛岃繖鐗囨枃绔犲氨涓嶄粙緇嶄簡銆?br />
浠庝笂闈㈢殑浠嬬粛鍙互鐪嬪嚭錛岃繖縐嶆柟寮忓彲浠ュ姞閫熷璞＄殑鍒嗛厤錛屼絾瀵歸噴鏀句笉鑳戒綔鍒拌薄stack閭ｆ牱楂樻晥錛屽叾瀹炴湁寰堝瀵硅薄鍙槸鐢熷瓨鏈熷緢鐭殑涓存椂瀵硅薄錛屽浣曡瘑鍒繖浜涘璞″茍鍦╰lab涓洿鏈夋晥鐨勯噴鏀懼簲璇ユ槸jvm鍙互榪涗竴姝ヤ紭鍖栫殑鏂瑰悜銆傛嵁鎴戞墍鐭ワ紝jdk6鐨刯vm宸茬粡浣跨敤浜嗙浉鍏崇殑鎶鏈?br />
]]>
鍥炲幓璇曠敤鍚庢灉鐒剁敾闈㈡湁浜嗛璺冦傛媿鎽勪漢鍍忕殑灞傛鎰燂紝绔嬩綋鎰熼兘涓板瘜浜嗕笉灝戙傛崲鏈哄鎹㈠垁鍟娿?br />
浠ュ悗澶ф浼?xì)鍦q欎笂闈㈡姇鍏ヤ笉灝戦挶鍚э紝涓烘垜浠婂悗鐨勯挶鍖呴粯鍝涓涓嬨?br />
]]>