Evaluating persistent memory range indexes von Lersch, Lucas, Hao, Xiangpeng, Oukid, Ismail, Wang, Tianzheng, Willhalm, Thomas

Volltext

Memory management techniques for large-scale persistent-main-memory systems von Oukid, Ismail, Booss, Daniel, Lespinasse, Adrien, Lehner, Wolfgang, Willhalm, Thomas, Gomes, Grégoire

Volltext

An Examination of CXL Memory Use Cases for In-Memory Database Management Systems Using SAP HANA von Ahn, Minseon, Willhalm, Thomas, May, Norman, Lee, Donghun, Desai, Suprasad Mutalik, Booss, Daniel, Kim, Jungmin, Singh, Navneet, Ritter, Daniel, Rebholz, Oliver

Volltext

SIMD-scan: ultra fast in-memory table scan using on-chip vector processing units von Willhalm, Thomas, Popovici, Nicolae, Boshmaf, Yazan, Plattner, Hasso, Zeier, Alexander, Schaffner, Jan

Volltext

Efficient compute node-local replication mechanisms for NVRAM-centric data structures von Zarubin, Mikhail, Kissinger, Thomas, Habich, Dirk, Willhalm, Thomas, Lehner, Wolfgang

Volltext

SAP HANA adoption of non-volatile memory von Andrei, Mihnea, Lemke, Christian, Radestock, Günter, Schulze, Robert, Thiel, Carsten, Blanco, Rolando, Meghlan, Akanksha, Sharique, Muhammad, Seifert, Sebastian, Vishnoi, Surendra, Booss, Daniel, Peh, Thomas, Schreter, Ivan, Thesing, Werner, Wagle, Mehul, Willhalm, Thomas

Volltext

Combining Speed-Up Techniques for Shortest-Path Computations von Holzer, Martin, Schulz, Frank, Willhalm, Thomas

Volltext

Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse Graphs von Wagner, Dorothea, Willhalm, Thomas

Volltext

Partitioning graphs to speedup Dijkstra's algorithm von Möhring, Rolf H., Schilling, Heiko, Schütz, Birk, Wagner, Dorothea, Willhalm, Thomas

Volltext

Geometric containers for efficient shortest-path computation von Wagner, Dorothea, Willhalm, Thomas, Zaroliagis, Christos

Volltext

Speed-Up Techniques for Shortest-Path Computations von Wagner, Dorothea, Willhalm, Thomas

Volltext

Geometric travel planning von Edelkamp, S., Jabbar, S., Willhalm, T.

Volltext

SPECULATIVE EXECUTION TAG FOR ASYNCHRONOUS DRAM REFRESH von WILLHALM, Thomas, KUMAR, Karthik

Volltext bestellen

Combining speed-up techniques for shortest-path computations von Holzer, Martin, Schulz, Frank, Wagner, Dorothea, Willhalm, Thomas

Volltext

Techniques for prefetching data to a first level of memory of a hierarchical arrangement of memory von Willhalm, Thomas, Klemm, Michael

Volltext bestellen

Partitioning Graphs to Speed Up Dijkstra’s Algorithm von Möhring, Rolf H., Schilling, Heiko, Schütz, Birk, Wagner, Dorothea, Willhalm, Thomas

Volltext

Platform ambient data management schemes for tiered architectures von Willhalm, Thomas, Kumar, Karthik, Guim Bernat, Francesc

Volltext bestellen

CXL Memory as Persistent Memory for Disaggregated HPC: A Practical Approach von Fridman, Yehonatan, Desai, Suprasad Mutalik, Singh, Navneet, Willhalm, Thomas, Oren, Gal

Volltext bestellen

Instructions to mark beginning and end of non transactional code region requiring write back to persistent storage von Willhalm Thomas

Volltext bestellen

INSTRUCTIONS TO MARK BEGINNING AND END OF NON TRANSACTIONAL CODE REGION REQUIRING WRITE BACK TO PERSISTENT STORAGE von WILLHALM THOMAS

Volltext bestellen