Now days due to rapid growth of data in organizations, extensive data processing is a central point of Information Technology. Mining of Association rules in large database is the challenging task. An Apriori algorith...
详细信息
Now days due to rapid growth of data in organizations, extensive data processing is a central point of Information Technology. Mining of Association rules in large database is the challenging task. An Apriori algorithm is widely used to find out the frequent item sets from database. But it will be inefficient in case of large database because it will require more I/O load. Later drawback of the Apriori algorithm is overcome by many algorithms / parallel algorithms (model) but those are also inefficient to find frequent item sets from large database with less time and with great efficiency. Hence hybrid architecture is proposed which consists of integrated distributed and parallelcomputing concept. the main idea of new architecture is that we combine distributed as well as parallelcomputing in such a way that it will be efficient to find out frequent item sets from large databases in less time. It also handle large database with efficiently than existing algorithms. (C) 2016 Published by Elsevier B.V.
this paper describes preliminary work in creating a scalable service for the purposes of automated planning and scheduling: a methodology within artificial intelligence that requires flexible computational resources o...
详细信息
ISBN:
(纸本)9781479978816
this paper describes preliminary work in creating a scalable service for the purposes of automated planning and scheduling: a methodology within artificial intelligence that requires flexible computational resources on a per-problem basis. We describe the challenges of automated planning and how moving solution construction to a distributed system alleviates issues faced in the application of planning in real-world problems. We explore how the current system has been designed and give indication of how this work moves towards creating an online planning service that is scalable to the needs of both individual users and the overall workload required of the system.
We present two classes of distributed algorithms called DRBA and DOBA, for decentralized, proactive resource allocation in asynchronous real-time distributed systems. the objective of the algorithms is to maximize agg...
详细信息
ISBN:
(纸本)0769517692
We present two classes of distributed algorithms called DRBA and DOBA, for decentralized, proactive resource allocation in asynchronous real-time distributed systems. the objective of the algorithms is to maximize aggregate application benefit and deadline-satisfied ratio for an user-specified future time interval. Since determining the optimal allocation is computationally intractable, the algorithms heuristically compute near-optimal allocations in polynomial-time. While the DRBA algorithms analyze subtask response times to determine allocation decisions, which are computationally expensive, the DOBA algorithms analyze processor overloads to compute their decisions in a much faster way. Within each class, we present three algorithms that differ in the way they tolerate end-host failures: no reallocation upon failure, stateless reallocation, and stateful reallocation.
Functional and non-functional concerns require different programming effort, different techniques and different methodologies when attempting to program efficient parallel/distributed applications. In this work we pre...
详细信息
ISBN:
(纸本)9783642041662
Functional and non-functional concerns require different programming effort, different techniques and different methodologies when attempting to program efficient parallel/distributed applications. In this work we present a "programmer oriented" methodology based on formal tools that permits reasoning about parallel/distributed program development and refinement. the proposed methodology is semi-formal in that it does not require the exploitation of highly formal tools and techniques, while providing a palatable and effective support to programmers developing parallel/distributed applications, in particular when handling non-functional concerns.
the Phylogenetic Likelihood Function (PLF) is an important statistical function for evaluating phylogenetic trees. To this end, the PLF is the computational kernel of all state-of-the-art likelihood-based phylogenetic...
详细信息
ISBN:
(纸本)9780769546766
the Phylogenetic Likelihood Function (PLF) is an important statistical function for evaluating phylogenetic trees. To this end, the PLF is the computational kernel of all state-of-the-art likelihood-based phylogenetic inference programs. Typically, it accounts for more than 85% of total execution time in such programs. We present a substantially improved hardware architecture for computingthe PLF based on previous experiences with implementing the PLF on reconfigurable logic. Our new design is optimized for computingthe PLF on four-state (DNA) input data. It is also adapted to the computational requirements of real-world tree inference programs and completely independent of the specific tree search algorithm at hand. Furthermore, we describe how our architecture can be modified and adapted to handle general n-state data, such as protein (20 states) or RNA secondary structure data (6, 7, or 16 states, depending on the model). Finally, we designed an interface mechanism such that our PLF hardware architecture can interact withthe widely-used phylogenetic inference tool RAxML. We deploy FPGA technology to verify the correctness of the architecture and to evaluate performance.
Multi-word Relevant Expressions (REs) can be defined as sequences of words (n-grams) with strong semantic meaning, such as "ice melting" and "Ministere des Affaires Etrangeres", useful in Informati...
详细信息
ISBN:
(纸本)9781479989379
Multi-word Relevant Expressions (REs) can be defined as sequences of words (n-grams) with strong semantic meaning, such as "ice melting" and "Ministere des Affaires Etrangeres", useful in Information Retrieval, Document Clustering or Classification and Indexing of Documents. the need of extracting REs in several languages led research on statistical approaches rather than symbolic methods, since the former allow language-independence. Based on the assumption that REs have strong cohesion between their consecutive n-grams, the LocalMaxs algorithm is a language independent approach that extracts REs. Apart from its good precision, this extractor is time-consuming, being inoperable for Big Data if implemented in a sequential manner. this paper presents the first parallel and distributed version of this algorithm, achieving almost linear speedup and sizeup when processing corpora up to 1 billion words, using up to 54 virtual machines in a public cloud. this parallel version of the algorithm explores the statistical knowledge of the n-grams in the corpus, to promote the locality of the references.
Withthe new trends in signals analysis for permanent improvement of the investigation systems there is a growing demand for fast and smart parallel algorithms to work on 1D long datasets. the idea is to compute the t...
详细信息
We study the Steiner tree problem in the CONGESTED CLIQUE model of distributedcomputing. We present a deterministic distributed approximation algorithm that computes a Steiner tree in Õ(n1/3) rounds and Õ(n...
详细信息
A heterogeneous network of workstations (NOW) introduces a new performance factor into distributedcomputing: a large variation of the computing power of the different workstations. this unique factor makes traditiona...
详细信息
A heterogeneous network of workstations (NOW) introduces a new performance factor into distributedcomputing: a large variation of the computing power of the different workstations. this unique factor makes traditional performance models/metrics for homogeneous computing measurement and evaluation not suitable for heterogeneous computing. In this paper, we present models which quantify the heterogeneity of networks and characterize the performance effects. the models consider effects of boththe heterogeneity and time-sharing in a nondedicated environment. Speedup, efficiency and scalability are defined. these models are general enough to cover performance evaluation of both homogeneous and heterogeneous computations in dedicated and nondedicated NOW systems. To validate and support performance modeling results, we conducted a collection of experimental measurements for evaluating computing performance and scalability of a group of application programs on a heterogeneous NOW.
Group membership protocols in distributed systems enable entities in a group to be aware of all other entities in the group. this information is essential for the system to perform as a cohesive unit collaborating to ...
详细信息
暂无评论