Titlebook: Computational Science and Its Applications - ICCSA 2007; International Confer Osvaldo Gervasi,Marina L. Gavrilova Conference proceedings 20

平息

Supporting Extended UNIX Remove Semantics in the OASIS Cluster Filesystemche coherence. The suggested approach can support the remove UNIX semantics in the distributed environment and easily be adopted in the existing out-of-band cluster filesystems if using their locking mechanism.

Excitotoxin

Postmenopause

An Efficient Garbage Collection Policy for Flash Memory Based Swap Systemsd wear-leveling. Trace-driven simulations show that the proposed policy performs better than existing garbage collection policies in terms of the number of erase operation, the garbage collection time, total amount of energy consumption and the endurance of flash memory.

无动于衷

LIRS-WSR: Integration of LIRS and Writes Sequence Reordering for Flash Memoryrase operations as well as preventing serious degradation of buffer hit ratio. The trace-driven simulation results show that, among the existing buffer replacement algorithms including LRU, CF-LRU, ARC, and LIRS, our LIRS-WSR is best in almost cases for flash storage systems.

Musket

蕨类

Vulnerary

https://doi.org/10.1007/978-1-137-04142-5near axis .-equivalent to the medial axis can be computed from the latter in linear time for almost all general polygons. If the medial axis is not pre-computed, and the polygon contains holes, this implies .(.log.) total computation time for a linear axis.

Obverse

A New Dynamic Programming Algorithm for Orthogonal Ruler Folding Problem in d-Dimensional Space and links have integer value lengths. We propose a dynamic programming approach to fold a given chain whose links have integer lengths in a minimum length in .(.) time and space. We show that by generalizing the algorithm it can be used in .-dimensional space for . such that it requires .(2...) time using .(2...) space.

眨眼

星球的光亮度