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.
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...
详细信息
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.
Software Architecture (SA) is emerging as an important research area in software engineering and forms the backbone for building successful software-intensive systems. Based on practical requirements, especially the r...
详细信息
Grid and service computingtechnologies have been explored by enterprises to promote integration, sharing, and collaboration. However, quick response to busincss environment changes is still a challenging issue. For e...
详细信息
ISBN:
(纸本)0769524052
Grid and service computingtechnologies have been explored by enterprises to promote integration, sharing, and collaboration. However, quick response to busincss environment changes is still a challenging issue. For end users, developing, customizing, and re-engineenng applications remain a difficult and time-consuming g task. Users still need to deal with excessive low-level details of platform-specific APIs. We present a high-level programming model together with a descriptive glueing language called GSML, to facilitate end-user programming. In this approach, applications could be visually composed from well-defined software components called 'funnels" in an event-driven fashion. Application examples have shown that, by raising the level of abstraction as well as simplifying the programming model, GSML could empower end users to build grid applications on demand with improved productivity.
Remote-sensing image processing applications demand large-scale, collaborative processing and storage capabilities. Computational grid can provide abundant powerful computational resources with sharing and cooperation...
详细信息
ISBN:
(纸本)0769524052
Remote-sensing image processing applications demand large-scale, collaborative processing and storage capabilities. Computational grid can provide abundant powerful computational resources with sharing and cooperation in grid environment. This paper gives an introduction to a collaborative processing mechanism based on workflow technology implemented in ImageGrid The main idea is to encapsulate all parallel algorithms of remote-sensing image processing into grid services and recombine them with grid workflow to satisfy more and more complex remote-sensing, image processing applications. In particular, we describe the architecture of the workflow-based grid system and the processing flow. We also give out the algorithm classification and an example of remote-sensing image processing grid application.
MANET: are composed of mobile nodes without any infrosiructure and nodes cooperate to set up routes for network communications. Because of these characters, MANETs operate in open medium, so they are particularly vuln...
详细信息
ISBN:
(纸本)0769524052
MANET: are composed of mobile nodes without any infrosiructure and nodes cooperate to set up routes for network communications. Because of these characters, MANETs operate in open medium, so they are particularly vulnerable to intrusions. In this paper, we present an efficient intrusion detection system called MAPIDS (Mobile Agent-based Peer-to-peer Intrusion Detection System). On detecting a suspicious activity, MAPIDS initiates a voting approach to make a collective decision and take further action. In contrast to other intrusion detection system based on collective decision, MAPIDS saves more bandwidth and energy and it is immune to sparse nodes problem.
LEACH protocol for wireless sensor network has attracted intensive attention because of its energy efficient, Simplicity and load balancing. LEACH is a cluster-based protocol, and the numbers of cluster heads and clus...
详细信息
ISBN:
(纸本)0769524052
LEACH protocol for wireless sensor network has attracted intensive attention because of its energy efficient, Simplicity and load balancing. LEACH is a cluster-based protocol, and the numbers of cluster heads and cluster members generated by LEACH are important parameters for achieving better performance. This paper presents a simulation analysis of the statistical characteristics of the numbers of cluster heads and cluster members for LEACH protocol by means of Monte Carlo method. The simulation results have been compared with the analytical results, and coincidence between them has been observed The results indicate that the numbers of cluster head,;and cluster members vary in a not narrow ranged, and the probability that there is only one cluster head or there is no cluster head is high when the desired value of cluster heads is small.
暂无评论