دانلود جزوات دانشگاهی و آموزشی

عنوان انگلیسی : Parallel algorithm for finding modules of large-scale coherent fault trees سال چاپ : 2015 تعداد صفحه : 4 چکیده : The computation of the probability of the top event or minimal cut sets of fault trees is known as intractableNP-hard problems.Modularization can be used to reduce the computational cost of basic operations on faulttrees efficiently. The idea of the linear time algorithm, as a very efficient and compact modules detectingalgorithm, is visiting the nodes one by one with top-down depth-first left-most traversal of the tree. Sothe efficiency of the linear time algorithm is limited by nodes visiting time successively and serially, especiallywhen confronting large-...

عنوان انگلیسی : Parallel Processing of large graphs Abstract More and more large data collections are gathered worldwide in various IT systems. Many of them possess a networked nature and need to be processed and analysed as graph structures. Due to their size they very often require the usage of a parallel paradigm for efficient computation. Three parallel techniques have been compared in the paper: MapReduce, its map-side join extension and Bulk Synchronous Parallel (BSP). They are implemented for two different graph problems: calculation of single source shortest paths (SSSP) and collective classification of graph nodes by means of relational influence propagation (RIP). The methods and ...