Skip to main content

Discovering ORCID.org and Revisiting My ( Darrell Ulm )Research in Parallel Processing and Associative Computing

ORCid.org is a research publication database (mine: Darrell Ulm) 

I recently came across ORCID.org, a platform that\helps researchers organize and present their scholarly work in a structured and reliable way. It surprised me that I had not used it earlier because it offers a level of control and clarity that is incredibly useful when managing decades of publications. As I began adding my research history, I found myself reflecting on the themes that have shaped my work in parallel processing, associative computing, and algorithmic problem solving. It felt a bit like rediscovering old tools in a workshop that I somehow forgot I built.

A Look Back at My Research Contributions

Much of my work has focused on high performance computing, data parallelism, and innovative approaches to classic optimization problems. ORCID gave me a chance to revisit these contributions and understand how they fit together across time.

Parallel and Distributed Processing

Several of my publications appeared in the International Parallel and Distributed Processing Symposium. These works explored new ways to model and simulate parallel computation.

  • Stream PRAM Presented at the 19th International Parallel and Distributed Processing Symposium (IPDPS 2005). This work examined a streaming approach to the Parallel Random Access Machine model and how it can be adapted for modern architectures.

  • Solving a 2D Knapsack Problem Using a Hybrid Data Parallel and Control Style of Computing Presented at IPDPS 2004. This research combined data parallelism with control driven techniques to tackle a complex two dimensional knapsack optimization problem.

Distributed Systems and Global Knowledge

  • World Wide Wisdom Published in IEEE Distributed Systems Online in 2004. This article explored early ideas about distributed knowledge systems and how global information sharing could reshape computing. Looking back, it feels like a precursor to many of the collaborative systems we take for granted today. It's just a book review and I reviewed it because it seemed like an important book.

Associative Computing and Simulation Models

My earlier work focused heavily on associative computing models and how they could simulate or enhance traditional parallel architectures.

  • Simulating PRAM with a MSIMD Model (ASC) Presented at the 1998 International Conference on Parallel Processing. This paper demonstrated how a Multiple Single Instruction Multiple Data model could simulate PRAM behavior with efficiency and scalability.

  • Solving a 2D Knapsack Problem on an Associative Computer Augmented with a Linear Network Presented at PDPTA 1996. This work extended associative computing techniques by integrating a linear network to improve communication and problem solving performance.

  • Virtual Parallelism by Self Simulation of the Multiple Instruction Stream Associate Model Also presented at PDPTA 1996. This research introduced a method for achieving virtual parallelism through self simulation, allowing complex instruction streams to be executed more efficiently.

Mesh and SIMD Based Optimization

Some of my earliest work focused on solving optimization problems on mesh and SIMD architectures.

  • Solving a Two Dimensional Knapsack Problem on a Mesh with Multiple Buses Presented at the 1995 International Conference on Parallel Processing. This paper explored how mesh based systems with multiple communication buses could accelerate knapsack computations.

  • Solving a Two Dimensional Knapsack Problem on SIMD Computers Presented at the 1992 International Conference on Parallel Processing. This was one of my foundational works, showing how SIMD architectures could be used to solve complex optimization problems that traditionally required more flexible computing models.

Why ORCID Matters for Researchers

Organizing all of these publications in one place reminded me how valuable it is to have a persistent and authoritative record of scholarly work. ORCID makes it easier to present research clearly, connect publications to identifiers like DOIs, and maintain a consistent academic identity across platforms. It also helps highlight the evolution of a research career, something that is easy to lose track of when your work spans many years and many conferences.

As I continue refining my ORCID profile, I am finding it to be a surprisingly helpful tool. It brings structure to a long timeline of ideas, experiments, and problem solving approaches. Maybe I should have used it earlier, but better late than never. My brain probably just took a small detour somewhere along the way.


Labels:

Popular posts from this blog

Apache Spark Knapsack Approximation Algorithm in Python

The code shown below computes an approximation algorithm, greedy heuristic, for the 0-1 knapsack problem in Apache Spark. Having worked with parallel dynamic programming algorithms a good amount, wanted to see what this would look like in Spark. The Github code repo. for the Knapsack approximation algorithms is here , and it includes a Scala solution. The work on a Java version is in progress at time of this writing. Below we have the code that computes the solution that fits within the knapsack W for a set of items each with it's own weight and profit value. We look to maximize the final sum of selected items profits while not exceeding the total possible weight, W. First we import some spark libraries into Python. # Knapsack 0-1 function weights, values and size-capacity. from pyspark.sql import SparkSession from pyspark.sql.functions import lit from pyspark.sql.functions import col from pyspark.sql.functions import sum Now define the function, which will take a Spark ...
Read more