The ultimate goal in communication system design is to control and optimize the system performance under resource constraints. As the communication paradigm evolves from the conventional desktop computing, wired, and ...
详细信息
Early circuit performance estimation and easy-to-apply methods for minimum-delay gate sizing are needed, in order to enhance circuit's performance and to increase designers' productivity. In this paper, we pre...
详细信息
Reliability is a vital issue in the deployment of mobile agent systems (MASs), which are meant to provide a distributed computing infrastructure for supporting applications in which components can move freely in heter...
详细信息
Reliability is a vital issue in the deployment of mobile agent systems (MASs), which are meant to provide a distributed computing infrastructure for supporting applications in which components can move freely in heterogeneous environments. Design and implementation of mechanisms to relocate computations requires a careful consideration of fault tolerance, which is an essential component of reliability, especially on open networks like the Internet. Mobile agent (MA) fault tolerance requires mechanisms for making agents persistent, for reactivating them and their state activity after a failure, and for reliably transporting them between various agent hosts (AHs). In this paper, we propose several mechanisms to take care of the above problems. These are meant for tolerating host, communication and agent failures on a network and recovering agents and AHs from them. They are based on a novel three-layered approach to fault-tolerance, which avoids the single point failures of centralized systems, while still maintaining the scalability of distributed systems. The proposed techniques have been implemented and tested on PMADE and the results of a comparison of these techniques, with some existing ones, is also reported.
Open Hypermedia have come up with several systems, which can provide services to software developers. This paper argues that usability is a critical attribute that should be taken into consideration during the develop...
详细信息
In this paper, we present the design principles for virtual spaces and two different tools as solutions for supporting e-collaboration and multi-user communication in web-based learning communities. The first solution...
详细信息
Unicast mechanisms for the adaptive transmission of multimedia data can be used for the transmission of multimedia data over heterogeneous networks, like the Internet with the use of one unicast stream for each receiv...
详细信息
People and animals fuse auditory and visual information to obtain robust perception. A particular benefit of such cross-modal analysis is the ability to localize visual events associated with sound sources. We aim to ...
详细信息
Managing location information of mobile agents (MAs) is an important issue in MA based mobile computing systems. There is a tradeoff between location update effort (when an agent moves) and agent finding effort. In th...
详细信息
Managing location information of mobile agents (MAs) is an important issue in MA based mobile computing systems. There is a tradeoff between location update effort (when an agent moves) and agent finding effort. In this paper we present a dynamic location management strategy that has the following features: (i) all location servers (LSs) need not maintain location information of every MA, (ii) a coterie based approach is adopted for location update and find, (iii) every agent move does not result in location updates, (iv) location updates are done at a subset of LSs, (v) a subset of LSs are queried when a MA is to be located, (vi) the set of LSs, corresponding to a MA, for location update and find operations is dynamic, (vii) the dynamic nature of these sets helps alleviate situations of heavy burden on some LSs, when a large number of MAs are concentrated in a small geographical area. Thus, location management is done efficiently, and responsibility is shared fairly among LSs.
Two architectures for parallel-prefix modulo 2n - 1 adders are presented in this paper. For large wordlengths we introduce the sparse modulo 2n - 1 adders that achieve significant reduction of the wiring complexity wi...
详细信息
ISBN:
(纸本)9789972611001
Two architectures for parallel-prefix modulo 2n - 1 adders are presented in this paper. For large wordlengths we introduce the sparse modulo 2n - 1 adders that achieve significant reduction of the wiring complexity without imposing any delay penalty. Then, the Ling-carry formulation of modulo 2n - 1 addition is presented. Ling modulo adders save one logic level of implementation and provide high-speed solutions for smaller adder widths, where wiring complexity is small. The performance of the proposed adders has been validated with static CMOS implementations. In all examined cases, the proposed designs achieve significant savings in both area and delay compared to previously published architectures.
In this paper a quantum computer based on the recombination processes happening in semiconductor devices is presented. A "data element" and a "computational element" are derived based on Schokley-R...
暂无评论