Article-Journal

MoMo - Combining Neuron Morphology and Connectivity for Interactive Motif Analysis in Connectomes
Michael Shewarega, Jakob Troidl, alvaradorodriguez-oliver, dindoost-mohammad, Philipp Harth, Hannah Haberkern, Johannes Stegmaier, admin, Hanspeter Pfister
IEEE Transactions on Visualization and Computer Graphics
June, 2025 IEEE TVCG
Connectomics, a subfield of neuroscience, reconstructs structural and functional brain maps at synapse-level resolution. These complex …
Rocket-Crane Algorithm for the Feedback Arc Set Problem
admin, Justin Ellis-Joyce, Gert-Jan Both, Srinivas C. Turaga, Harinarayan Asoori Sriram, Srijith Chinthalapudi, du-zhihui
Social Networks Analysis and Mining
June, 2025 Springer SNAM
Understanding information flow in the brain can be facilitated by arranging neurons in the fly connectome to form a maximally …
End-to-end resource analysis for quantum interior point methods and portfolio optimization
Alexander M. Dalzell, B. David Clader, Grant Salton, Mario Berta, Cedric Yen-Yu Lin, admin, Nikitas Stamatopoulos, Martin J. A. Schuetz, Fernando G. S. L. Brandão, Helmut G. Katzgraber, William J. Zeng
PRX Quantum: a Physics Review Journal
August, 2023 PRX Quantum
We study quantum interior point methods (QIPMs) for second-order cone programming (SOCP), guided by the example use case of portfolio …
Tunnel: Parallel-inducing sort for large string analytics
du-zhihui, Sen Zhang, admin
Future Generation Computer Systems (Elsevier)
August, 2023 FGCS
The suffix array is a crucial data structure for efficient string analysis. Over the course of twenty-six years, sequential suffix …
A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges
admin, Paul Burkhardt
Journal of Graph Algorithms and Applications
December, 2022 JGAA
Given an undirected, weighted graph, the minimum spanning tree (MST)is a tree that connects all of the vertices of the graph with …
Scalable Katz Ranking Computation in Large Static and Dynamic Graphs
Alexander van der Grinten, Elisabetta Bergamini, green-oded, admin, meyerhenke-henning
ACM Journal on Experimental Algorithmics
March, 2022 ACM JEA
Network analysis defines a number of centrality measures to identify the most central nodes in a network. Fast computation of those …
Anomaly Detection in Catalog Streams
Chen Yang, du-zhihui, Xiaofeng Meng, Xukang Zhang, Xinli Hao, admin
IEEE Transactions on Big Data
March, 2022 IEEE TBDATA
Detecting anomalies with high accuracy and real time from large amounts of streaming data is a challenge for many real-world …
Dynamics signature based anomaly detection
Ivan Hendy Goenawan, du-zhihui, Chao Wu, Yankui Sun, Jianyan Wei, admin
Software: Practice and Experience
November, 2021 Software: Practice and Experience
Identifying anomalies, especially weak anomalies in constantly changing targets, is more difficult than in stable targets. In this …
Linux and Supercomputing: How my passion for building COTS systems led to an HPC revolution
admin
IEEE Annals of the History of Computing
August, 2021 IEEE Annals of the History of Computing
In the 1990s I designed and built the first Linux supercomputer that remains the foundational infrastructure of today’s Linux …
Interactive Graph Stream Analytics in Arkouda
du-zhihui, alvaradorodriguez-oliver, Joseph Patchett, admin
Algorithms
July, 2021 Algorithms
Data from emerging applications, such as cybersecurity and social networking, can be abstracted as graphs whose edges are updated …
Traversing Large Graphs on GPUs with Unified Memory
Prasun Gera, Hyojong Kim, Piyush Sao, Hyesoon Kim, admin
Proceedings of the VLDB Endowment, 13(7):1119-1133, 2020,
March, 2020 Proceedings of the VLDB Endowment, 13(7):1119-1133, 2020,
Due to the limited capacity of GPU memory, the majority of prior work on graph applications on GPUs has been restricted to graphs of …
Editorial from the Editor-in-Chief
admin
ACM Transactions on Parallel Computing TOPC
January, 2019 ACM Transactions on Parallel Computing TOPC
Tailoring parallel alternating criteria search for domain specific MIPs: Application to maritime inventory routing
munguia-lluis, Shabbir Ahmed, admin, George L. Nemhauser, Yufen Shao, Dimitri J. Papageorgiou
Computers & Operations Research
January, 2019 Computers & Operations Research
Parallel Alternating Criteria Search (PACS) relies on the combination of computer parallelism and Large Neighborhood Searches to …
Accelerating GPU betweenness centrality
mclaughlin-adam, admin
Communications of the ACM
January, 2018 Communications of the ACM
Graphs that model social networks, numerical simulations, and the structure of the Internet are enormous and cannot be manually …
Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs
munguia-lluis, Shabbir Ahmed, admin, George L. Nemhauser, Yufen Shao
Computational Optimization and Applications
January, 2018 Computational Optimization and Applications
We present a parallel large neighborhood search framework for finding high quality primal solutions for general mixed-integer programs …
Incrementally updating Katz centrality in dynamic graphs
nathan-eisha, admin
Social Network Analysis and Mining
January, 2018 Social Network Analysis and Mining
A variety of large datasets, such as social networks or biological data, can be represented as graphs. A common query in graph analysis …
Numerically approximating centrality for graph ranking guarantees
nathan-eisha, Geoffrey Sanders, Van Emden Henson, admin
Journal of Computational Science
January, 2018 Journal of Computational Science
Many real-world datasets can be represented as graphs. Using iterative solvers to approximate graph centrality measures allows us to …
A parallel local search framework for the Fixed-Charge Multicommodity Network Flow problem
munguia-lluis, Shabbir Ahmed, admin, George L. Nemhauser, Vikas Goel, Yufen Shao
Computers & Optimization Research
January, 2017 Computers & Optimization Research
We present a parallel local search approach for obtaining high quality solutions to the Fixed Charge Multicommodity Network Flow …
Designing and implementing a heuristic cross-architecture combination for graph traversal
Yang You, Haohuan Fu, admin, Guangwen Yang
Journal of Parallel and Distributed Computing
January, 2017 Journal of Parallel and Distributed Computing
Breadth-First Search (BFS) is widely used in real-world applications including computational biology, social networks, and electronic …
Editor's Note
admin
IEEE Transactions on Parallel and Distributed Systems
January, 2017 IEEE Transactions on Parallel and Distributed Systems
Presents the introductory editorial for this issue of the publication.
Editor's Note
admin
IEEE Transactions on Parallel and Distributed Systems
January, 2017 IEEE Transactions on Parallel and Distributed Systems
Presents the introductory editorial for this issue of the publication.
Exemplar or Matching: Modeling DCJ Problems with Unequal Content Genome Data
yin-zhaoming, Jijun Tang, Stephen W. Schaeffer, admin
CoRR
January, 2017 CoRR
The edit distance under the DCJ model can be computed in linear time for genomes with equal content or with Indels. But it becomes …
Graph Ranking Guarantees for Numerical Approximations to Katz Centrality
nathan-eisha, Geoffrey Sanders, fairbanks-james, Van Emden Henson, admin
Procedia Computer Science
January, 2017 Procedia Computer Science
Graphs and networks are prevalent in modeling relational datasets from many fields of research. By using iterative solvers to …
Local Community Detection in Dynamic Graphs Using Personalized Centrality
nathan-eisha, zakrzewska-anita, E. Jason Riedy, admin
Algorithms
January, 2017 Algorithms
Analyzing massive graphs poses challenges due to the vast amount of data available. Extracting smaller relevant subgraphs allows for …
Modeling the Power Variability of Core Speed Scaling on Homogeneous Multicore Systems
du-zhihui, Rong Ge, Victor W. Lee, Richard W. Vuduc, admin, Ligang He
Scientific Programming
January, 2017 Scientific Programming
We describe a family of power models that can capture the nonuniform power effects of speed scaling among homogeneous cores on …
Spectral partitioning with blends of eigenvectors
James P. Fairbanks, admin, Geoffrey D. Sanders
Journal of Complex Networks
January, 2017 Journal of Complex Networks
Many common methods for data analysis rely on linear algebra. We provide new results connecting data analysis error to numerical …
A New Parallel Method for Binary Black Hole Simulations
Quan Yang, du-zhihui, Zhou-Jian Cao, Jian Tao, admin
Scientific Programming
January, 2016 Scientific Programming
Simulating binary black hole (BBH) systems are a computationally intensive problem and it can lead to great scientific discovery. How …
Editor's Note
admin
IEEE Transactions on Parallel and Distributed Systems
January, 2016 IEEE Transactions on Parallel and Distributed Systems
Welcome to this year's first issue of IEEE Transactions on Parallel and Distributed Systems (TPDS). The author is privileged to serve …
Evolving MPI+X Toward Exascale
admin
IEEE Computer
January, 2016 IEEE Computer
This installment of Computer's series highlighting the work published in IEEE Computer Society journals comes from IEEE Transactions on …
Exemplar or matching: modeling DCJ problems with unequal content genome data
yin-zhaoming, Jijun Tang, Stephen W. Schaeffer, admin
Journal of Combinatorial Optimization
January, 2016 Journal of Combinatorial Optimization
The edit distance under the DCJ model can be computed in linear time for genomes with equal content or with Indels. But it becomes …
HPC node performance and energy modeling with the co-location of applications
Daniel Dauwe, Eric Jonardi, Ryan Friese, Sudeep Pasricha, Anthony A. Maciejewski, admin, Howard Jay Siegel
Journal of Supercomputing
January, 2016 Journal of Supercomputing
Multicore processors have become an integral part of modern large-scale and high-performance parallel and distributed computing …
Tracking local communities in streaming graphs with a dynamic algorithm
zakrzewska-anita, admin
Social Network Analysis and Mining
January, 2016 Social Network Analysis and Mining
A variety of massive datasets, such as social networks and biological data, are represented as graphs that reveal underlying …
Behavioral clusters in dynamic graphs
James P. Fairbanks, Ramakrishnan Kannan, Haesun Park, admin
Parallel Computing
January, 2015 Parallel Computing
This paper contributes a method for combining sparse parallel graph algorithms with dense parallel linear algebra algorithms in order …
Editor's Note
admin
IEEE Transactions on Parallel and Distributed Systems
January, 2015 IEEE Transactions on Parallel and Distributed Systems
Presents the introductory editorial for this issue of the publication
Graphs, Matrices, and the GraphBLAS: Seven Good Reasons
Jeremy Kepner, admin, Aydın Buluç, John Gilbert, Timothy Mattson, meyerhenke-henning
Procedia Computer Science
January, 2015 Procedia Computer Science
The analysis of graphs has become increasingly important to a wide range of applications. Graph analysis presents a number of unique …
Spectral Partitioning with Blends of Eigenvectors
James P. Fairbanks, Geoffrey D. Sanders, admin
CoRR
January, 2015 CoRR
Many common methods for data analysis rely on linear algebra. We provide new results connecting data analysis error to numerical …
State of the Journal
admin
IEEE Transactions on Computers
January, 2015 IEEE Transactions on Computers
Reports on the current state of the IEEE Transactions on Computers.
WEC: Improving Durability of SSD Cache Drives by Caching Write-Efficient Data
Yunpeng Chai, du-zhihui, Xiao Qin, admin
IEEE Transactions on Computers
January, 2015 IEEE Transactions on Computers
Serving as cache disks, flash-based solid-state drives (SSDs) can significantly boost the performance of read-intensive applications. …
Introduction to Special Issue ALENEX'12
admin, Petra Mutzel
ACM Journal of Experimental Algorithmics
January, 2014 ACM Journal of Experimental Algorithmics
Standards for Graph Algorithm Primitives
Tim Mattson, admin, Jonathan W. Berry, Aydin Buluç, Jack J. Dongarra, Christos Faloutsos, John Feo, John R. Gilbert, Joseph Gonzalez, Bruce Hendrickson, Jeremy Kepner, Charles E. Leiserson, Andrew Lumsdaine, David A. Padua, Stephen W. Poole, Steven P. Reinhardt, Mike Stonebraker, Steve Wallach, Andrew Yoo
CoRR
January, 2014 CoRR
It is our view that the state of the art in constructing a large collection of graph algorithms in terms of linear …
State of the Journal
admin
IEEE Transactions on Parallel and Distributed Systems
January, 2014 IEEE Transactions on Parallel and Distributed Systems
I am excited with my new role as incoming Editor-in-Chief (EiC) of IEEE Transactions on Parallel and Distributed Systems (TPDS) and …
A Brief Study of Open Source Graph Databases
Robert McColl, ediger-david, Jason Poovey, Dan Campbell, admin
CoRR
January, 2013 CoRR
With the proliferation of large irregular sparse relational datasets, new storage and analysis platforms have arisen to fill gaps in …
Faster Betweenness Centrality Based on Data Structure Experimentation
green-oded, admin
Procedia Computer Science
January, 2013 Procedia Computer Science
Betweenness centrality is a graph analytic that states the importance of a vertex based on the number of shortest paths that it is on. …
GraphCT: Multithreaded Algorithms for Massive Graph Analysis
ediger-david, Karl Jiang, E. Jason Riedy, admin
IEEE Transactions on Parallel & Distributed Systems
January, 2013 IEEE Transactions on Parallel & Distributed Systems
The digital world has given rise to massive quantities of data that include rich semantic and complex networks. A social graph, for …
Massive streaming data analytics: a graph-based approach
E. Jason Riedy, admin
ACM Crossroads
January, 2013 ACM Crossroads
PASQUAL: Parallel Techniques for Next Generation Genome Sequence Assembly
Xing Liu, Pushkar R. Pande, meyerhenke-henning, admin
IEEE Transactions on Parallel & Distributed Systems
January, 2013 IEEE Transactions on Parallel & Distributed Systems
The study of genomes has been revolutionized by sequencing machines that output many short overlapping substrings (called reads). The …
Streaming Breakpoint Graph Analytics for Accelerating and Parallelizing the Computation of DCJ Median of Three Genomes
yin-zhaoming, Jijun Tang, Stephen W. Schaeffer, admin
Procedia Computer Science
January, 2013 Procedia Computer Science
The problem of finding the median of three genomes is the key process in building the most parsimonious phylogenetic trees from genome …
Sustainable Software Development for Next-Gen Sequencing (NGS) Bioinformatics on Emerging Platforms
Shel Swenson, Yogesh Simmhan, Viktor K. Prasanna, Manish Parashar, E. Jason Riedy, admin, Richard W. Vuduc
CoRR
January, 2013 CoRR
DNA sequence analysis is fundamental to life science research. The rapid development of next generation sequencing (NGS) technologies, …
ACM journal on experimental algorithmics special issue on multicore algorithms
admin, Philippas Tsigas
ACM Journal of Experimental Algorithmics
January, 2012 ACM Journal of Experimental Algorithmics
The recent switch to multicore processors brought a dramatic change that affects a large spectrum of systems from embedded and …
Efficient Data Migration to Conserve Energy in Streaming Media Storage Systems
Yunpeng Chai, du-zhihui, admin, Xiao Qin
IEEE Transactions on Parallel & Distributed Systems
January, 2012 IEEE Transactions on Parallel & Distributed Systems
Reducing energy consumption has been an important design issue for large-scale streaming media storage systems. Existing energy …
GTfold: Enabling parallel RNA secondary structure prediction on multi-core desktops
M. Shel Swenson, Joshua Anderson, Andrew Ash, Prashant Gaurav, Zsuzsanna Sükösd, admin, Stephen C. Harvey, Christine E. Heitsch
BMC Research Notes
January, 2012 BMC Research Notes
Background Accurate and efficient RNA secondary structure prediction remains an important open problem in computational molecular …
Rec-DCM-Eigen: Reconstructing a Less Parsimonious but More Accurate Tree in Shorter Time
kang-seunghwa, Jijun Tang, Stephen W. Schaeffer, admin
PLOS ONE
August, 2011 PLOS ONE
Maximum parsimony (MP) methods aim to reconstruct the phylogeny of extant species by finding the most parsimonious evolutionary …
Algorithm Engineering Challenges in Multicore and Manycore Systems
kang-seunghwa, ediger-david, admin
it - Information Technology
January, 2011 it - Information Technology
Modern multicore and manycore systems have the strong potential to deliver both high performance and high power efficiency. The large …
GPUMemSort: A High Performance Graphic Co-processors Sorting Algorithm for Large Scale In-Memory Data
Yin Ye, du-zhihui, admin
GSTF International Journal on Computing
January, 2011 GSTF International Journal on Computing
In this paper, we present a GPU-based sorting algorithm, GPUMemSort, which achieves high performance in sorting large-scale in-memory …
Guest Editor's Introduction: Special Issue on High-Performance Computing with Accelerators
admin, David R. Kaeli, Volodymyr V. Kindratenko
IEEE Transactions on Parallel and Distributed Systems
January, 2011 IEEE Transactions on Parallel and Distributed Systems
The 12 papers in this special issue on high-performance computing with accelerators discuss a range of different accelerator …
On the random access performance of Cell Broadband Engine with graph analysis application
Mingyu Chen, admin
CoRR
January, 2011 CoRR
The Cell Broad Engine (BE) Processor has unique memory access architecture besides its powerful computing engines. Many …
Computing discrete transforms on the Cell Broadband Engine
admin, agarwal-virat, kang-seunghwa
Parallel Computing
January, 2009 Parallel Computing
Discrete transforms are of primary importance and fundamental kernels in many computationally intensive scientific applications. In …
Faster FAST: multicore acceleration of streaming financial data
agarwal-virat, admin, Lin Dan, Lurng-Kuo Liu, Davide Pasetto, Michael Perrone, Fabrizio Petrini
Computer Science - Research and Development
January, 2009 Computer Science - Research and Development
By 2010, the global options and equity markets will average over 128 billion messages per day, amounting to trillions of dollars in …
A graph-theoretic analysis of the human protein-interaction network using multicore parallel algorithms
admin, madduri-kamesh
Parallel Computing
January, 2008 Parallel Computing
Due to fundamental physical limitations and power constraints, we are witnessing a paradigm shift in commodity microprocessor …
Guest editorial: High-performance computational biology
admin, Srinivas Aluru
Parallel Computing
January, 2008 Parallel Computing
Dynamic Load Balancing in Distributed Systems in the Presence of Delays: A Regeneration-Theory Approach
Sagar Dhakal, Majeed M. Hayat, Jorge E. Pezoa, Cundong Yang, admin
IEEE Transactions on Parallel & Distributed Systems
January, 2007 IEEE Transactions on Parallel & Distributed Systems
A regeneration-theory approach is undertaken to analytically characterize the average overall completion time in a distributed system. …
High performance combinatorial algorithm design on the Cell Broadband Engine processor
admin, agarwal-virat, madduri-kamesh, kang-seunghwa
Parallel Computing
January, 2007 Parallel Computing
The Sony–Toshiba–IBM Cell Broadband Engine (Cell/B.E.) is a heterogeneous multicore architecture that consists of a traditional …
On the design of high-performance algorithms for aligning multiple protein sequences on mesh-based multiprocessor architectures
Diana H. P. Low, Bharadwaj Veeravalli, admin
Journal of Parallel and Distributed Computing
January, 2007 Journal of Parallel and Distributed Computing
In this paper, we address the problem of multiple sequence alignment (MSA) for handling very large number of proteins sequences on …
Computational Grand Challenges in Assembling the Tree of Life: Problems and Solutions
admin, Usman Roshan, Alexandros Stamatakis
Advances in Computers
January, 2006 Advances in Computers
The computation of ever larger as well as more accurate phylogenetic (evolutionary) trees with the ultimate goal to compute the tree of …
Designing irregular parallel algorithms with mutual exclusion and lock-free protocols
cong-guojing, admin
Journal of Parallel and Distributed Computing
January, 2006 Journal of Parallel and Distributed Computing
Irregular parallel algorithms pose a significant challenge for achieving high performance because of the difficulty predicting memory …
Designing Scalable Synthetic Compact Applications for Benchmarking High Productivity Computing Systems
D. A. Bader, K. Madduri, J. R. Gilbert, V. Shah, J. Kepner, T. Meuse, A. Krishnamurthy
CTWatch Quarterly
January, 2006 CTWatch Quarterly
One of the main objectives of the DARPA High Productivity Computing Systems (HPCS) program is to reassess the way we define and measure …
Editorial: Special Section on High-Performance Computational Biology
Srinivas Aluru, Nancy M. Amato, admin
IEEE Transactions on Parallel and Distributed Systems
January, 2006 IEEE Transactions on Parallel and Distributed Systems
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
admin, cong-guojing
Journal of Parallel and Distributed Computing
January, 2006 Journal of Parallel and Distributed Computing
Minimum spanning tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless …
A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs)
admin, cong-guojing
Journal of Parallel and Distributed Computing
January, 2005 Journal of Parallel and Distributed Computing
The ability to provide uniform shared-memory access to a significant number of processors in a single SMP node brings us much closer to …
A Framework for Measuring Supercomputer Productivity
Marc Snir, admin
International Journal of High Performance Computing Applications
January, 2004 International Journal of High Performance Computing Applications
We propose a framework for measuring the productivity of high performance computing (HPC) systems, based on common economic definitions …
An improved, randomized algorithm for parallel selection with an experimental study
admin
Journal of Parallel and Distributed Computing
January, 2004 Journal of Parallel and Distributed Computing
A common statistical problem is that of finding the median element in a set of data. This paper presents an efficient randomized …
Computational biology and high-performance computing
admin
Communications of the ACM
January, 2004 Communications of the ACM
Understanding evolution and the basic structure and function of proteins are two grand challenge problems in biology that can be solved …
Special Issue: High Performance Computational Biology
admin, Srinivas Aluru
Concurrency and Computation: Practice and Experience
January, 2004 Concurrency and Computation: Practice and Experience
Guest Editor's Introduction: Special issue on high-performance computational biology
Srinivas Aluru, admin
Journal of Parallel and Distributed Computing
January, 2003 Journal of Parallel and Distributed Computing
Srinivas Aluru is an associate professor and Associate Chair for Graduate Education in the Department of Electrical and Computer …
Generalized block shift network for clusters
sun-yuzhong, Xiaola Lin, Yi Pan, R. W. H. Lau, D. A. Bader, P. Y. S. Cheung
IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications
April, 2002 IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications
In this work, a generalized topology of block shift networks (BSNs), named generalized block shift network (GBSN), is propose or …
High-Performance Algorithm Engineering for Computational Phylogenetics
Bernard M. E. Moret, admin, Tandy J. Warnow
The Journal of Supercomputing
January, 2002 The Journal of Supercomputing
A phylogeny is the evolutionary history of a group of organisms; systematists (and other biologists) attempt to reconstruct this …
A Linear-Time Algorithm for Computing Inversion Distance Between Two Signed Permutations with an Experimental Study
admin, Bernard M. E. Moret, yan-mi
Journal of Computational Biology
January, 2001 Journal of Computational Biology
Hannenhalli and Pevzner gave the first polynomial-time algorithm for computing the inversion distance between two signed permutations, …
Applications
admin, Rob Pennington
IJHPCA
January, 2001 IJHPCA
High performance computing algorithms for land cover dynamics using remote sensing data
Satya Kalluri, Joseph JaJa, admin, John Townshend, Joseph Jájá, Hassan Fallahadl, Zengyan Zhang, Hassan Fallah-adl
International Journal of Remote Sensing
January, 2000 International Journal of Remote Sensing
Global and regional land cover studies need to apply complex models on selected subsets of large volumes of multi-sensor and …
Kronos: A software system for the processing and retrieval of large-scale AVHRR data sets
Zengyan Zhang, Joseph F. JaJa, admin, Satya N. V. Kalluri, Huiping Song, Nazmi El Saleous, Eric Vermote, John R. G. Townshend
PE & RS - Photogrammetric Engineering and Remote Sensing
January, 2000 PE & RS - Photogrammetric Engineering and Remote Sensing
Raw remotely sensed satellite data have to be processed andmapped into a standard projection in order to produce a multi-temporal data …
A New, Architectural Paradigm for High-performance Computing
admin
Scalable Computing: Practice and Experience
January, 1999 Scalable Computing: Practice and Experience
At first thought, one may not realize the need for a special issue of Parallel and Distributed Computing Practices focused on Cluster …
SIMPLE: A Methodology for Programming High Performance Algorithms on Clusters of Symmetric Multiprocessors (SMPs)
admin, Joseph JáJá
Journal of Parallel and Distributed Computing
January, 1999 Journal of Parallel and Distributed Computing
We describe a methodology for developing high performance programs running on clusters of SMP nodes. The SMP cluster programming …
A New Deterministic Parallel Sorting Algorithm with an Experimental Evaluation
David R. Helman, Joseph JáJá, admin
ACM Journal of Experimental Algorithmics
January, 1998 ACM Journal of Experimental Algorithmics
We introduce a new deterministic parallel sorting algorithm for distributed memory machines based on the regular sampling approach. The …
A Randomized Parallel Sorting Algorithm with an Experimental Study
David R. Helman, admin, Joseph JáJá
Journal of Parallel and Distributed Computing
January, 1998 Journal of Parallel and Distributed Computing
Previous schemes for sorting on general-purpose parallel machines have had to choose between poor load balancing and irregular …
Parallel algorithms for image enhancement and segmentation by region growing, with an experimental study
admin, Joseph JáJá, David Harwood, Larry S. Davis
The Journal of Supercomputing
January, 1996 The Journal of Supercomputing
This paper presents efficient and portable implementations of a powerful image enhancement process, the Symmetric Neighborhood Filter …
Parallel Algorithms for Image Histogramming and Connected Components with an Experimental Study
admin, Joseph JáJá
Journal of Parallel and Distributed Computing
January, 1996 Journal of Parallel and Distributed Computing
This paper presents efficient and portable implementations of two useful primitives in image processing algorithms, histogramming and …
Practical Parallel Algorithms for Personalized Communication and Integer Sorting
admin, David R. Helman, Joseph JáJá
ACM Journal of Experimental Algorithmics
January, 1996 ACM Journal of Experimental Algorithmics
A fundamental challenge for parallel computing is to obtain high-level, architecture independent, algorithms which efficiently execute …
Scalable data parallel algorithms for texture synthesis using Gibbs random fields
admin, Joseph JáJá, Rama Chellappa
IEEE Transactions on Image Processing
January, 1995 IEEE Transactions on Image Processing
This article introduces scalable data parallel algorithms for image processing. Focusing on Gibbs and Markov random field model …