Search Results - "Koziris, N."
-
1
DIANA-microT web server: elucidating microRNA functions through target prediction
Published in Nucleic acids research (01-07-2009)“…Computational microRNA (miRNA) target prediction is one of the key means for deciphering the role of miRNAs in development and disease. Here, we present the…”
Get full text
Journal Article -
2
DIANA-microT Web server upgrade supports Fly and Worm miRNA target prediction and bibliographic miRNA to disease association
Published in Nucleic acids research (01-07-2011)“…microRNAs (miRNAs) are small endogenous RNA molecules that are implicated in many biological processes through post-transcriptional regulation of gene…”
Get full text
Journal Article -
3
Communication-Aware Supernode Shape
Published in IEEE transactions on parallel and distributed systems (01-04-2009)“…In this paper we revisit the supernode-shape selection problem, that has been widely discussed in bibliography. In general, the selection of the supernode…”
Get full text
Journal Article -
4
An efficient code generation technique for tiled iteration spaces
Published in IEEE transactions on parallel and distributed systems (01-10-2003)“…This paper presents a novel approach for the problem of generating tiled code for nested for-loops, transformed by a tiling transformation. Tiling or supernode…”
Get full text
Journal Article -
5
A pipelined schedule to minimize completion time for loop tiling with computation and communication overlapping
Published in Journal of parallel and distributed computing (01-11-2003)“…This paper proposes a new method for the problem of minimizing the execution time of nested for-loops using a tiling transformation. In our approach, we are…”
Get full text
Journal Article -
6
TarBase 6.0: capturing the exponential growth of miRNA targets with experimental support
Published in Nucleic acids research (01-01-2012)“…As the relevant literature and the number of experiments increase at a super linear rate, databases that curate and collect experimentally verified microRNA…”
Get full text
Journal Article -
7
Chain grouping: a method for partitioning loops onto mesh-connected processor arrays
Published in IEEE transactions on parallel and distributed systems (01-09-2000)“…This paper presents Chain Grouping, a new low complexity method for the problem of partitioning the loop iteration space into groups with little…”
Get full text
Journal Article -
8
Global-scale peer-to-peer file services with DFS
Published in 2007 8th IEEE/ACM International Conference on Grid Computing (01-09-2007)“…The global inter-networking infrastructure that has become essential for contemporary day-to-day computing and communication tasks, has also enabled the…”
Get full text
Conference Proceeding -
9
Load balancing hybrid programming models for SMP clusters and fully permutable loops
Published in 2005 International Conference on Parallel Processing Workshops (ICPPW'05) (2005)“…This paper emphasizes on load balancing issues associated with hybrid programming models for the parallelization of fully permutable nested loops onto SMP…”
Get full text
Conference Proceeding -
10
okeanos: Building a Cloud, Cluster by Cluster
Published in IEEE internet computing (01-05-2013)“…Traditional cluster management matters even when building a production cloud. Here, the authors present their approach to building the ~okeanos cloud service…”
Get full text
Journal Article -
11
An Extended Compression Format for the Optimization of Sparse Matrix-Vector Multiplication
Published in IEEE transactions on parallel and distributed systems (01-10-2013)“…Sparse matrix-vector multiplication (SpM × V) has been characterized as one of the most significant computational scientific kernels. The key algorithmic…”
Get full text
Journal Article -
12
A tile size selection analysis for blocked array layouts
Published in 9th Annual Workshop on Interaction between Compilers and Computer Architectures (INTERACT'05) (2005)“…Efficient use of the memory hierarchy is essential for good performance due to the ever-increasing gap between processor and memory speed. Program…”
Get full text
Conference Proceeding -
13
Compiling tiled iteration spaces for clusters
Published in Proceedings. IEEE International Conference on Cluster Computing (2002)“…We present a complete end-to-end framework to generate automatic message-passing code for tiled iteration spaces. We consider general parallelepiped tiling…”
Get full text
Conference Proceeding -
14
Fast and Cost-Effective Online Load-Balancing in Distributed Range-Queriable Systems
Published in IEEE transactions on parallel and distributed systems (01-08-2011)“…Distributed systems such as Peer-to-Peer overlays have been shown to efficiently support the processing of range queries over large numbers of participating…”
Get full text
Journal Article -
15
A pipelined execution of tiled nested loops on SMPs with computation and communication overlapping
Published in Proceedings. International Conference on Parallel Processing Workshop (2002)“…This paper proposes a novel approach for the parallel execution of tiled iteration spaces onto a cluster of SMP PC nodes. Each SMP node has multiple CPUs and a…”
Get full text
Conference Proceeding -
16
Evaluation of loop grouping methods based on orthogonal projection spaces
Published in Proceedings 2000 International Conference on Parallel Processing (2000)“…This paper compares three similar loop-grouping methods. All methods are based on projecting the n-dimensional iteration space J/sup n/ onto a k-dimensional…”
Get full text
Conference Proceeding -
17
Optimal time and efficient space free scheduling for nested loops
Published in Computer journal (01-01-1996)“…The most important issue when parallelizing sequential programs is the efficient assignment of computations into different processing elements. The most…”
Get full text
Journal Article -
18
Geometric scheduling of 2-D uniform dependence loops
Published in Proceedings. Eighth International Conference on Parallel and Distributed Systems. ICPADS 2001 (2001)“…One of the primary tasks in the area of uniform dependence loops, is predicting the execution propagation, as well as finding an optimal time schedule. In this…”
Get full text
Conference Proceeding -
19
An efficient algorithm for the physical mapping of clustered task graphs onto multiprocessor architectures
Published in Proceedings 8th Euromicro Workshop on Parallel and Distributed Processing (2000)“…The most important issue in sequential program parallelisation is the efficient assignment of computations into different processing elements. In the past, too…”
Get full text
Conference Proceeding -
20
A parallel parsing VLSI architecture for arbitrary context free grammars
Published in Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250) (1998)“…We propose a fixed size one dimensional VLSI architecture for the parallel parsing of arbitrary context free (CF) grammars, based on Earley's algorithm. The…”
Get full text
Conference Proceeding