5 Hits in 9.4 sec

Parallel computing works!

Marcin Paprzycki
1996 IEEE Parallel & Distributed Technology Systems & Applications  
The following order has beel_ adopted for evaluating possible collisions on odd time steps: 3b, 3c, 3f, 2f, 2c, 2b, 4b, 4c, 4f, l f, lc, lh; and for even time steps: lb, lc, lr, 4f, 4c, 4b, 2b, 2c, 2f  ...  The reason for the slowness of the hypercube with respect to the CRAYs is that the efficiency of the parallel logarithmic derivative code is 0.52.  ...  The data available for the tracking task consist, essentially, of line of sight measurements from various sensing platforms to individual objects in the target ensemble at (fairly) regular time intervals  ... 
doi:10.1109/mpdt.1996.7102339 fatcat:r6x46zu2pfd4rin4qpzt7ftqqq

Scalable block processing algorithms [article]

Horst, MG (Martijn) Van Der, Berkel, CH (Kees) Van, Lukkien, JJ (Johan)
The time for a SUF that is composed using a parallel composition equals the maximum of the times of its composing functions.  ...  There are many algorithms for the parallel computation of such a prefix operation [9, 49] .  ...  First of all we need the associative window computation (Definition 4.3.1) and a cost function for the merging of tiles, this is provided by the ProblemDescription class.  ... 
doi:10.6100/ir636311 fatcat:xxegi33qybbovg72k7lpj6fmte

Ant colony optimization on runtime reconfigurable architectures

Bernd Scheuermann
One possibility is to develop parallel variants of the algorithm to be executed on multi-processor machines (see Section 2.5.2 for an overview of such ACO algorithms).  ...  ., 2002] , the same master-worker model is applied to the Set Covering Problem (SCP) [Balas, 1983] , and the computation time is compared to a multi-start variant of multiple parallel ACO algorithms,  ... 
doi:10.5445/ir/1000003803 fatcat:47uiby6kc5br7gm3jc3p2sc54e

Coscheduling in the multicore era

Jan Hendrik Schönherr, Technische Universität Berlin, Technische Universität Berlin, Hans-Ulrich Heiß
Since then, there have been thorough changes in the computing landscape: (non-parallel) personal computers have penetrated the market, and with it, parallelism had become a second-class citizen.  ...  The guarantee of simultaneous execution of certain tasks allows to make use of fine-grained synchronization efficiently: it is impossible for a currently executing task to wait for another task that does  ...  There is for instance the class of obstruction-free algorithms, which profit from a relatively low DOC, or the class of throughput oriented algorithms that profit from a particular high DOC (cf.  ... 
doi:10.14279/depositonce-8908 fatcat:n7kv2lpp7fgwhko3bzhxas6bme

The Third International Conference on Data Analytics

Fritz Laux, Panos Pardalos, Alain Crolotte, Fritz Laux, Lina Yao, Eiko Yoneki, Takuya Yoshihiro, Wakayama University, Japan, Sergio Ilarri, Prabhat Mahanti, Dominique Laurent (+98 others)
Forward The Third International Conference on Data Analytics (DATA ANALYTICS 2014   unpublished
Despite considerable advancements on high performance, large storage, and high computation power, there are challenges in identifying, clustering, classifying, and interpreting of a large spectrum of information  ...  We hope Rome provided a pleasant environment during the conference and everyone saved some time for exploring this beautiful city.  ...  We provide a comparison with recently published algorithms on several data sets.  ...