Special Issue on Parallel Architecture, Algorithms and Programming
Guest Editors: Jigang Wu and Guozhi Song
The quest for using parallelism to enhance the performance of computing and computing systems is one of the most
challenging but also rewarding fields of research in computer science. The parallel computing and related architecture,
algorithms and programming technique play a key role in shaping future research and development activities in both
academia and industry. In recent years, more and more researchers have recognized the fact that parallel architectures,
algorithms and programming play an important role in improving the efficiency of computing systems, and hence
continuously present their valuable research results in this field.
This special issue comprising of six papers is focused on the various aspects of parallel computing and its
applications. All of them are excellent papers selected from the proceedings of the fourth International Symposium on
Parallel Architectures, Algorithms and Programming (PAAP 2011), which was held in Tianjin, China, December 5-7,
2011. The conference series on Parallel Architectures, Algorithms and Programming (PAAP) has been the premier
forum and meeting point for researchers and practitioners from academia and industry for presenting and discussing
leading edge parallel systems research since its first edition in 2003 as celebration of the 50th anniversary of the
University of Science and Technology of China and Academician Guoliang Chen’s 70th birthday. The ensuing
conferences then took place in Nanning and Dalian in 2009 and 2010 respectively. Papers were selected on the basis of
fundamental ideas/concepts rather than the thoroughness of techniques deployed. The papers are organized as follows.
The paper titled "A Parallel Clustering Algorithm with MPI –MKmeans" presents a proposed a parallel K-means
algorithm based on MPI (called MKmeans) which enables applying the clustering algorithm effectively in the parallel
environment.
The paper titled “An ID-Based Certified E-mail protocol with STTP Suitable for wireless mobile environments”
proposes an improved identity-based signcryption with re-encryption scheme and a novel certified e-mail protocol in
wireless resources-constrained networks.
The paper titled “Using A Runtime to Overcome The Pathologies in Hardware Transactional Memory Systems”
analyses the advantages and disadvantages of existing conflict management and version management schemes and two
pathologies are found stemmed from the interplay between the conflict management and version management that may
impact thread level parallelism significantly.
The paper titled “Deadlock-free Routing Scheme for Irregular Mesh Topology NoCs with Oversized Regions”
proposes a hybrid scheme multiphase routing algorithm for irregular mesh integrating oversized rectangle modules
which is applicable to the application-specific NoC systems with a few oversized components.
The paper titled “A TTA-like Processor for Fast RSA Key Generation Using RNS” presents a cipher processor
based on Transport Triggered Architecture (TTA) to realize the parallelism at the architecture level, and is shown that a
high performance and small area for RSA key pair generation can be achieved.
The paper titled “Iris Recognition Using Stable Dark Features” presents a novel approach in which stable dark
regions and a Gabor-based model are employed to identify stable features in iris images, and the superior performance
recognition can be achieved.
It has been a great pleasure to run this special issue, which reveals important research results in the field of parallel
algorithms, scheduling and architectures. We would like to thank Prof. Prabhat Mahanti, Editor-in-Chief of Journal of
Computers, and Dr. George J. Sun, Executive Editor of Academy Publisher, for giving us the opportunity to organize
this special issue and for their great help in the organization of this issue. We thank all authors for their submissions and
all reviewers for their diligent work in evaluating these submissions. We sincerely hope that you enjoy reading these
distinguished papers.
General Information
ISSN: 1796-203X
Abbreviated Title: J.Comput.
Frequency: Bimonthly
Abbreviated Title: J.Comput.
Frequency: Bimonthly
Editor-in-Chief: Prof. Liansheng Tan
Executive Editor: Ms. Nina Lee
Abstracting/ Indexing: DBLP, EBSCO, ProQuest, INSPEC, ULRICH's Periodicals Directory, WorldCat,etc
E-mail: jcp@iap.org
-
Nov 14, 2019 News!
Vol 14, No 11 has been published with online version [Click]
-
Mar 20, 2020 News!
Vol 15, No 2 has been published with online version [Click]
-
Dec 16, 2019 News!
Vol 14, No 12 has been published with online version [Click]
-
Sep 16, 2019 News!
Vol 14, No 9 has been published with online version [Click]
-
Aug 16, 2019 News!
Vol 14, No 8 has been published with online version [Click]
- Read more>>