Current visual text mining platforms are still focused on small or medium-scale datasets and sequential algorithms. However, as document collections increase in size and complexity, more computing resources are requir...
详细信息
ISBN:
(纸本)9780889867741
Current visual text mining platforms are still focused on small or medium-scale datasets and sequential algorithms. However, as document collections increase in size and complexity, more computing resources are required in order to achieve the expected interactive experience. In order to address the scalability problem, this paper proposes and evaluates parallel implementations for three critical visual text mining algorithms. Experiments withthe parallel solutions were conducted for varying dataset sizes and different numbers of processors. the results show a good speedup for the proposed solutions and indicate the potential benefits of exploring task parallelism in critical algorithms to improve scalability of an interactive visual text mining platform.
this paper deals with service management in the large distributedsystems. A framework called Remote Maintenance Shell (RMS) is presented. It enables the distributed service management operations (deployment, configur...
详细信息
this paper deals with service management in the large distributedsystems. A framework called Remote Maintenance Shell (RMS) is presented. It enables the distributed service management operations (deployment, configuration, control, monitoring, upgrading, and versioning), as well as the advanced features related to the verification on the actual target system. RMS is based on the operations performed by mobile agents that act within an agent team. the case study elaborates a scenario in which RMS prototype is used for managing a service employed in the distributed environment.
On parallelsystems, jobs that request a large fraction of the maximum resources available on the system may incur poor wait time. this paper evaluates whether giving a reservation to every waiting job can improve lar...
详细信息
On parallelsystems, jobs that request a large fraction of the maximum resources available on the system may incur poor wait time. this paper evaluates whether giving a reservation to every waiting job can improve large jobs without significantly degrading the performance of other jobs. Using a wide range of workloads, including more recent workloads than SP2 workloads, and a more complete set of performance measures than in previous studies, we provide new observations of potential benefit and problem of reservation policies that give all jobs a reservation.
We consider a distributed computer system in Wardrop equilibrium, i.e., situations where no user can reduce its own response time by unilaterally choosing another path, if all the other users retain their present path...
详细信息
ISBN:
(纸本)0889865701
We consider a distributed computer system in Wardrop equilibrium, i.e., situations where no user can reduce its own response time by unilaterally choosing another path, if all the other users retain their present paths. the Braess paradox is a famous example of paradoxical cases where adding capacity to a network degrades the performance of all users. this study examines numerically some examples around the Braess-like paradox in a distributed computer system. We found that Braess's paradox can occur, namely in equilibrium the mean job response time in the network after adding a communication line for the sharing of jobs between nodes, for some system parameter setting, can be greater than the mean job response time in the network before adding the communication line. Indeed, two different types of paradox called weak and strong paradox have been characterized. In the range of parameter values examined, the worst case ratio of performance degradation obtained in the examined network model is about 75% and 65% for the cases of weak and strong paradox respectively.
In engineering applications often real-valued performance functions must be optimized. If the performance function is discontinuous, there exist no derivations with respect to the parameters that should be optimized. ...
详细信息
ISBN:
(纸本)9780889867741
In engineering applications often real-valued performance functions must be optimized. If the performance function is discontinuous, there exist no derivations with respect to the parameters that should be optimized. thus, we can only use undirected search methods. In contrast to simple trial-and-error approaches, evolutionary strategies can extract population-based information that guide the search process and help to improve the quality of the results. the paper describes the parallel implementation of an state-of-the-art evolutionary strategy which uses the covariance adaptation operator. It proposes a communication topology for maintaining selective pressure and a master-slave scheme for fault tolerance in distributed environments which are composed of volatile resources. Experimental results demonstrate how the implementation can be adapted to specific needs and how the parallel implementation behaves in the case of resource failures.
the development of Grid environment provides an efficient way for implementing the parallel algorithm. Here we focus on the discovery of short recurring patterns in DNA sequences that represent binding sites for certa...
详细信息
the development of Grid environment provides an efficient way for implementing the parallel algorithm. Here we focus on the discovery of short recurring patterns in DNA sequences that represent binding sites for certain proteins in the process of gene regulation. We develop parallelcomputing algorithm for solving this problem by partitioning the overall DNA sequences. this provides us an option to implement the algorithm on Grid and to evaluate its performance. We use the open source software "Alchemi" for building the Grid environment. Also by using a merging repeat approach to find these patterns, we address other related problems, including finding of repetition with insertion and deletion.
this paper presents a concept called virtual clusters (VCs) to allocate resources for an application from a computing utility with a geographically distributed resource base. the VC creation process is modeled as a fa...
详细信息
this paper presents a concept called virtual clusters (VCs) to allocate resources for an application from a computing utility with a geographically distributed resource base. the VC creation process is modeled as a facility location problem and an efficient heuristic is devised to solve it. We extend the model to include an "overload partition" to a VC such that demand surges can be efficiently handled. Extensive simulations have been conducted to examine the performance of VCs under different scenarios and to compare it with a fully dynamic scheme called the Service Grid. the results indicate that VC is more cost-effective and robust than Service Grid.
暂无评论