Arabic cursive optical character recognition (OCR) based on the dynamic time warping (DTW) algorithm provides simultaneously very interesting segmentation and recognition rates. However, the computing complexity of the DTW algorithm restricts its widespread utilization and its consideration at a commercial scale. Accelerating the DTW execution time has attracted many researchers and several solutions have already been proposed. These solutions are commonly based on very specialized processors and hardware architectures and as such they remain very expensive and not amenable to a large scale utilization. In a previous work, we found that loosely coupled architectures can indeed provide viable infrastructures to implement a distributed Arabic OCR. Our objective here is to allow the recognition of huge quantities of Arabic documents such as those of certain national libraries. Undoubtedly, enough processing power and storage capabilities are needed. In this paper, we proposed and used a peer-to-peer (P2P) architecture using the scientific research Tunisian grid (SRTG). Conducted experiments testify that our proposed architecture provides very adequate speedups of the DTWbased

Abstract: In spite of the diversity of printed Arabic optical character recognition products and proposals, the problem seems to be not yet well solved. The complex morphology and calligraphy of the Arabic writing on one hand and the use of some light approaches on the other hand are behind the poorness of these products. However, some strong proposed approaches didn’t find the opportunity to be commercialised because of generally their corresponding complex computing. The dynamic time warping algorithm is considered as one among these strong approaches. In fact, several studies and experiments have shown and confirmed that the printed Arabic optical character recognition based on dynamic time warping algorithm provides a very interesting recognition rate especially for large and huge vocabularies. One of the attractive sides of the dynamic time warping algorithm is its ability to recognize properly connected or cursive characters (words or sub words) without prior segmentation. Furthermore, this algorithm performs the recognition process from within a reference library of isolated characters and owns a very good immunity against noises. Unfortunately, the big amount of its computing during the recognition process makes its execution time very slow and, hence, restricts its utilization. Many researchers attempted to speedup the execution time of this algorithm. Unfortunately, the corresponding proposed solutions require generally specific high cost architectures. Loosely coupled architectures such as grapes or grid computing can provide enough power without additional cost to distribute the complexity of some greedy applications. Consequently, we report in this paper the performance analysis of an analytical and an experimental study of a distributed Arabic optical character recognition based