IEEE/ACM SC26 Aggregate.Org

This is the home page for our 33rd major research exhibit at the IEEE/ACM Supercomputing conference. The exhibit is under the title University of Kentucky, reflecting the fact that it is now officially led by the Center for Computational Sciences and inclusive of many groups at the university. Of course, the informal research consortium Aggregate.Org, led by our KAOS (Compilers, Hardware Architectures, and Operating Systems) group here at the University of Kentucky's Department of Electrical and Computer Engineering, still has various materials in the booth. We are booth #5637, a 10x20 booth, in the Quantum Junction on the right side of the exhibits floorplan.

Booth Staff

The University of Kentucky exhibit is staffed by a number of people. A group photo will eventually be here...

QERKY.ORG Stuff

QERKY.ORG began as a spin-off from Aggregate.Org back in 2019. Until recently, it has been very low key, mostly trying to establish connections between quantum computing researchers in the Commonwealth of Kentucky. It has had some success in that. Now we are trying to broaden the reach and put a bit more emphasis on education...

This year, a lot of what we will be presenting in the University of Kentucky exhibit is about advancing Quantum Education & Research Research in KentuckY. HTTP://QERKY.ORG: Quantum Education & Research in KentuckY briefly overviews what we are trying to accomplish. Toward that, we have produced a variety of open source physical devices to help educate folks about quantum computing. All of them happen to leverage 3D printing:

Aggregate.Org Research

We are the group that built the world's first Linux PC cluster supercomputer ack in February 1994, and we still focus on systems research integrating compiler, OS, and hardware architecture technologies to make computers that are more capable and more efficient. While cost used to be the primary efficiency metric, and we have set many records and been recognized by Gordon Bell and Computerworld Smithsonian awards for our achievements in that dimension, since 2017 our main focus has been on reducing power consumed per unit computation performed.

Parallel Bit Pattern computing (PBP) is a new model of computation that has the potential to reduce power per computation by orders of magnitude by minimizing the number of active gate operations required. The key idea is to use various forms of symbolic execution to reduce power consumption, and execution time, by minimizing the number of gate-level operations required to perform a computation. Aggressive compiler-like optimization is performed on bit-level representations of values at runtime. For example, instead of using something like a carry lookahead 32-bit adder to add one to a counter that goes from 0 to 100, PBP would implement the gate-level operations of a 7-bit incrementer. Thus, ideal PBP hardware looks a lot like some of the older massively-parallel SIMD supercomputers that used bit-serial processing elements. However, PBP is a quantum-inspired model, and it also gets an exponential reduction in both storage cost and number of gate operations required -- without using any quantum phenomena.

In PBP, superposition and E-way entanglement are modeled by treating the value of a pbit (pattern bit) as an ordered set of 2E bits. These ordered bit sets generally have very low entropy, so we take advantage of that to store and operate directly on a compressed representation. Not only does this allow efficient execution of quantum-like execution, but it also dramatically increases efficiency of SIMD code. Think of it this way: GPUs get speedup over traditional SIMDs in that if an entire warp of PEs is disabled, it can skip evaluation for that set of PEs. PBP not only shares that property, but also has the ability to skip recomputation for any warp of bit-level value computations that has been done before by any warp of PEs. Thus, PBP offers both quantum-like computing without quantum pehenomena and more efficient massively-parallel SIMD computation.

Our exhibit this year will feature KES (Kentucky Entangled Superposition), a six pbit system that implements entangled superposition using 8-bit chunk PBP and directly displays how that works. The 64 LED lights beneath each Q-bit light with colors showing how that chunk was computed:

Only the Red computations did not achieve an exponential reduction in the number of gate activations needed to perform the computation.

Aggregate.Org SC26 White Papers

There are three single-side, single-page white papers overviewing our ongoing work on PBP:

Aggregate.Org PBP-Related Publications and Presentations

PBP C++ Library

At this time, the C++ library implementation is temporarily frozen as we implement the major modifications to the execution model. The source code and other materials are available under CC BY 4.0 from the PBP project homepage.

More

Are website updates ever done?


The Aggregate. The only thing set in stone is our name.