A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Filters
Efficient Generation of Mandelbrot Set using Message Passing Interface
[article]
2020
arXiv
pre-print
Preserved Fulltext
Then Amdhal's Law is used to calculate the theoretical speed up, to be used to compare three partition schemes. ...
But the Alternating Row Segmentation approach performs better when the number of tasks are < 16, where as the First Come First Served approach performs better when the number of tasks is > 16. ...
METHODOLOGY
• Theoretical Speed up vs Actual Speed up • Actual Speed up comparison between each partition scheme
TABLE I : I Number of tasks vs Theoretical Speed up factor Number of Tasks
Speed up ...
arXiv:2007.00745v1
fatcat:ldng5c2acvdq7b4lfymy6zpqiy
A Parallel Hybrid Technique for Multi-Noise Removal from Grayscale Medical Images
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Moreover, Speed up and efficiency are calculated for the algorithm and they show a measured enhancement. ...
Thus, each case has the best time when assigned to number of threads equal to the number of its partitions. ...
input Fig.7 gives the resulted average speed up when image is divided into 2, 4 and 8 partitions the maximum speed up achieved in 4-partition case when assigned to 4 threads, it was = 4.05, 4-partition ...
arXiv:2005.05371v1
fatcat:e7mthqhlcfavvco6xkyfwa2cay
Parallel PathFinder Algorithms for Mining Structures from Graphs
2009
2009 Ninth IEEE International Conference on Data Mining
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
While this problem has previously been tackled by using mathematical properties to speed up the algorithm, in this paper, we propose two new algorithms to speed up PathFinder computation based on parallelization ...
Experiments show that both new algorithms are more efficient than the state of the art algorithms; one of them can achieve speed-ups of up to x127 with an average of x23 on recent hardware (2007). ...
2. Is it possible to leverage the sparseness of the input graph to achieve even greater speed ups? ...
doi:10.1109/icdm.2009.142
dblp:conf/icdm/HauguelZH09
fatcat:hs7faruksjbkrjvuttccx5bofa
Explaining Dynamic Cache Partitioning Speed Ups
2007
IEEE computer architecture letters
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we introduce some metrics that characterize applications and allow us to give a clear and simple model to explain final throughput speed ups. ...
Cache Partitioning has been proposed as an interesting alternative to traditional eviction policies of shared cache levels in modern CMP architectures: throughput is improved at the expense of a reasonable ...
Fig. 1 . 1 Performance of benchmarks as we vary the number of ways.
Fig. 2 .Fig. 3 . 23 IPC speed up when w 90% (th i ) < w LRU (th i ). ...
doi:10.1109/l-ca.2007.3
fatcat:xc2hmglnrzgvtb6sfcsydl7ee4
Data parallel fault simulation
1999
IEEE Transactions on Very Large Scale Integration (vlsi) Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
In this paper, we discuss a novel technique to partition the fault set for data parallel fault simulation. When applied statically, the technique can scale well for up to eight processors. ...
The fault set partitioning technique is simple, can itself be parallelized, and can be implemented with extreme ease. ...
The actual speed-up in MAX -TIME a ,&way partition is tiIAX--TIMEk. If the parallelization technique is perfect, the fault simulation workload speed-up sl~oulcl be k. ...
doi:10.1109/92.766745
fatcat:zpabnkbthfdjrialwejlubcvb4
A Workflow Application for Parallel Processing of Big Data from an Internet Portal
2014
Procedia Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The goal is to assess achievable speed-ups and determine which factors influence scalability and to what degree. ...
Obtained execution times as well as speed-ups are presented for data sets of various sizes along with discussion on how factors such as load imbalance and memory/disk bottlenecks limit performance. ...
2 with preprocessing for fewer (5) top level directories Speed-up vs number of computer nodes and processors per node for nt.interia.pl SET 2 with preprocessing for fewer (5) top level directories
Figure ...
doi:10.1016/j.procs.2014.05.045
fatcat:zvsstkymlnbmhbiixpdo472gcy
FlexDCP
2009
ACM SIGOPS Operating Systems Review
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is application/pdf.
Consequently, it offers more flexibility to the OS as it can optimize different QoS metrics like per-application performance or global performance metrics such as fairness, weighted speed up or throughput ...
When optimizing a global QoS metric like fairness, FlexDCP consistently outperforms traditional eviction policies like LRU, pseudo LRU and previous dynamic cache partitioning proposals for two-, four-and ...
With a 16-way cache, the number of executed instructions is less than 5000, while for a 32-way cache this number increases up to less than 20000 instructions. ...
doi:10.1145/1531793.1531806
fatcat:e3mn4d5xwne6ngpfdjeuxqyuiy
Dynamic Data Partition Algorithm For A Parallel H.264 Encoder
2010
Zenodo
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Using the data partition, the encoder obtains more than 3.59x speed-up on a four-processor system. This work can be applied to other multimedia processing applications. ...
In order to reduce the encoding time, dynamic data partition based on macroblock region is proposed. The data partition has the advantages in load balancing and data communication overhead. ...
The simulation results are 3.08x speed-up in QCIF format and 3.17x speed-up in CIF video formats. ...
doi:10.5281/zenodo.1056711
fatcat:khx2rzb7hvh2fnq4ubroby5mum
Towards Parallel Real-Time Trajectory Planning
[chapter]
2012
Advances in Intelligent and Soft Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In our solution, each partition of the geographical space is represented as an agent. ...
In particular we investigate the approach that schedules the workload on the cores using the hashing function based on the geographical partitioning of the search space. ...
grant number 6840770038. ...
doi:10.1007/978-3-642-28786-2_11
dblp:conf/paams/KoprivaSP12
fatcat:3mvah5svwbcy5gx7tawyq37c5a
Partitioning Graphs to Speed Up Dijkstra's Algorithm
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Using a suited partitioning algorithm speed-up factors of 500 and more were achieved. Furthermore, we present an extension of this speed-up technique to multiple levels of partitionings. ...
In particular, we examine partitioning algorithms from computational geometry and compare their impact on the speed-up of the shortest-path algorithm. ...
The base partitioning method: Grid, KdTree or METIS 2. The number of partitions 3. Usage of one-level partitions or two-level partitions 4. ...
doi:10.1007/11427186_18
fatcat:gva3oddb6zcbxaxhib536o725e
Efficient graph-based dynamic load-balancing for parallel large-scale agent-based traffic simulation
2014
Proceedings of the Winter Simulation Conference 2014
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The results showed that our dynamic load-balancing mechanism has improved the speed-up of the parallel simulation significantly compared to static graph partitioning methods. ...
The remainder of the paper is organized as follows: Sections 2 presents the exiting work on the partitioning and dynamic load-balancing of microscopic traffic simulations. ...
Figure 4 : 4 Comparision of speed-ups of different configurations. ...
doi:10.1109/wsc.2014.7020180
dblp:conf/wsc/XuCAL14
fatcat:nzqgtwc2znbc5admjg36moeu2u
Partitioning graphs to speedup Dijkstra's algorithm
2007
ACM Journal of Experimental Algorithmics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Using a suited partitioning algorithm speed-up factors of 500 and more were achieved. Furthermore, we present an extension of this speed-up technique to multiple levels of partitionings. ...
In particular, we examine partitioning algorithms from computational geometry and compare their impact on the speed-up of the shortest-path algorithm. ...
The base partitioning method: Grid, KdTree or METIS 2. The number of partitions 3. Usage of one-level partitions or two-level partitions 4. ...
doi:10.1145/1187436.1216585
fatcat:ocfn3zdjerg3tkhq4kbgzzog5a
Singly-Bordered Block-Diagonal Form for Minimal Problem Solvers
[chapter]
2015
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
In this paper, we present a method that potentially significantly speeds up Gröbner basis solvers. ...
We demonstrate the usefulness of the presented method by speeding up solvers of several important minimal computer vision problems. ...
Fig. 2 . 2 (Left) 2-way partitioning Π = {V1, V2} = {N1, N2; NS} of HA. (Right) SBBD form ASB of A induced by Π. ...
doi:10.1007/978-3-319-16808-1_33
fatcat:ggm4tg32xvhkfnqds6aatefheu
Covariance estimation for vertically partitioned data in a distributed environment
[article]
2016
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The results show that it is exactly same as centralized method with good speed-up in terms of computation. ...
The reason for speed-up is because of the parallel construction of local covariances and distributing the cross-covariances among the nodes so that the load is balanced. ...
The speed-up is shown in Fig 5. It is observed that the speed-up is increasing with the number of partitions hence scalable. ...
arXiv:1606.07336v1
fatcat:et2gjveei5gaxk6anpa3mk3am4
Handling big dimensions in distributed data warehouses using the DWS technique
2004
Proceedings of the 7th ACM international workshop on Data warehousing and OLAP - DOLAP '04
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
With the proposed strategy the performance speed up and scale up obtained in the DWS technique are not affected by the presence of big dimensions. ...
The data partitioning approach partition the facts tables through all nodes and replicates the dimension tables. ...
In a more detailed way, the key aspects that contribute to the nearly optimal speedup and scale up are: − Speed up (when adding more nodes the response time decrease proportionally): 1. ...
doi:10.1145/1031763.1031770
dblp:conf/dolap/CostaM04
fatcat:l5tbfhebqbekjfjnidpbt7qheu
« Previous
Showing results 1 — 15 out of 285,297 results