A new approach to pipeline FFT processor

S He, M Torkelson - Proceedings of International Conference …, 1996 - ieeexplore.ieee.org
A new VLSI architecture for a real-time pipeline FFT processor is proposed. A hardware-
oriented radix-2/sup 2/algorithm is derived by integrating a twiddle factor decomposition …

Heuristics for scheduling parameter sweep applications in grid environments

H Casanova, A Legrand… - … (HCW 2000)(Cat. No …, 2000 - ieeexplore.ieee.org
The computational grid provides a promising platform for the efficient execution of parameter
sweep applications over very large parameter spaces. Scheduling such applications is …

Adaptive computing on the grid using AppLeS

F Berman, R Wolski, H Casanova… - IEEE transactions on …, 2003 - ieeexplore.ieee.org
Ensembles of distributed, heterogeneous resources, also known as computational grids,
have emerged as critical platforms for high-performance and resource-intensive …

The organic grid: Self-organizing computation on a peer-to-peer network

AJ Chakravarti, G Baumgartner… - IEEE Transactions on …, 2005 - ieeexplore.ieee.org
Desktop grids have been used to perform some of the largest computations in the world and
have the potential to grow by several more orders of magnitude. However, current …

A dynamic self-scheduling scheme for heterogeneous multiprocessor architectures

ME Belviranli, LN Bhuyan, R Gupta - ACM Transactions on Architecture …, 2013 - dl.acm.org
Today's heterogeneous architectures bring together multiple general-purpose CPUs and
multiple domain-specific GPUs and FPGAs to provide dramatic speedup for many …

[PDF][PDF] Job scheduling in multiprogrammed parallel systems

DG Feitelson - 1997 - cs.huji.ac.il
Scheduling in the context of parallel systems is often thought of in terms of assigning tasks in
a program to processors, so as to minimize the makespan. This formulation assumes that the …

Allocating independent tasks to parallel processors: an experimental study

T Hagerup - Journal of Parallel and Distributed Computing, 1997 - Elsevier
We study a scheduling or allocation problem with the following characteristics: The goal is to
execute a number of unspecified tasks on a parallel machine in any order and as quickly as …

On the scalability of dynamic scheduling scientific applications with adaptive weighted factoring

I Banicescu, V Velusamy, J Devaprasad - Cluster Computing, 2003 - Springer
In heterogeneous environments, dynamic scheduling algorithms are a powerful tool towards
performance improvement of scientific applications via load balancing. However, these …

OpenMP loop scheduling revisited: Making a case for more schedules

FM Ciorba, C Iwainsky, P Buder - Evolving OpenMP for Evolving …, 2018 - Springer
In light of continued advances in loop scheduling, this work revisits the OpenMP loop
scheduling by outlining the current state of the art in loop scheduling and presenting …

[HTML][HTML] An approach for realistically simulating the performance of scientific applications on high performance computing systems

A Mohammed, A Eleliemy, FM Ciorba… - Future Generation …, 2020 - Elsevier
Scientific applications often contain large, computationally-intensive, and irregular parallel
loops or tasks that exhibit stochastic behavior leading to load imbalance. Load imbalance …