default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNikolaos Drosinos
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
[j5]Nikolaos Drosinos, Nectarios Koziris:
Efficient hybrid parallelisation of tiled algorithms on SMP clusters. Int. J. Comput. Sci. Eng. 4(2): 112-126 (2009)- [j4]Georgios I. Goumas, Nikolaos Drosinos, Nectarios Koziris:
Communication-Aware Supernode Shape. IEEE Trans. Parallel Distributed Syst. 20(4): 498-511 (2009) - 2007
- [c10]Georgios I. Goumas, Nikolaos Drosinos, Vasileios Karakasis, Nectarios Koziris:
Coarse-grain Parallel Execution for 2-dimensional PDE Problems. IPDPS 2007: 1-8 - 2006
- [j3]Dora Souliou, Aris Pagourtzis
, Nikolaos Drosinos, Panayotis Tsanakas:
Computing frequent itemsets in parallel using partial support trees. J. Syst. Softw. 79(12): 1735-1743 (2006) - [j2]Georgios I. Goumas, Nikolaos Drosinos, Maria Athanasaki, Nectarios Koziris:
Message-passing code generation for non-rectangular tiling transformations. Parallel Comput. 32(10): 711-732 (2006) - [j1]Nikolaos Drosinos, Nectarios Koziris:
The Effect of Process Topology and Load Balancing on Parallel Programming Models for SMP Clusters and Iterative Algorithms. J. Supercomput. 35(1): 65-91 (2006) - [c9]Nikolaos Drosinos, Georgios I. Goumas, Nectarios Koziris:
Selecting the tile shape to reduce the total communication volume. IPDPS 2006 - 2005
- [c8]Nikolaos Drosinos, Nectarios Koziris:
Load Balancing Hybrid Programming Models for SMP Clusters and Fully Permutable Loops. ICPP Workshops 2005: 113-120 - [c7]Dora Souliou, Aris Pagourtzis, Nikolaos Drosinos:
Computing Frequent Itemsets in Parallel Using Partial Support Trees. PVM/MPI 2005: 28-37 - 2004
- [c6]Nikolaos Drosinos, Nectarios Koziris:
Performance Comparison of Pure MPI vs Hybrid MPI-OpenMP Parallelization Models on SMP Clusters. IPDPS 2004 - [c5]Georgios I. Goumas, Nikolaos Drosinos, Maria Athanasaki, Nectarios Koziris:
Automatic parallel code generation for tiled nested loops. SAC 2004: 1412-1419 - 2003
- [c4]Nikolaos Drosinos, Georgios I. Goumas, Maria Athanasaki, Nectarios Koziris:
Delivering High Performance to Parallel Applications Using Advanced Scheduling. PARCO 2003: 233-240 - [c3]Nikolaos Drosinos, Nectarios Koziris:
Advanced Hybrid MPI/OpenMP Parallelization Paradigms for Nested Loop Algorithms onto Clusters of SMPs. PVM/MPI 2003: 203-213 - 2002
- [c2]Georgios I. Goumas, Nikolaos Drosinos, Maria Athanasaki, Nectarios Koziris:
Compiling Tiled Iteration Spaces for Clusters. CLUSTER 2002: 360-369 - [c1]Georgios I. Goumas, Nikolaos Drosinos, Maria Athanasaki, Nectarios Koziris:
Data Parallel Code Generation for Arbitrarily Tiled Loop Nests. PDPTA 2002: 610-616
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
