In this paper we consider the problem of exact string matching algorithm based on a two-dimensional array. This has applications such as string databases, cellular automata and computational biology. The main use of t...
详细信息
We describe a tool that implements a set of services to manipulate and store data from a radar network in a transparent way to end users. A major requirement of this system is data availability and reliability. Conseq...
详细信息
ISBN:
(纸本)9780769527369
We describe a tool that implements a set of services to manipulate and store data from a radar network in a transparent way to end users. A major requirement of this system is data availability and reliability. Consequently, we have implemented a redundancy schema based on the Information Dispersal Algorithm (IDA). Preliminary results show that the IDA based replication provides better reliability and less storage spending than traditional replication.
As one of the killing applications in NGI, peer-to-peer networks (P2P for short) have rapidly developed in recent years. We survey and catalog the current hot research aspects in P2P networks, compare and review most ...
详细信息
ISBN:
(纸本)9780769527369
As one of the killing applications in NGI, peer-to-peer networks (P2P for short) have rapidly developed in recent years. We survey and catalog the current hot research aspects in P2P networks, compare and review most of the research work in P2P networks, and summarize the research means and their problems.
The problem is that the parallel scheduling strategies are minimally supported in distributed environments. The well-known Coffman-Graham algorithm is highly effective but applied only for the sample case when all tas...
详细信息
ISBN:
(纸本)9780769527369
The problem is that the parallel scheduling strategies are minimally supported in distributed environments. The well-known Coffman-Graham algorithm is highly effective but applied only for the sample case when all tasks have the same execution time and not applied for the distributed systems. In this paper, an expanding task graph and an expanding Coffman-Graham algorithm, which orients to the distributed systems and can be applied for the case when the tasks have the different execution time, are proposed Like the well-known Coffman-Graham algorithm, the ECG algorithm is proved to be an efficient scheduling algorithm for the distributed systems, through presenting and deducting one theorem and two corollaries.
In this paper we present a new distributed Group Mutual Exclusion(DGME) based on Clients/Servers model, and uses a dynamic data structures. Several processes (Clients) can access simultaneously to a same opened sessio...
详细信息
ISBN:
(纸本)9780769527369
In this paper we present a new distributed Group Mutual Exclusion(DGME) based on Clients/Servers model, and uses a dynamic data structures. Several processes (Clients) can access simultaneously to a same opened session (Server). The algorithm ensures that, at any time, at most one session is opened, and any requested Session will be opened in a finite time. The number of messages is between 0 and m, where m is the number of session in the network. In the average case, O(Log(m)) messages are necessary to open a session. The maximum concurrency is n, where n is the number of processes in the network.
One important way of solving 110 bottleneck is to develop parallel file system. Research showed that the strided file access pattern in scientific applications combined with current file system methods to perform thes...
详细信息
ISBN:
(纸本)9780769527369
One important way of solving 110 bottleneck is to develop parallel file system. Research showed that the strided file access pattern in scientific applications combined with current file system methods to perform these accesses lead to unacceptable performance for large data access. To enhance performance of discontiguous data access, we have created a new high performance 110 method: the user-defined file view and combining 110 requests (UFCR). We have implemented our ideas on WPFS. Experimentation results showed that our method can substantially enhance the performance of scientific applications.
Multi-core processors can easily provide benefits for multithreaded workloads, but many applications written for uniprocessors cannot automatically benefit from chip multiprocessors (CMP) designs. This paper presents ...
详细信息
ISBN:
(纸本)9780769527369
Multi-core processors can easily provide benefits for multithreaded workloads, but many applications written for uniprocessors cannot automatically benefit from chip multiprocessors (CMP) designs. This paper presents a reverse compilation framework, which translates existing binary code without source code to the Static Single Assignment (SSA) form, and then the internal SSA form is applied by the compilation phase to generate the Speculative parallel Threading (SPT) code. A profiler is applied to optimize the code dynamically during execution. The evaluation results show that these existing binary codes without source codes execute on CMP with performance improved, due to taking advantage of the speculative parallel threading support provided by the processor.
The knapsack problem is a famous NP-complete problem. It is very important in the research on cryptosystem and number theory. After its proposed parallel algorithms are analyzed deeply, a new parallel algorithm by sam...
详细信息
ISBN:
(纸本)9780769527369
The knapsack problem is a famous NP-complete problem. It is very important in the research on cryptosystem and number theory. After its proposed parallel algorithms are analyzed deeply, a new parallel algorithm by sampling is proposed based on MIMD supercomputers in the paper . Then performance analysis and comparisons are illuminated Finally the experimental results of the knapsack instances randomly generated on IBM P690 supercomputer are given. The results show: the parallel efficiency can be over 60% when solving the larger scale knapsack instances (n >= 40). Thus it is proved that the proposed parallel algorithm for the knapsack problem is feasible and efficient on MIMD scalable supercomputers.
The secure interaction between two or more administrative domains is a major concern. IRBAC2000 is a model that quickly establishes a flexible policy for dynamic role translation from foreign domains to local. A-IRBAC...
详细信息
ISBN:
(纸本)9780769527369
The secure interaction between two or more administrative domains is a major concern. IRBAC2000 is a model that quickly establishes a flexible policy for dynamic role translation from foreign domains to local. A-IRBAC2000 mode utilizes RBAC to manage dynamic role translation between foreign and local domains. We will see that these mechanisms have significant shortcomings. We propose an improved Administrative Usage Control model named A UCON to overcome the weakness of previous models. A UCONprovides administrates user-role assignment for local and foreign domain with unified method. It provides flexible enough mechanism to distinguish users of foreign and local domain and can enforce more strict control for foreign user. While retaining the advantage of traditional RBAC model, AUCON model is being implemented in experiment system.
This paper presents an overview of our ongoing project KAP, which aims to build a message-passing parallelizing compiler for distributed-memory machines. In this paper an improved automatic code generation algorithm i...
详细信息
ISBN:
(纸本)9780769527369
This paper presents an overview of our ongoing project KAP, which aims to build a message-passing parallelizing compiler for distributed-memory machines. In this paper an improved automatic code generation algorithm is discussed Our algorithm uses the data and computation decomposition, and the reading and writing access functions to create the communication code. We can not only solve the problems which the conventional algorithm can do but also can solve another kind of problem. In such cases: there is no data dependence and the read access is not aligned in the loop nest, or the exact data-flow analysis is not given because of the limitation of the algorithm of LWT the conventional algorithm can not create communication code correctly while our improved algorithm can resolve this problem. Experiments prove that the novel algorithm can achieve satisfactory effect.
暂无评论