In recent years, network bandwidth and quality has been drastically improved in a speed even much faster than the enhancement of computer performance. Various communication and computing tasks in the fields can be int...
详细信息
ISBN:
(纸本)9780769527369
In recent years, network bandwidth and quality has been drastically improved in a speed even much faster than the enhancement of computer performance. Various communication and computing tasks in the fields can be integrated and applied in a distributed system in nowadays. However, those resources are heterogeneous and dynamic in distributed systems connecting a broad range of resources. this study proposed a hybrid load balancing policy to maintain performance and stability of distributed system.
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.
A fault-tolerant conference key distribution scheme based on mechanism of identity-based cryptography and (t,n) threshold secret sharing is proposed in this paper. this scheme is much different to traditional ones, it...
详细信息
ISBN:
(纸本)9780769527369
A fault-tolerant conference key distribution scheme based on mechanism of identity-based cryptography and (t,n) threshold secret sharing is proposed in this paper. this scheme is much different to traditional ones, its secret shadows are not brought from the sponsor of conference, but from each server's private key signature. By getting together these n secret shadows, the sponsor can construct polynomial. Any of conferees invited by the sponsor can request these secret shadows from t of these n servers, and then restitute conference key by them. In all courses of conference key distribution and reconstruction, every member's identity can be easily validated, so it can be prevented from all kinds of cheat.
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 usages of XML-RPC and the effectiveness in a mobile agent framework named Maglog which is implemented in a Java environment. XML-RPC is used for the following two purposes in Maglog. First, i...
详细信息
ISBN:
(纸本)9780889866386
In this paper, we present usages of XML-RPC and the effectiveness in a mobile agent framework named Maglog which is implemented in a Java environment. XML-RPC is used for the following two purposes in Maglog. First, it is a transport mechanism that an agent migrates from one computer to another one. Second, it is an interface which is accessible from applications, written in any other language, which support for XML-RPC. In order to realize an agent migration mechanism, custom serialization mechanism is implemented to customize Java's built-in serialization mechanism. In custom serialization mechanism, objects which represent for an agent are encoded as an XML document. Encoded objects are transferred using XMLRPC. For deserialization, a dynamic class loader is implemented. If no custom serialization is used, an object cannot be deserialized on a remote host, because the class description of the object may not be in the host. As an example of an interface which is accessible from applications, we show a user interface program of a distributed e-Leaming system which we have developed.
Pervasive games are an emerging form of distributed real-time application that extend computer gaming out into the real world. From the city streets to the remote wilderness, players with mobile computing devices move...
详细信息
ISBN:
(纸本)0769526977
Pervasive games are an emerging form of distributed real-time application that extend computer gaming out into the real world. From the city streets to the remote wilderness, players with mobile computing devices move through the world, sensors capture information about their current context, including their location, and this is used to deliver a gaming experience that adapts to where they are, what they are doing, and even how they are feeling. Players becomes unchained from their consoles and experience a game that is interwoven withthereal world and that is potentially available at any place and any time. Pervasive Games raise significant new challenges for the designers of distributed real-time applications, many of which arise from the distinctive characteristics of the underlying fabric of sensing and wireless communications technologiesthat constitute the ubiquitous computing infrastructure. Drawing on a series of recent collaborations with artists to develop, tour and study pervasive games, I will articulate these distinctive design challenges, exploring issues such as support for location-based play, revealing the nature of the ubiquitous infrastructure to designers, and adapting long-term persistent games with patterns of daily life.
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.
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.
暂无评论