Mesh-connected processor array is a popular architecture used in parallel processing. Extensive studies have been conducted on reconfiguration algorithms for the processor arrays with faults, but few work is on parall...
详细信息
ISBN:
(纸本)9780769548791
Mesh-connected processor array is a popular architecture used in parallel processing. Extensive studies have been conducted on reconfiguration algorithms for the processor arrays with faults, but few work is on parallel algorithm to accelerate the reconfiguration. this paper presents a fast algorithm to reconfigure two dimensional mesh-connected processor arrays with faults. A traditional algorithm is successfully accelerated in the manner of multithread, without loss of harvest. the proposed algorithm reconfigures the processor array withthe mechanics of route distance in order to avoid the routing errors. Simulation results show that the proposed algorithm can accelerate the reconfiguration nearly by 15 times on a 64 x 64 array in comparison to the traditional algorithm cited in this paper.
Free-riding restricts the development of P2P systems. Existing incentive mechanisms take no consideration for the individual and social payoff. To address these problems, this paper presents a novel P2P incentive mech...
详细信息
ISBN:
(纸本)0769524052
Free-riding restricts the development of P2P systems. Existing incentive mechanisms take no consideration for the individual and social payoff. To address these problems, this paper presents a novel P2P incentive mechanism. Simulations show that the proposed mechanism can increase the social payoff of the whole P2P systems rapidly, and accelerate the cooperation between nodes.
Scientific workloads often require scalable computing resources. the traditional HPC paradigm provides large scale computing resources but requires IT specialists to buy and maintain large computer infrastructure in t...
详细信息
ISBN:
(纸本)9781467372879
Scientific workloads often require scalable computing resources. the traditional HPC paradigm provides large scale computing resources but requires IT specialists to buy and maintain large computer infrastructure in their organization. Withthe emergence of cloud computing, more and more scientists and engineers are moving their computing workloads from local clusters to public cloud. However, such a migration often requires experience both in understanding cloud architecture and cloud development skills, which can impede the efficiency and success of migration. this paper presents a cloud-based parallel and distributedcomputing platform to support scientific computing. Withthe Simulation Runner, scientists only need to submit their embarrassingly parallel scientific applications with appropriate arguments or parameters. there is no need to rebuild migrate cloud applications or purchase large computer infrastructures by themselves. the system also uses a file caching mechanism to improve performance and reduce the costs of data-intensive computing tasks. A 44X speedup was resulted from using 128computing instances compared with premise high performance desktop computers. A comparison study on the performance of file cache is given at the end of the paper.
this paper presents Tupleware, a cluster middleware which provides a distributed tuple space intended for use by computationally intensive scientific and numerical applications. It aims to add no extra burden to the a...
详细信息
ISBN:
(纸本)9780769534435
this paper presents Tupleware, a cluster middleware which provides a distributed tuple space intended for use by computationally intensive scientific and numerical applications. It aims to add no extra burden to the application programmer due to the distribution of the tuple space, and uses a decentralised approach and intelligent tuple search and retrieval to provide a scalable and efficient execution environment. Tupleware is evaluated using two applications: a modified quicksort and an ocean model, which demonstrates good scalability and a low system overhead.
Crawling web applications is important for indexing, accessibility and security assessment. Crawling traditional web applications is an old problem, as old as the web itself. Crawling Rich Internet applications (RIA) ...
详细信息
ISBN:
(纸本)9780769550947
Crawling web applications is important for indexing, accessibility and security assessment. Crawling traditional web applications is an old problem, as old as the web itself. Crawling Rich Internet applications (RIA) quickly and efficiently, however, is an open problem. technologies such as AJAX and partial Document Object Model (DOM) updates only makes the problem of crawling RIA more time consuming to the web crawler. To reduce the time to crawl a RIA, this paper presents a new distributed algorithm to crawl a RIA in parallel with multiple computers, called Dist-RIA Crawler. Dist-RIA Crawler uses the JavaScript (R) events in the DOM structure to partition the search space. this paper illustrates a prototype implementation of Dist-RIA Crawler and inspect empirical performance measurements.
Semantic annotation plays a central role in building Semantic Web, which in general could be completed by committing a web resource to a domain ontology. However, there exist many circumstances in which semantic annot...
详细信息
ISBN:
(纸本)0780378407
Semantic annotation plays a central role in building Semantic Web, which in general could be completed by committing a web resource to a domain ontology. However, there exist many circumstances in which semantic annotation needs more than one ontologies In this paper, we propose an approach based distributed Description Logics(DDL) with intention to deal withthese circumstances, in which ontologies form a distributed system, and no extra conditions and. changes are imposed to those component ontologies.
We compare the performance of the Treadmarks DSM system with two popular message passing systems (PVM and MPI). the comparison is done on 1, 2, 4, 8, 16, 24, and 32 nodes. applications are chosen to represent three cl...
详细信息
ISBN:
(纸本)0780378407
We compare the performance of the Treadmarks DSM system with two popular message passing systems (PVM and MPI). the comparison is done on 1, 2, 4, 8, 16, 24, and 32 nodes. applications are chosen to represent three classes of problems: loosely synchronous, embarrassingly parallel, and synchronous. the results show DSM has similar performance to message passing for the embarrassingly parallel class. However, the performance of DSM is lower than PVM and MPI for the synchronous and loosely synchronous classes of problems. An analysis of the reasons is presented.
Role-based access control (RBAC) models have generated a great interest in the security community as a powerful and generalized approach to security management. One of important aspects in RBAC is constraints that con...
详细信息
ISBN:
(纸本)0769524052
Role-based access control (RBAC) models have generated a great interest in the security community as a powerful and generalized approach to security management. One of important aspects in RBAC is constraints that constrain what components in RBAC are allowed to do. there are lots of research have been achieved to specify constraints for secure system developers. However more work is need urgently to met requirements for interoperability of machine and people understandable constraints specification in open and distributed environment. In this paper we propose another approach to specify constraints using Semantic Web technologies. the Web Ontology Language (OWL) specification of basic RBAC components and constraints are described in detail.
parallel and distributed Knowledge Discovery (PDKD) is emerging as a possible killer application for clusters and grids of computers. the need to process large volumes of data and the availability of parallel data min...
详细信息
ISBN:
(纸本)3540675531
parallel and distributed Knowledge Discovery (PDKD) is emerging as a possible killer application for clusters and grids of computers. the need to process large volumes of data and the availability of parallel data mining algorithms, makes it possible to exploit the increasing computational power of clusters at low costs. On the other side, grid computing is an emerging "standard" to develop and deploy distributed, high performance applications over geographic networks, in different domains, and in particular for data intensive applications. this paper proposes an approach to integrate cluster of computers within a grid infrastructure to use them, enriched by specific data mining services, as the deployment platform for high performance distributed data mining and knowledge discovery.
Grid computing promises to bring the resources to satisfy the increasing requirements of scientific applications. As grids result from several organizations that pool their computational resources, resource availabili...
详细信息
ISBN:
(纸本)9781424415595
Grid computing promises to bring the resources to satisfy the increasing requirements of scientific applications. As grids result from several organizations that pool their computational resources, resource availability varies frequently inside grids. Relying on autonomous dynamic adaptability and managing dynamic collections of resources, technologies have been proposed in order to handle those variations at the level of applications. However, despite applications have evolved in order to fit better dynamic grid environments, grid resource managers still restrict to rigid jobs, thus inhibiting application adaptability and malleability. this paper discusses 3 options to overcome that restriction. Malleable job management can be built on top of existing unmodified infrastructures. It can also be implemented as a modification of the infrastructure. At last, we propose an intermediate approach that fosters the cooperation between the infrastructure and its users. Requiring an initial modification of the infrastructure, the latter design combines cost efficiency with possibility to further extend the job model without any additional modification of the infrastructure. In the discussion, qualitative arguments are supported by some experimental results.
暂无评论