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, ...

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 ...

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 ...

Most people are familiar with data in the form of a spreadsheet, with labeled columns of different data types such as name, address, age, and so on. Databases work the same way, with each table laid ...

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 ...

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 ...

RAM consists of a grid of memory cells, each capable of storing a small amount of data, typically one bit (binary digit) or a few bits. These cells are organized into rows and columns, forming a ...

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 ...