This paper presents a ubiquitous computing technology called Virtual Personal computing Environment (VPCE), which enables users to access their personalized computing environments anywhere using any available terminal...
详细信息
ISBN:
(纸本)0769524052
This paper presents a ubiquitous computing technology called Virtual Personal computing Environment (VPCE), which enables users to access their personalized computing environments anywhere using any available terminals. The key feature of the VPCE is that it can be constructed dynamically by reassembling application services and resources distributed over networks, which is different from the traditional desktop personal computing environment that is tied to an individual computer to execute. In VPCE, users work with a heterogeneous collection of application services, and data access by application as well as the application accessed by users are distributed over networks, while the applications and data distribution is transparent to the users.
Frequent itemsets mining plays an essential role in data mining. In this paper, a new algorithm PFP-growth (parallel FP-growth), which is based on the improved FP-growth, is proposed for parallel frequent itemset mini...
详细信息
Frequent itemsets mining plays an essential role in data mining. In this paper, a new algorithm PFP-growth (parallel FP-growth), which is based on the improved FP-growth, is proposed for parallel frequent itemset mining. The new algorithm distributes the task fairly among the parallel processors. We devise partitioning strategies at different stages of the mining process to achieve balance between processors and adopt some data structure to reduce the information transportation between processors. The experiments on national high performance parallel computer show that the PFP-growth is an efficient parallel algorithm for mining frequent itemset.
Formal specification are indispensable for computer-aided verification and testing of communication protocols. However, a large number of the practical protocols have only informal specifications, mostly in English. T...
详细信息
ISBN:
(纸本)9780769530499
Formal specification are indispensable for computer-aided verification and testing of communication protocols. However, a large number of the practical protocols have only informal specifications, mostly in English. There are no general procedures to derive formal specifications from such informal specification. In this paper we model Session Initiation Protocol (SIP) by parameterized extended finite state machines. We also provide insights gained in the derivation of the formal specification.
We consider task assignment problem in distributed systems. Tasks are chosen by independent processing units (IPUs) which have only the knowledge of: 1, their own situations;and 2, the system's simple feedbacks. W...
详细信息
ISBN:
(纸本)0780378407
We consider task assignment problem in distributed systems. Tasks are chosen by independent processing units (IPUs) which have only the knowledge of: 1, their own situations;and 2, the system's simple feedbacks. We propose a dynamic algorithm with which IPUs can adjust their tasks in an adaptive fashion and in turn help the system getting optimal. This algorithm overcomes an important limitation of previous works, that is, the max reward probability r*≥0.5, and can get much better performance. Algorithm correctness is analyzed by Markov chains. Experiments and comparisons are presented. Reward/penalty dependency, an issue has not been addressed in previous works, is also analyzed. Moreover, this algorithm can also be used to solve the general assignment problem.
Locomotive-track coupling dynamical simulation has made good achievements. However, a problem, how to improve the simulating speed when visualization and dynamical computation are considered at the same time, is still...
详细信息
Locomotive-track coupling dynamical simulation has made good achievements. However, a problem, how to improve the simulating speed when visualization and dynamical computation are considered at the same time, is still not overcome. Here, based on existing success, we present a distributed COM technology, which is used to change the status of the present slow speed simulation. In this paper, at first, the locomotive-track dynamics system is modeled, a resolving formula is discussed, and visualization of the system is given, then the characteristic of the main integration resolving algorithm is analyzed, which is the reason of actuating the DCOM method. Secondly, we divide these resolving equations into several separated module, which is distributed in different resolving machine as a COM, and construct a distributedparallelcomputing environment, this method effectively reduces the computing load of the main computer and the computing speed is improved, which is the basement of real-time simulation such as virtual dynamical test of locomotive.
Aggressive research on terabit per second networks has led to dramatic improvements in network transmission speeds. One result of these improvements has been to put pressure on router technology to keep pace. There is...
详细信息
ISBN:
(纸本)0780378407
Aggressive research on terabit per second networks has led to dramatic improvements in network transmission speeds. One result of these improvements has been to put pressure on router technology to keep pace. There is more urgent need to research and study terabit (1012bit) router. Traditional routes using shared-bus and central processing unit cannot do it. So how to support the terabit per second data speed is a great challenge for traditional router architecture. In this article, the recent years' new achievements in terabit routers are summarized, the new functions of terabit routers are introduced, and the distributed architecture of new generation super high speed terabit router are analyzed, which put emphasis on the multi-dimensional switching architecture. At last, The prospect of terabit router plays the final role for the paper.
A distributed simulation environment of fluid flow as a study case is firstly brought forward and then a simulation-based universal distributed solving process that is universal in many problem domains is put forward....
详细信息
ISBN:
(纸本)0769524052
A distributed simulation environment of fluid flow as a study case is firstly brought forward and then a simulation-based universal distributed solving process that is universal in many problem domains is put forward. Based on the process, the agent-oriented early requirement analysis of the study case has been carried out basically, and the feasibility and rationality of agent-oriented method and difficulty of object-oriented method for modeling complicated intentional feature have also been discussed.
Despite the recent advances in access control approaches applicable to grid computing, there remain issues that impede the development of effective access control for grid applications. Amongst them are the lack of co...
详细信息
ISBN:
(纸本)0769524052
Despite the recent advances in access control approaches applicable to grid computing, there remain issues that impede the development of effective access control for grid applications. Amongst them are the lack of context-based models for access control, and reliance on identity or capability-based access control schemes. In this paper, we propose RCBAC model which extends the RBAC with context constraints. The RCBAC mechanisms dynamically grant and adapt permissions to users based on a set of contextual information collected from the grid environments, while retaining the advantages of RBAC model.
While content-aware distribution policies getting more popular in cluster-based web systems, they make the dispatching node a bottleneck. To achieve scalable server performance, we present a completely distributed arc...
详细信息
ISBN:
(纸本)0780378407
While content-aware distribution policies getting more popular in cluster-based web systems, they make the dispatching node a bottleneck. To achieve scalable server performance, we present a completely distributed architecture named CODA. In CODA, we employ both layer-4 and layer-7 web switching techniques. While the front-end layer-4 switch distributes the client requests among the server nodes using some simple dispatching algorithm, the server nodes may forward the incoming request to another server node according to some content-aware policy. By eliminating the centralized dispatcher, CODA affords better scalability and fault tolerance. Moreover, we have implemented this architecture on the basis of Linux IP stack and evaluated its performance with trace-based workloads. Our performance results show it can achieve favorable throughput compared to existing architectures.
Genetic Algorithm has emerged as a successful tool for optimization problems. Earlier, we proposed a task allocation model to maximize the reliability of distributedcomputing System(DCS) using genetic algorithm. Our ...
详细信息
Genetic Algorithm has emerged as a successful tool for optimization problems. Earlier, we proposed a task allocation model to maximize the reliability of distributedcomputing System(DCS) using genetic algorithm. Our objective, in this work, is to use the same simple genetic algorithm to minimize the turnaround time of the task given to the DCS for execution and then to compare the resultant allocation with the allocation of maximal reliablity as obtained in [2]. Comparisons of both the algorithms are made by illustrated examples and appropriate comments.
暂无评论