http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
조석한 가톨릭상지전문대학 1997 논문집 Vol.27 No.1
Fine-grained multi-threading requires rapid context switching, which can be slow on architectures with register windows. In past, researchers have either proposed new hardware support for dynamic allocation of windows to threads, or have sacrificed fast procedure calls by fixed allocation of windows to threads. In this paper, buddy allocation file system, which retains fast context switching, is proposed. the evaluation shows that proposed scheme always does better than the other schemes. Some Implications for multi-threaded architectures are also presented. This paper presents 'buddy allocation register file', a mechanism that efficiently supports flexible partitioning of the register file into variable-size contexts with minimal hardware support. Since the number of registers required by thread contexts varies, this flexibility permits a better utilization of scarce registers, allowing more contexts to be regident, which in turn allows applications to tolerate shorter run lengths and longer latencies. It's experiments show that compared to fixed-size hardware contexts and register relocation, buddy register file allocation can improve processor utilization by a factor of three for many applications.