Most of the popular data mining algorithms are designed to work for centralized data and they often do not pay attention to the resource constraints of distributed and mobile environments. In support of the third gene...
详细信息
ISBN:
(纸本)0780378407
Most of the popular data mining algorithms are designed to work for centralized data and they often do not pay attention to the resource constraints of distributed and mobile environments. In support of the third generation of data mining systems on distributed and massive data, we proposed an efficient distributed and mobile algorithm for global association rule mining, which does not need to ship all of local data to one site thereby not causing excessive network communication cost. The algorithm is implemented in PL/SQL for coupling association rule mining with relational database system, well-used in organizations and communities. The experiments show that this algorithm implemented in PL/SQL beats classic Apriori algorithm for large problem sizes, by factors ranging from 2 to more than 20, and this gap grows wider when the volume of transactions further grows up.
Given n malleable and non-preemptable parallel jobs that arrive for execution at time 0, we examine and compare two job scheduling strategies that allocate m identical processors among the n competing jobs. In all cas...
详细信息
ISBN:
(纸本)0780378407
Given n malleable and non-preemptable parallel jobs that arrive for execution at time 0, we examine and compare two job scheduling strategies that allocate m identical processors among the n competing jobs. In all cases, n less than or equal to m. The first strategy is based on the heuristic paradigm of equipartitioning, and the second is based on the notion of marginal analysis. Equipartitioning uses no a priori information when processor allocations are made to parallel jobs. Marginal analysis, on the other hand, assumes full a priori information in order to maximize processor utility. In this paper, we compare both strategies with respect to average time-to-completion (system performance) and overall time-to-completion (system efficiency). Using a simple job model characterized by sequential time-to-completion and degree of parallelism, it is demonstrated via simulation that in most cases, the uninformed strategy of equipartitioning outperforms marginal analysis with respect to system performance and without a commensurate degradation in system efficiency.
This paper presents Tupleware, a cluster middleware which provides a distributed tuple space intended for use by computationally intensive scientific and numerical applications. It aims to add no extra burden to the a...
详细信息
ISBN:
(纸本)9780769534435
This paper presents Tupleware, a cluster middleware which provides a distributed tuple space intended for use by computationally intensive scientific and numerical applications. It aims to add no extra burden to the application programmer due to the distribution of the tuple space, and uses a decentralised approach and intelligent tuple search and retrieval to provide a scalable and efficient execution environment. Tupleware is evaluated using two applications: a modified quicksort and an ocean model, which demonstrates good scalability and a low system overhead.
This paper presents a run-time scheduling policy to map tasks to resources in grid computing systems based on Multi-Agent System (MAS). This policy schedules tasks in run-time and avoids the waste of resources. A simu...
详细信息
ISBN:
(纸本)0769524052
This paper presents a run-time scheduling policy to map tasks to resources in grid computing systems based on Multi-Agent System (MAS). This policy schedules tasks in run-time and avoids the waste of resources. A simulation result is presented to prove the availability of this policy.
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.
Both the distributed component framework and the Software Configuration Management (hereafter referred to simply as SCM) have the same goal: to improve software quality, development productivity and to adjust traditio...
详细信息
ISBN:
(纸本)0780378407
Both the distributed component framework and the Software Configuration Management (hereafter referred to simply as SCM) have the same goal: to improve software quality, development productivity and to adjust traditional software developments to distributed, web-based, large-scale business application developments. The challenges in the SCM based on distributed components and layered architecture, are attracting increasing attentions and research efforts. In this paper we propose a new SCM model for the distributed component layered architecture, after characteristics of software architecture and development process have been deeply investigated. The suggested model is elicited under three basic models or blueprints: The Layered Classified Software Configuration Management (SCM) Model, The Structure Tree SCM Model, The Underlying Component Descriptive Language Model-XML. This paper concludes with several observations about our future works on SCM.
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.
I/O for parallel and distributed systems has drawn increasing attention over the past decade as it has become apparent that I/O performance, rather than CPU performance, may be the key limiting factor in the performan...
详细信息
ISBN:
(纸本)0769524052
I/O for parallel and distributed systems has drawn increasing attention over the past decade as it has become apparent that I/O performance, rather than CPU performance, may be the key limiting factor in the performance of future systems. Prefetch is the fundamental approach for improving the overall read performance. In this paper, we study three parallel prefetching algorithms-LRU-Lookahead, Fixed Horizon, and Greedy algorithmin, and explore the performance characteristics of each of the algorithms using the trace-driven simulation.
Security is an important issue in research and appliance of grid computing. Grid security model is composed of a series of mechanism and strategy to solve various practical security problems. This paper presents a gri...
详细信息
ISBN:
(纸本)0769524052
Security is an important issue in research and appliance of grid computing. Grid security model is composed of a series of mechanism and strategy to solve various practical security problems. This paper presents a grid security model based on virtual organization referring to GSI (a security component in Globus). The model consists of a logical model and a physical 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 in which all hosts participate in request dispatching. To cope with the architecture, we propose a distributed dispatching policy named DWARD. With DWARD, all the server nodes may participate in request dispatching on the basis of local access pattern. In addition, the DWARD policy inherits several desirable features of the centralized algorithms, including load balance, high locality and less forwarding overhead. Finally, a testbed is implemented on the basis of Linux kernel to benchmark various dispatching algorithms. The performance results show that DWARD can achieve favorable throughput compared with state-of-the-art dispatching policies.
暂无评论