Increasing the number of instructions executing in parallel has helped improve processor performance, but the technique is limited. Executing code on parallel threads and processors has fewer limitations, but most com...
详细信息
ISBN:
(纸本)0769524052
Increasing the number of instructions executing in parallel has helped improve processor performance, but the technique is limited. Executing code on parallel threads and processors has fewer limitations, but most computer programs tend to be serial in nature. This paper presents a compiler optimisation that at run-time parallelises code inside a JVM and thereby increases the number of threads. We show Spec JVM benchmark results for this optimisation. The performance on a current desktop processor is slower than without parallel threads, caused by thread creation costs, but with these costs removed the performance is better than the serial code. We measure the threading costs and discuss how a future computer architecture will enable this optimisation to be feasible in exploiting thread instead of instruction and/or vector parallelism.
For its simplicity, reliability and maturity, NFS is widely-used in clusters. However, due to its high overheads and implementation limitations, the standard NFS cannot fully exert the potential abilities provided by ...
详细信息
ISBN:
(纸本)0769524052
For its simplicity, reliability and maturity, NFS is widely-used in clusters. However, due to its high overheads and implementation limitations, the standard NFS cannot fully exert the potential abilities provided by multiple network channels and multiple SCSI channely on the server. In this paper, we present a new efficient way to high performance NFS implementation for cluster applications. By adding mechanisms to make good use of NFS server's multiple communication channels and multiple I/O channels, CluserNFS can potentially provide better I/O performance khan standard NFS, as illustrated by our simulation experiment results.
A connected dominating set of a graph G is a set of nodes of G such that every node in G is either in the set or is adjacent to some node in the set, and the graph induced by the elements of the set is connected Conne...
详细信息
ISBN:
(纸本)0769524052
A connected dominating set of a graph G is a set of nodes of G such that every node in G is either in the set or is adjacent to some node in the set, and the graph induced by the elements of the set is connected Connected dominating sets have major applications in routing in wireless ad-hoc networks. In this paper, we present a distributed self-estabilizing algorithm for finding a connected dominating set of a graph. Starting from an arbitrary initial state, the algorithm finds a connected dominating set in 002) time, where N is the number of nodes. We also show detailed simulation results to indicate that in practice, the algorithm finas small-sized connected dominating sets in a short time.
parallel programs based on the Divide & Conquer paradigm could be successfully defined in a simple way using powerlists. These parallel recursive data structures and their algebraic theories offer both a methodolo...
详细信息
Identifying partially duplicated text segments among documents is an important research problem with applications in plagiarism detection and near-duplicate web page detection. We investigate the problem of local simi...
详细信息
In this paper, we propose a novel approach which uses full processor utilization to compute a particular class of dynamic programming problems parallelly. This class includes algorithms such as Longest Common Subseque...
详细信息
As grid software and grid applications grow in size and complexity, memory usage experiment and analysis have become more and more essential. In this paper, we investigate an Anti-TestCase-based approach to analyze th...
详细信息
ISBN:
(纸本)9780769534435
As grid software and grid applications grow in size and complexity, memory usage experiment and analysis have become more and more essential. In this paper, we investigate an Anti-TestCase-based approach to analyze the memory usage of GOS core software, and present a set of Anti-TestCases, which describe predefined memory problems of GOS core. This approach is applied with a set of automated test tools in controlled experiments including basic memory requirements, memory errors and memory usage of GOS core. With the experiment and analysis, we find several memory usage results of GOS core and they are valuable for other systems based on JVM, Tomcat and Axis. We also give some JVM memory configuration suggestions for better performance in the production server.
computing reversal distance of two signed permutations has gained increasing attention over the last decade with the study of genome rearrangements in computational molecular biology. In this paper, we present a paral...
详细信息
Data can be store as structured, semi-structured or unstructured formats in various distributed environments. Extraction of data from multiple data sources or data warehouse and convert to a proper order is quite time...
详细信息
Future Personal Communication Service (PCS) networks adopt smaller cells to accommodate continuously growing population of subscribers, which results in frequent location update and consequently higher signaling cost....
详细信息
ISBN:
(纸本)0769524052
Future Personal Communication Service (PCS) networks adopt smaller cells to accommodate continuously growing population of subscribers, which results in frequent location update and consequently higher signaling cost. In this paper, a ring removal movement-based location update scheme with a selective paging is proposed This location update scheme reduces the location updates by removing the ring formed in terminal's movement path. Numerical results show that the proposed movement-based update scheme provides a better performance than the improved movement-based registration (IMBR) scheme [1] when the terminal's callto-mobility (CMR) ratio [2] is small.
暂无评论