Previous work on simulation of LRU caching led to the development of parallel algorithms that are efficient for small numbers of processors. However, these algorithms exhibit a sub-linear speedup, where the efficiency seriously decreases with a higher number of processors. In order to achieve linear speedup, this work proposes the use of approximation techniques with the existing parallelizatio...

Real-time inspections for the large-scale solar system may take a long time to get hazard situations any failures that place in panels normal operations, where prior hazards detection is important. Reducing execution and improving system’s performance are ultimate goals of multiprocessing or multicore systems. video processing analysis from two camcorders, thermal charge-coupling devices (CCD),...

In our study, we improve our Parallel Inductive Logic Programming (ILP) System to enable super linear speedup. This improvement redesigns several features of our ILP learning system and our parallel mechanism. The redesigned ILP learning system searches and gathers all rules that have the same evaluation in the learning. The redesigned parallel mechanism adds a communication protocol for sharin...

We implement a modified Floyd-Warshall algorithm to solve the all-to-all shortest paths problem in O(n3 logn) time using MPI. Through the use of non-blocking round-robin message passing and other memory optimizations, we show super-linear speedup for a 4000 node graph problem, achieving a 23x speedup for 8 threads. In contrast, our reference OpenMP implementation achieved a 5x speedup for the s...

Computation in prime fields Zp is used by various algorithms in computer algebra, and plays an important role in practice, especially when p is represented direct by machine datatype. The application area is wide spreaded, but in most cases, major part of the calculation can be reduced to a combination of basic linear operations, as in the calculations with polynomials over Zp. Arithmetic in Zp...

A set of parallel replicas of a single simulation can be statistically coupled to closely approximate long trajectories. In many cases, this produces nearly linear speedup over a single simulation (M times faster with M simulations), rendering previously intractable problems within reach of large computer clusters. Interestingly, by varying the coupling of the parallel simulations, it is possib...

A family of multiprocessor architectures implementing the Viterbi algorithm is presented. The family of architectures is shown to be capable of achieving an increase in throughput that is directly proportional to the number of processors when the number of processors is smaller than the constraint length v of the code. The hardware utilization and the depth of the pipelining available inside ea...

In this paper a problem of deterministic scheduling parallel applications in a multiprogrammed multiprocessor system is considered. We address the preemptive case. The number of processors used by a task can change over time. Any task can be executed with linear speedup on a number of processors not greater than some task-dependent constant. This problem can be solved by a low-order polynomial ...