Author image not provided
 Jochen Speck

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article2.63
Citation Count21
Publication count8
Publication years2007-2015
Available for download2
Average downloads per article175.50
Downloads (cumulative)351
Downloads (12 Months)58
Downloads (6 Weeks)4
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


8 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 8 of 8
Sort by:

1 published by ACM
September 2015 ACM Transactions on Parallel Computing (TOPC) - Special Issue for SPAA 2013: Volume 2 Issue 3, October 2015
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 1,   Downloads (12 Months): 31,   Downloads (Overall): 141

Full text available: PDFPDF
We present an algorithm for inversion of symmetric positive definite matrices that combines the practical requirement of an optimal number of arithmetic operations and the theoretical goal of a polylogarithmic critical path length. The algorithm reduces inversion to matrix multiplication. It uses Strassen’s recursion scheme, but on the critical path ...
Keywords: Strassen’s inversion algorithm, numerics, Parallel algorithms, matrix inversion, Newton approximation, linear algebra, polylogarithmic time

2
May 2015 IPDPS '15: Proceedings of the 2015 IEEE International Parallel and Distributed Processing Symposium
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 0

Modern computers have deepening memory hierarchieswith multiple levels of (partially shared) cachesand non-uniform memory access (NUMA). This makes itincreasingly difficult and important to schedule computationsin such a way that expensive memory accesses are avoided.In this paper we are choosing LU-decomposition for a case study since its use in the famous ...
Keywords: Numerical Linear Algebra, Scheduling and task partitioning, Cache memories

3 published by ACM
July 2013 SPAA '13: Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 3,   Downloads (12 Months): 27,   Downloads (Overall): 210

Full text available: PDFPDF
We present an algorithm for matrix inversion that combines the practical requirement of an optimal number of arithmetic operations and the theoretical goal of a polylogarithmic critical path length. The algorithm reduces inversion to matrix multiplication. It uses Strassen's recursion scheme but on the critical path, it breaks the recursion ...
Keywords: linear algebra, matrix inversion, newton approximation, numerics, parallel algorithms, polylogarithmic time, strassen's inversion algorithm

4
May 2013 IPDPS '13: Proceedings of the 2013 IEEE 27th International Symposium on Parallel and Distributed Processing
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 0

Malleable jobs can adapt to varying degrees of available parallelism. This is an interesting approach to more flexible usage of parallel resources. For example, malleable jobs can be scheduled optimally and efficiently where more restricted forms of parallel jobs are NP-hard to handle. However, little work has been done on ...

5
August 2012 Euro-Par'12: Proceedings of the 18th international conference on Parallel Processing
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 3

We give an efficient algorithm for solving the following scheduling problem to optimality: Assign n jobs to m processors such that they all meet a common deadline T and energy consumption is minimized by appropriately controlling the clock frequencies of the processors. Jobs are malleable, i.e., their amount of parallelism ...

6
May 2011 IPDPS '11: Proceedings of the 2011 IEEE International Parallel & Distributed Processing Symposium
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 2

We give an $O(n + \min\{n,m\} \log{m})$ work algorithm for scheduling $n$ tasks with flexible amount of parallelism on $m$ processors, provided the speedup functions of the tasks are concave. We give efficient parallelizations of the algorithm that run in polylogarithmic time. Previous algorithms were sequential and required quadratic work. ...

7
December 2009 Parallel Computing: Volume 35 Issue 12, December, 2009
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 13

We present a new, simple algorithmic idea for the collective communication operations broadcast, reduction, and scan (prefix sums). The algorithms concurrently communicate over two binary trees which both span the entire network. By careful layout and communication scheduling, each tree communicates as efficiently as a single tree with exclusive use ...
Keywords: Message-passing parallel programming, Reduction, Bipartite-edge coloring, Broadcast, Parallel prefix (scan)

8
September 2007 PVM/MPI'07: Proceedings of the 14th European conference on Recent Advances in Parallel Virtual Machine and Message Passing Interface
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 1

We present a new, simple algorithmic idea for exploiting the capability for bidirectional communication present in many modern interconnects for the collective MPI operations broadcast, reduction and scan. Our algorithms achieve up to twice the bandwidth of most previous and commonly used algorithms. In particular, our algorithms for reduction and ...



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us