Concurrent data structures and memory management are critical components in the design of modern multi-core and parallel computing systems. These fields address the challenge of ensuring safe, ...

The rapid evolution of persistent memory (PM) technologies has spurred a significant shift in how data structures and algorithms are designed and implemented. Persistent memory, offering ...

Memories of all types are facing pressures as demands grow for greater capacity, lower cost, faster speeds, and lower power to handle the onslaught of new data being generated daily. Whether it’s well ...

Seventy years after the invention of a data structure called a hash table, theoreticians have found the most efficient possible configuration for it. About 70 years ago, an engineer at IBM named Hans ...

Glass nanostructures etched using high-intensity femtosecond laser pulses promise to keep vast quantities of data safe for billions of years, describe Peter Kazansky, Ausra Cerkauskaite and Rokas ...

In C++, the choice of data structures and memory management strategies can make or break performance. From cache-friendly struct layouts to picking between arrays and vectors, every decision impacts ...

Even though a computer’s memory map looks pretty smooth and very much byte-addressable at first glance, the same memory on a hardware level is a lot more bumpy. An essential term a developer may come ...

Dr. Bonde Thylstrup is a professor at the University of Copenhagen. A constant hum drones out of a former church in San Francisco. It is the sound, from hundreds of fans cooling hundreds of computer ...

Big data is becoming a big problem. In the face of rising emissions from data centres, researchers are turning to novel solutions for storage. Memory crystals and DNA are two frontrunners. On a visit ...

*Note: This course description is only applicable for the Computer Science Post-Baccalaureate program. Additionally, students must always refer to course syllabus for the most up to date information.