Cleaning of long oval canals with WaveOne Gold system associated with different irrigant agitation protocols

Aim: The aim of the study was to evaluate the cleaning of mandibular incisors with WaveOne Gold® (WO) under different preparation techniques. Methods: A total of 210 human mandibular incisors were selected and divided into seven groups (n = 30), prepared by WO single-files (Small 20/.07 – WOS; Primary 25/.07 – WOP; Medium 35/.06 – WOM; or Large 45/.05 - WOL) and sequential-file techniques (WOS to WOP; WOS to WOM; and WOS to WOL). Further subdivision was made according to irrigation protocol: control group (manual irrigation - CON), E1 Irrisonic® - EIR, and EDDY® - EDD. Debris removal and the smear layer were evaluated by scanning electron microscopy. Data were analyzed by using Spearman’s correlation test. The significance level was set at 5%. Results: For debris and smear layer removal, WOS and WOP, EIR differed from CON and EDD (p <0.05). Conclusion: Regardless of the instrumentation used, the agitation of the irrigant solution provided better cleanability. These findings reinforce the need for agitation techniques as adjuvants in cleaning root canal systems in mandibular incisors.

The Design of an Embedded File System Based on the Flash

Analyzed the unique characteristics of reading and writing the flash memory, and researched the ways of designing a file system. The target embedded file system has the advantages of the traditional file system and the sequential file system. It is able to adapt to the unique characteristics of reading and writing the flash memory. It can solve the inconsistent data problem in the embedded device when power down. And it can solve the bad blocks of the flash which are generated by erase operations also.

Sequential File Prefetching in Linux

Sequential prefetching is a well established technique for improving I/O performance. As Linux runs an increasing variety of workloads, its in-kernel prefetching algorithm has been challenged by many unexpected and subtle problems; As computer hardware evolves, the design goals should also be adapted. To meet the new challenges and demands, a prefetching algorithm that is aggressive yet safe, flexible yet simple, scalable yet efficient is desired. In this chapter, the author explores the principles of I/O prefetching and present a demand readahead algorithm for Linux. He demonstrates how it handles common readahead issues by a host of case studies. Both static, logic and dynamic behaviors of the readahead algorithm are covered, so as to help readers building both theoretical and practical views of sequential prefetching.