Prefetching with Helper Threads for Loosely Coupled Multiprocessor Systems

This paper presents a helper thread prefetching scheme that is designed to work on loosely coupled processors, such as in a standard chip multiprocessor (CMP) system or an intelligent memory system. Loosely coupled processors have an advantage in that resources such as processor and L1 cache resources are not contended by the application and helper threads, hence preserving the speed of the application. However, interprocessor communication is expensive in such a system. We present techniques to alleviate this. Our approach exploits large loop-based code regions and is based on a new synchronization mechanism between the application and helper threads. This mechanism precisely controls how far ahead the execution of the helper thread can be with respect to the application thread. We found that this is important in ensuring prefetching timeliness and avoiding cache pollution. To demonstrate that prefetching in a loosely coupled system can be done effectively, we evaluate our prefetching by simulating a standard unmodified CMP system and an intelligent memory system where a simple processor in memory executes the helper thread. Evaluating our scheme with nine memory-intensive applications with the memory processor in DRAM achieves an average speedup of 1.25. Moreover, our scheme works well in combination with a conventional processor-side sequential L1 prefetcher, resulting in an average speedup of 1.31. In a standard CMP, the scheme achieves an average speedup of 1.33. Using a real CMP system with a shared L2 cache between two cores, our helper thread prefetching plus hardware L2 prefetching achieves an average speedup of 1.15 over the hardware L2 prefetching for the subset of applications with high L2 cache misses per cycle.     

Mechanochemical synthesis of kaolin-KH2PO4 and kaolin-NH4H2PO4 complexes for application as slow release fertilizer

A milling process to reduce kaolin to amorphous phase in the presence of KH₂PO₄ or NH₄H₂PO₄ and allow mechanochemical (MC) reaction for incorporation of KH₂PO₄ and NH₄H₂PO₄ into the kaolin structure was investigated in this work. Mixtures of kaolin and KH₂PO₄ and NH₄H₂PO₄ in separate systems were prepared by milling in a planetary ball mill. Tests with kaolin contents ranging from 25 to 75 wt.% and mill rotational speeds from 200 to 700 rpm were performed to evaluate incorporation of KH₂PO₄ and NH₄H₂PO₄ and release of K⁺, NH₄⁺ and PO₄³⁻ ions into solution. Analyses by XRD, DTA and ion chromatography indicated that the MC process was successfully applied to incorporate both KH₂PO₄ and NH₄H₂PO₄ into the amorphous kaolin structure. Release of K⁺ and PO₄³⁻ ions from the system (kaolin-KH₂PO₄) when dispersed in water for 24 h reached only up to 10%. Under similar conditions for the system (kaolin-NH₄H₂PO₄), release of NH₄⁺ and PO₄³⁻ ions reached between 25 and 40%. These results indicated that the MC process can be developed to allow amorphous kaolin to act as a carrier of K⁺, NH₄⁺ and PO₄³⁻ nutrients to be released slowly for use as fertilizer.     

Correlation prefetching with a user-level memory thread

This paper proposes using a user-level memory thread (ULMT) for correlation prefetching. In this approach, a user thread runs on a general-purpose processor in main memory, either in the memory controller chip or in a DRAM chip. The thread performs correlation prefetching in software, sending the prefetched data into the L2 cache of the main processor. This approach requires minimal hardware beyond the memory processor: The correlation table is a software data structure that resides in main memory, while the main processor only needs a few modifications to its L2 cache so that it can accept incoming prefetches. In addition, the approach has wide applicability, as it can effectively prefetch even for irregular applications. Finally, it is very flexible, as the prefetching algorithm can be customized by the user on an application basis. Our simulation results show that, through a new design of the correlation table and prefetching algorithm, our scheme delivers good results. Specifically, nine mostly-irregular applications show an average speedup of 1.32. Furthermore, our scheme works well in combination with a conventional processor-side sequential prefetcher, in which case the average speedup increases to 1.46. Finally, by exploiting the customization of the prefetching algorithm, we increase the average speedup to 1.53.     

Integral ratio: a new class of global thresholding techniques forhandwriting images

We propose a class of histogram based global thresholding techniques called integral ratio. They are designed to threshold gray-scale handwriting images and separate the handwriting from the background. The following tight requirements must be met: 1) all the details of the handwriting are to be retained, 2) the writing paper used may contain strong colored and/or patterned background which must be removed, and 3) the handwriting may be written using a wide variety of pens such as a fountain pen, ballpoint pen, or pencil. A specific application area which requires these tight requirements is forensic document examination, where a handwritten document is often considered as legal evidence and the handwriting must not be tampered with or modified in any way. The proposed class of techniques is based on a two stage thresholding approach requiring each pixel of a handwritten image to be placed into one of three classes: foreground, background, and a fuzzy area between them where it is hard to determine whether a pixel belongs to the foreground or the background. Two techniques, native integral ratio (NIR) and quadratic integral ratio (QIR), were created based on this class and tested against two well-known thresholding techniques: Otsu's (1979) technique and the entropy thresholding technique. We found that QIR has superior performance compared to all the other techniques tested