This paper studies the following question: given an instance of the propositional satisfiability problem, a randomized satisfiability solver, and a cluster of n computers, what is the best way to use the computers to solve the instance? Two approaches, simple distribution and search space partitioning as well as their combinations are investigated both analytically and empirically. It is shown ...

background: phenylalanine dehydrogenase (phedh ec 1.4.1.20) is a nad+-dependent enzyme that performs the reversible oxidative deamination of l-phenylalanine to phenylpyruvate. it plays an important role in detection and screening of phenylketonuria (pku) diseases and production of chiral intermediates as well. the main goal of this study was to find a simple and rapid alternative method for pur...

Introduction: Corrosion and scaling of water in distribution systems in spite of imposing economic and aesthetic problems can lead to adverse effects on consumers' health. The present study was conducted to evaluate the corrosion and scaling of water distribution system of Sarableh city (Ilam, Iran) during summer and winter seasons in 2014. Materials and methods: Totally, 60 samples of wate...

In this thesis, I designed, prototyped and benchmarked two different data partitioning strategies for social network type workloads. The first strategy takes advantage of the heavy-tailed degree distributions of social networks to optimize the latency of vertex neighborhood queries. The second strategy takes advantage of the high temporal locality of workloads to improve latencies for vertex ne...

Like most data models encountered in the Big Data ecosystem, RDF stores are managing large data sets by partitioning triples across a cluster of machines. Nevertheless, the graphical nature of RDF data as well as its associated SPARQL query execution model makes the efficient data distribution more involved than in other data models, e.g., relational. In this paper, we propose a novel system th...

Hardware-software partitioning in an embedded multiprocessor field programmable gate array (FPGA) system is difficult as such systems are uncertain and constraints are various. Moreover, the effect of relational degree for each partitioning combination of system constraints is too difficult analysis to determine a partitioning result. This work applies grey relational analysis to identify a par...

1.1 INTRODUCTION An important component of parallel scientific computing is the assignment of work to processors. This assignment problem is also known as partitioning or mapping. The goal of the assignment problem is to find a task-to-processor mapping that will minimize the total execution time. Although efficient optimal solutions for certain restricted variations, such as chain-or tree-stru...

Clustering on Distribution measurement is an essential task in mining methodology. The previous methods extend traditional partitioning based clustering methods like k-means and density based clustering methods like DBSCAN rely on geometric measurements between objects. The probability distributions have not been considered in measuring distance similarity between objects. In this paper, object...