CPE1020:ShanghaiGrid: an Information Service Grid
- Author(s):Minglu Li,Min-You Wu ,Ying Li,Jian Cao,Linpeng Huang,Qianni Deng,Xinhua Lin,Changjun Jiang,Weiqin Tong ,Yadong Gui ,Aoying Zhou ,Xinhong Wu,Shui Jiang
- Department of Computer
Science and Engineering, Shanghai Jiao Tong
University, Shanghai, People's Republic of China,Tongji University,
Shanghai, People's Republic of China,Shanghai University,
Shanghai, People's Republic of China,Shanghai Supercomputer
Center, Shanghai, People's Republic of China,Fudan University,
Shanghai, People's Republic of China,Shanghai Urban
Transportation Information Center, Shanghai,
People's Republic of China,East China Institute of
Computer Technology, Shanghai, People's
Republic of China
http://dx.doi.org/10.1002/cpe.1020
CCPE Title/Author Summary
CCPE Metadata
Abstract:The goal of the ShanghaiGrid is to
provide information services to the people. It aims to
construct a metropolitan-area information service
infrastructure and establish an open standard for widespread
upper-layer applications from both communities and the
government. The Information Service Grid Toolkit and a
typical application called the Traffic Information Grid are
discussed in detail. Copyright © 2005 John Wiley
& Sons, Ltd.
CPE904:Scheduling communication in multithreaded
programs: experimental results
- Author(s):Vernon Rego, Juan Carlos Gomez,V. S. Sunderam
- Department of Computer
Sciences, Purdue University, West Lafayette, IN
47907, U.S.A.,Department of
Mathematics and Computer Science, Emory University,
Atlanta, GA 30322, U.S.A.
http://dx.doi.org/10.1002/cpe.904
CCPE Title/Author Summary
CCPE Metadata
Abstract:When the critical path of a
communication session between end points includes the
actions of operating system kernels, there are attendant
overheads. Along with other factors, such as functionality
and flexibility, such overheads motivate and favor the
implementation of communication protocols in user space.
When implemented with threads, such protocols may hold the
key to optimal communication performance and functionality.
Based on implementations of reliable user-space protocols
supported by a threads framework, we focus on our
experiences with internal threads' scheduling
techniques and their potential impact on performance. We
present scheduling strategies that enable threads to do both
application-level and communication-related processing. With
experiments performed on a Sun SPARC-5 LAN environment, we
show how different scheduling strategies yield different
levels of application-processing efficiency, communication
latency and packet-loss. This work forms part of a larger
study on the implementation of multiple thread-based
protocols in a single address space, and the benefits of
coupling protocols with applications. Copyright ©
2005 John Wiley & Sons, Ltd.
CPE905:Performance comparison of MPI and OpenMP on shared
memory multiprocessors
- Author(s):Franck Cappello,G?raud Krawezik
- LRI, Universit? de
Paris Sud, Orsay, France,
- http://dx.doi.org/10.1002/cpe.905
- CCPE Title/Author Summary
- CCPE Metadata
- Abstract:When using a shared memory
multiprocessor, the programmer faces the issue of selecting
the portable programming model which will provide the best
performance. Even if they restricts their choice to the
standard programming environments (MPI and OpenMP), they
have to select a programming approach among MPI and the
variety of OpenMP programming styles. To help the
programmer in their decision, we compare MPI with three
OpenMP programming styles (loop level, loop level with large
parallel sections, SPMD) using a subset of the NAS benchmark
(CG, MG, FT, LU), two dataset sizes (A and B), and two
shared memory multiprocessors (IBM SP3 NightHawk II, SGI
Origin 3800). We have developed the first SPMD OpenMP
version of the NAS benchmark and gathered other OpenMP
versions from independent sources (PBN, SDSC and RWCP).
Experimental results demonstrate that OpenMP provides
competitive performance compared with MPI for a large set of
experimental conditions. Not surprisingly, the two best
OpenMP versions are those requiring the strongest
programming effort. MPI still provides the best performance
under some conditions. We present breakdowns of the
execution times and measurements of hardware performance
counters to explain the performance differences. Copyright
© 2005 John Wiley & Sons, Ltd.
CPE907:Measuring and modelling the performance of a
parallel ODMG compliant object database server
- Author(s):Norman W. Paton,G?raud Krawezik,Jim Smith,Paul Watson
- Department of Computer
Science, University of Manchester, Oxford Road,
Manchester M13 9PL, U.K.,Department of Computer
Science, University of Newcastle upon Tyne,
Newcastle upon Tyne NE1 7RU, U.K.,
- http://dx.doi.org/10.1002/cpe.907
- CCPE Title/Author Summary
- CCPE Metadata
- Abstract:Object database management systems
(ODBMSs) are now established as the database management
technology of choice for a range of challenging data
intensive applications. Furthermore, the applications
associated with object databases typically have stringent
performance requirements, and some are associated with very
large data sets. An important feature for the performance of
object databases is the speed at which relationships can be
explored. In queries, this depends on the effectiveness of
different join algorithms into which queries that follow
relationships can be compiled. This paper presents a
performance evaluation of the Polar parallel object database
system, focusing in particular on the performance of
parallel join algorithms. Polar is a parallel,
shared-nothing implementation of the Object Database
Management Group (ODMG) standard for object databases. The
paper presents an empirical evaluation of queries expressed
in the ODMG Query Language (OQL), as well as a cost model
for the parallel algebra that is used to evaluate OQL
queries. The cost model is validated against the empirical
results for a collection of queries using four different
join algorithms, one that is value based and three that are
pointer based Copyright © 2005 John Wiley &
Sons, Ltd.