Miquel Pericàs

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Naoya Maruyama

> Home > Persons > Miquel Pericàs

Publications

2017
[j7]
- view
  authority control:
- export record
  dblp key:
  - journals/tpds/UnatDHSABCCEFFH17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tpds/UnatDHSABCCEFFH17
Didem Unat, Anshu Dubey, Torsten Hoefler, John Shalf, Mark James Abraham, Mauro Bianco, Bradford L. Chamberlain, Romain Cledat, H. Carter Edwards, Hal Finkel, Karl Fuerlinger, Frank Hannig, Emmanuel Jeannot, Amir Kamil, Jeff Keasler, Paul H. J. Kelly, Vitus J. Leung, Hatem Ltaief, Naoya Maruyama, Chris J. Newburn, Miquel Pericàs:
Trends in Data Locality Abstractions for HPC Systems. IEEE Trans. Parallel Distributed Syst. 28(10): 3007-3020 (2017)
2016
[c29]
- view
  authority control:
- export record
  dblp key:
  - conf/iwomp/AmerMPMTYB16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iwomp/AmerMPMTYB16
Abdelhalim Amer, Satoshi Matsuoka, Miquel Pericàs, Naoya Maruyama, Kenjiro Taura, Rio Yokota, Pavan Balaji:
Scaling FMM with Data-Driven OpenMP Tasks on Multicore Architectures. IWOMP 2016: 156-170
2013
[c21]
- view
  authority control:
- export record
  dblp key:
  - conf/supercomputer/AmerMPTYM13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/supercomputer/AmerMPTYM13
Abdelhalim Amer, Naoya Maruyama, Miquel Pericàs, Kenjiro Taura, Rio Yokota, Satoshi Matsuoka:
Fork-Join and Data-Driven Execution Models on Multi-core Architectures: Case Study of the FMM. ISC 2013: 255-266

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.