smcFanControl: system utility of MAC

smcFanControl 算是一個蠻不錯用的系統小工具! 你可以藉由它來控制系統內的風扇轉速。

在 MAC 出機時, 預設的轉速都在 2000 rpm 左右; 這樣的情況下, 風扇的聲音幾乎是聽不到, 但散熱的效果就變得比較有限。

以我的 MBP (C2D 2.2G) 來說, 預設的轉速下, 系統平均溫度都在 51 - 55 度上下, 一旦系統負載提高或執行需 CPU 運算的程式, 溫度就很容易衝上去! 當然, 居高不下的狀況下, 最後的結果就是熱當... :(

利用 smcFanControl 將轉速設至 4000 rpm 時, 系統平均溫度都在 37 - 43 度左右, 平常摸起來都燙燙的出風口, 幾乎都感覺不到熱度! 經過使用一陣子後, 大概設在 3500 rpm 左右, 系統的溫度大概都維持在 43 - 48 度左右。這算是很一般的溫度, 出風口也不會燙。

至於, 為什麼我會設在 3500 rpm? 是因為經過爬文的結果加上個人的推測, 預設 2000 rpm 並不是沒有道理。經常維持在高轉速的情況下, 系統風扇可能因此降低使用時限! 所以, 不建議調太高!

Comments

Post a Comment

Popular posts from this blog

How to show only month and year fields in android Date-picker?

Image
Android default DatePicker show day/month/year fields but you have to customize this DatePicker as your requirements. Suppose that you want to show only month and year fields in android datepicker . To do this, you have to customize the Dialog DatePicker source code but it is not an easy task. In this tutorial I will show you a tricky way to solve this problem. Lets see how to show only month and year field in android DatePicker as a dialog.   Step to show only month and year fields in android date-picker: Some days ago I got this same problem and here I am trying to explain this in a sequential manner. I want to show a dialog datepicker when user click on an EditText. So if user click on EditText, A dialog datepicker will be invocked and it will show only month and year fields. To do this, at first we have to create a xml layout to hold the EditText fields. So create an android project and name it DatePickerExample. In the main.xml file just try to write this simple code....
Read more

How to construct a B+ tree with example

Image
A B+ tree contains n-1 search key values K1K2…….Kn-1 and have n pointers.   In a B+ tree the data are ordered  sequentially.  The leaf node may hold up to n pointers and must hold at least N/2 pointers. The root node must hold at least two pointers, unless the tree consists of only one node.  Now we construct a B+ tree. Construct a B+ tree for the following set of key values: (2,3,5,7,11,17,19,23,29,31) Assume that the tree is initially empty and values are added in ascending order. Construct a B+ tree where the pointer number is Four. Solution: When a node exceeds n-1 search key value then we split it into two nodes. First node contains (ceiling(n-1)/2) values.  2 nd node contains remaining node. Copy the smallest search key value of the second node to the parent node. Let's start, we know each node has N pointer and has N-1 search key values. In our example pointer number is 4, so the search key value is 4-1=3. So each node has 4 pointers and 3 search key val...
Read more

Conflict Serializability in database

Image
To maintains database state consistency we introduce serializability. Using serializability we can understand which schedule will ensure consistency, and which schedule will not. When we are capable of converting a concurrent schedule into a serial schedule then we cal it serializable schedule. A schedule is serializable if it is equivalent to a serial schedule. We divided this concepts into two parts 1. Conflict serializability  & 2. View serializability In this discussion I just clarify you the conflict serializability. Consider two instruction read, write and the data item A and B. When two instruction execute different data item such as read(A) and read(B), then we can swap the instruction without affecting the result of the schedule. But when the data item is equivalent to one another we need to consider following four condition.    a.   read (A ),    read ( A ).   they   don’t conflict.    b.   read ( Q),  ...
Read more