In this paper, we present a multi-version transaction model, which exploits versions to increase availability in a mobile database environment. Each transaction in our model is either in start, committed or terminated...
详细信息
This work utilizes the pattern recognition (PR) technologies by Client-Server network structure into a web-based recognizing system. The system uses a recurrent neural network (RNN) with associative memory to perform ...
详细信息
Model simulations on the order of decades are required to fully evaluate the effects of system alterations on the estuarine/coastal environment since these environments and their components (e.g., bottom sediments, se...
详细信息
Labscape, a ubiquitous computing environment for cell biologists, was implemented twice: once using only standard tools for distributed systems (TCP sockets and shared file systems) and once using ***, a runtime syste...
详细信息
The limitations of current Internet-based learning systems (e.g., their inability to deal with diverse learners and requirements and the high cost of developing a new learning system) have lead to educational middlewa...
详细信息
In this paper, we present a new discrete cosine transform (DCT) processor architecture using computation sharing multiplication (CSHM). We introduce a computation sharing multiplier based DCT architecture to achieve i...
详细信息
In this paper, we present a new discrete cosine transform (DCT) processor architecture using computation sharing multiplication (CSHM). We introduce a computation sharing multiplier based DCT architecture to achieve image quality and hardware complexity trade-off and analyze the performance. Comparison of the performance, area and power consumption with a DA (distributed arithmetic) based DCT architecture is performed. The result shows that the proposed architecture improves power consumption by 14% and area by 41% with acceptable image quality degradation.
The paper focuses on the loop-level parallelism of bytecode on a distributed shared memory (DSM) system, which is built on a cluster of multiprocessors. We define a new attribute called 'Loop Attribute' to rec...
详细信息
This paper proposes a new minimum spanning tree (Mst) based distributed QoS-based multicast routing algorithm which is capable of constructing a delay constrained multicast tree when node failures occur during the tre...
ISBN:
(纸本)0769513816
This paper proposes a new minimum spanning tree (Mst) based distributed QoS-based multicast routing algorithm which is capable of constructing a delay constrained multicast tree when node failures occur during the tree construction period and recovering from any node failure in a multicast tree during the on-going multicast session without interrupting the running traffic on the unaffected portion of the tree. The proposed algorithm performs the failure recovery efficiently, which gives better performance in terms of the number of exchanged messages and the convergence time than the existing Mst based distributed multicast routing algorithms.
Testing is a difficult and time-consuming part of the software development cycle. This is because an error may happen in an unexpected way at an unexpected spot. Testing and debugging parallel and distributed software...
详细信息
ISBN:
(纸本)0769511651
Testing is a difficult and time-consuming part of the software development cycle. This is because an error may happen in an unexpected way at an unexpected spot. Testing and debugging parallel and distributed software are much more difficult than testing and debugging sequential software. This is due to the fact that errors are usually reproducible in sequential programs while they may not be reproducible in parallel and distributed programs. In addition, parallel and distributed programs introduce new types of errors and anomalies, race conditions and deadlocks, that do not exist in sequential software. In this paper I present a survey and a taxonomy of existing approaches for detecting race conditions and deadlocks in parallel and distributed programs. These approaches can be classified into two main classes. static analysis techniques, and dynamic analysis techniques. I have subdivided further the static analysis techniques into three different subgroups: The concurrency analysis methods, The data-flow analysis methods, and the formal proof methods. A brief discussion and highlighting of main problems in most known approaches is given. The paper is concluded with tables summarizing the comparison between the surveyed approaches.
One of the key design issues for the next generation IP routers is the IP Lookup mechanism. IP lookup is an important action in router that is to find the next hop of each incoming packet with a longest-prefix-match a...
ISBN:
(纸本)0769513816
One of the key design issues for the next generation IP routers is the IP Lookup mechanism. IP lookup is an important action in router that is to find the next hop of each incoming packet with a longest-prefix-match address in the routing table. In this paper, we propose an IP lookup mechanism with the number of memory access for an IP lookup being one in the best case and being four in the worst case. The forwarding table needed by our mechanism is small enough to fit in the SRAM. For example, a large routing table with 40000 routing entries can be compacted to a forwarding table of 260KBytes in our scheme.
暂无评论