MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Searching for authors named "Apostolos Gerasoulis" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB
Help! 15 documents found, showing 1 through 10. Next 10 →
ATOM RSS
  • List Scheduling with and without Communication Delays  
  • by Tao Yang, Apostolos Gerasoulis — 1993 — Parallel Computing
  • …Empirical results have shown that the classical critical path (CP) list scheduling heuristic for task graphs is a fast and practical heuristic when communication cost is zero. In the first part of this paper we study the theoretical properties of the CP heuristic that lead to near optimum performanc…
  • Cited by 34 (7 self) – Add To MetaCart
  • A Parallel Programming Tool for Scheduling on Distributed Memory Multiprocessors  
  • by Tao Yang, Apostolos Gerasoulis — 1992 — in the proceedings of the Scalable High Performance Computing Conference
  • …PYRROS is a tool for scheduling and parallel code generation for distributed memory message passing architectures [35]. In this paper, we discuss several compile-time optimization techniques used in PYRROS. The scheduling part of PYRROS optimizes both data and program mapping so that the parallel ti…
  • Cited by 8 (1 self) – Add To MetaCart
  • Scheduling Program Task Graphs on MIMD Architectures  
  • by Apostolos Gerasoulis, Tao Yang — 1992 — Parallel Algorithm Derivation and Program Transformation, chapter 5
  • …Scheduling is a mapping of parallel tasks onto a set of physical processors and a determination of the starting time of each task. In this paper, we discuss several static scheduling techniques used for distributed memory architectures. We also give an overview of a software system PYRROS [38] that …
  • Cited by 5 (1 self) – Add To MetaCart
  • DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors  
  • by Tao Yang, Apostolos Gerasoulis — IEEE Transactions on Parallel and Distributed Systems
  • …We present a low complexity heuristic named the Dominant Sequence Clustering algorithm (DSC) for scheduling parallel tasks on an unbounded number of completely connected processors. The performance of DSC is comparable or even better on average than many other higher complexity algorithms. We assume…
  • Cited by 134 (10 self) – Add To MetaCart
  • On The Granularity And Clustering Of Directed Acyclic Task Graphs  
  • by Apostolos Gerasoulis, Tao Yang — 1990 — IEEE Transactions on Parallel and Distributed Systems
  • …Clustering has been used as a compile time pre-processing step in the scheduling of task graphs on parallel architectures. A special case of the clustering problem arises in scheduling an unbounded number of completely connected processors. Using a generalization of Stone's granularity definition, t…
  • Cited by 91 (21 self) – Add To MetaCart
  • A Scheduling Approach to Parallel Harmonic Balance Simulation  
  • by David L. Rhodes, Apostolos Gerasoulis — 2000 — Practice and Experience
  • …. Rather than approach the parallelization of the harmonic balance simulation method numerically, a novel scheduling-oriented approach is described. The technique leverages circuit substructure to expose potential parallelism in the form of a directed, acyclic graph (dag) of computations. This dag i…
  • Cited by 1 (0 self) – Add To MetaCart
  • Mapping Iterative Task Graphs on Distributed Memory Machines  
  • by Tao Yang, Cong Fu, Apostolos Gerasoulis, Vivek Sarkar — 1995 — Proc. 24th International Conference on Parallel Processing
  • …This paper addresses the problem of scheduling iterative task graphs on distributed memory architectures with nonzero communication overhead. The proposed algorithm incorporates techniques of software pipelining, graph unfolding and directed acyclic graph scheduling. The goal of optimization is to m…
  • Cited by 4 (0 self) – Add To MetaCart
  • Integrating Software Pipelining and Graph Scheduling for Iterative Scientific Computations  
  • by Cong Fu, Tao Yang, Apostolos Gerasoulis — 1995 — Lecture Notes in Computer Science, Proc. of Irregular '95
  • …. Graph scheduling has been shown effective for solving irregular problems represented as directed acyclic graphs(DAGs) on distributed memory systems. Many scientific applications can also be modeled as iterative task graphs(ITGs). In this paper, we model the SOR computation for solving sparse matri…
  • Cited by 1 (1 self) – Add To MetaCart
Help! Showing 1 through 10. Next 10 →
ATOM RSS
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB