| Budget Amount *help |
¥17,940,000 (Direct Cost: ¥13,800,000、Indirect Cost: ¥4,140,000)
Fiscal Year 2013: ¥2,470,000 (Direct Cost: ¥1,900,000、Indirect Cost: ¥570,000)
Fiscal Year 2012: ¥2,470,000 (Direct Cost: ¥1,900,000、Indirect Cost: ¥570,000)
Fiscal Year 2011: ¥4,680,000 (Direct Cost: ¥3,600,000、Indirect Cost: ¥1,080,000)
Fiscal Year 2010: ¥2,470,000 (Direct Cost: ¥1,900,000、Indirect Cost: ¥570,000)
Fiscal Year 2009: ¥5,850,000 (Direct Cost: ¥4,500,000、Indirect Cost: ¥1,350,000)
|
|---|
| Research Abstract |
We can implement language systems with the functionality of dynamic maintenance of software execution by using a language mechanism (called L-closures) which enables legitimate manipulation of execution states. In this study, we applied the proposed mechanism to the efficient implementation of proper tail recursion. We also proposed and evaluated various schemes for exploiting available resources in parallel systems by applying the proposed mechanism to dynamic load balancing. Using a new implementation of the proposed mechanism, we reduced amortized invocation costs of L-closures. We also supported x86-64 in the compiler implementation, and evaluated the effect of register allocation for short functions.
|
