Random scale-free overlay topologies provide a number of properties like for example high resilience against failures of random nodes, small (average) diameter as well as good expansion and congestion characteristics ...
详细信息
In mobile collaborative applications, collaborating agents can move across heterogeneous networks. The collaborating agents also keep changing their roles depending on the work to be performed at that time. I n such s...
详细信息
Using a distributed database system as part of a distributed web server architecture has obvious advantages. It is shown that a first phase distributed database system can be build by extending an existing object orie...
详细信息
A role paradigm conformance model (RPCM) called Typehole model was developed and implemented in Java. It does not use Is-role-of inheritance and is free from the object schizophrenia (OS) problem (OSP). An extended di...
详细信息
This paper presents a methodology for performance prediction of parallel algorithms and illustrates its use on a large scale computational chemistry application. The performance prediction uses a component time charac...
详细信息
This paper presents a methodology for performance prediction of parallel algorithms and illustrates its use on a large scale computational chemistry application. The performance prediction uses a component time characterization technique which splits up the sequential code into computational components and measures the time for each of them. The parallel algorithm is built from these components by adding communication routines. A “Processor Activity Graph” (PAG) providing a graphical representation of the parallel algorithm runtime behaviour is used for predicting the execution time. For a case study a Self Consistent Field (SCF) computation has been selected which forms the basis of many computational chemistry packages [4, 5]. The performance model of SCF computation has been built and the prediction have been compared with the results of measurements. The measurements have been provided on a mesh connected distributed memory parallelcomputer (128 T800 Parsytec SuperCluster). The prediction error is less than 10%. Performance optimisation of the application has been achieved by reducing the communication overhead and changing the data representation.
One of the key issues in designing new simulation models for parallel execution, or in the migration of existing models to parallel platforms, is the mapping of the application architecture to the parallel system arch...
详细信息
The recent availability of Intel Haswell processors marks the transition of hardware transactional memory from research toys to mainstream reality. DBX is an in-memory database that uses Intel's restricted transac...
详细信息
This paper presents the Secure Environment for Information systems in Medicine (SEISMED) project which is funded by the Commission of the European Commzlnities (CEC) under the Advance Informatics in Medicine (AIM) pro...
详细信息
Hardware transactional memory, which holds the promise to simplify and scale up multicore synchronization, has recently become available in main stream processors in the form of Intel's restricted transactional me...
详细信息
ISBN:
(纸本)9781450323161
Hardware transactional memory, which holds the promise to simplify and scale up multicore synchronization, has recently become available in main stream processors in the form of Intel's restricted transactional memory (RTM). Will RTM be a panacea for multicore scaling? This paper tries to shed some light on this question by studying the performance scalability of a concurrent skip list using competing synchronization techniques, including fine-grained locking, lock-free and RTM (using both Intel's RTM emulator and a real RTM machine). Our experience suggests that RTM indeed simplifies the implementation, however, a lot of care must be taken to get good performance. Specifically, to avoid excessive aborts due to RTM capacity miss or conflicts, programmers should move memory allocation/deallocation out of RTM region, tuning fallback functions, and use compiler optimization. Copyright 2013 ACM.
Classical Location-based Services (LBSs) automatically derive the current location of known persons in order to select, compile, or filter location-dependent information and present it to their users. Zone services wo...
详细信息
暂无评论