最近打算用kilim做一個rpc框架， kilim有自己的nio框架 而在業界有強勁的netty和mina。

所以問了一下kilim的作者，他的回答說 因為底層用的都是java nio的api，所以留給nio框架最主要的問題是這2點：

(i) 為了處理很多socket連接和優化吞吐量，會導致了大量的線程切換。

Amount of thread switching done to handle n numbers of sockets and optimizing for throughput.

(ii) 有很多次的selector的中斷和調用，喚醒seletor是很費資源的操作。

所以能做的優化有以下幾點：

1、對read writer process操作分別作輕量級的scheduler，基于actor。

2、有個trick，就是read或者write操作時候，但沒有讀滿或者寫完的情況下，并不是立即返回并再次注冊channel到selector，而是再嘗試若干次（3次），再返回并注冊到selector。在mina中也有同樣的處理。不同之處在于kilim會yield的當前task，而mina為了避免線程切換，只是做了簡單的while循環。但目的都是減少線程切換和避免多次注冊 selector。

mina 處理代碼

for (int i = WRITE_SPIN_COUNT; i > 0; i --)  
{  
localWrittenBytes = ch.write(buf.buf());  
if (localWrittenBytes != 0 || !buf.hasRemaining())  
{  
break;  
}  
} 

kilim nio的處理

while (remaining > 0)  
{  
if (n == 0)  
{  
yieldCount++;  
if (yieldCount < YIELD_COUNT)  
{  
Task.yield(); // don't go back to selector yet.  
} else  
{  
pauseUntilWritable();  
yieldCount = 0;  
}  
}  
n = ch.write(buf);  
remaining -= n;  
} 

除了上面說的2個因素以外，還有有哪些因素會影響nio的性能？

原文如下：

I have not tested netty, but here's my experience. All NIO frameworks, Kilim included, are comparable because they use the same underlying NIO API. The difference in performance _may_ stem from the following two sources:

(i) Amount of thread switching done to handle n numbers of sockets and optimizing for throughput.

(ii) Number of times the selector is interrupted and invoked. Waking up the selector is an expensive operation.

The first one is entirely up to the user of the Kilim NIO library. A typical server request consists of one or more reads to accumulate the frame, processing the packet, and one or more writes to write a packet to the socket. One can split up this work between multiple schedulers if you wish. By default, all reading and writing is done outside of the selector's thread. Which brings me to the next point.

I have optimized the access to the selector, by avoiding using it as much as possible. If a socket read or write is unable to transfer any bytes, then the task simply yields. Other runnable tasks get a chance to run. When the task is subsequently resumed, it retries the operation. This goes on for a fixed number of times (3), and if it still fails, it sends a message to the selector thread to wake it up whenever the socket is ready. See the comments on kilim.nio.EndPoint.

Please keep us posted about your netty experiments.

原文地址：http://wangscu.iteye.com/blog/664688

【編輯推薦】

1. java.nio.Buffer的一些基礎知識的備忘
2. Java與Cobol對決：Cobol軟件質量最過硬
3. 甲骨文Java專利遭拒 起訴Android侵權受挫
4. Java企業應用問題代碼最多
5. 微軟警告稱Java乃入侵目標之首