Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Merge pull request #243 from LLNL/release/v0.22
Release/v0.22
- Loading branch information
Showing
24 changed files
with
560 additions
and
243 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -1,4 +1,5 @@ | ||
| add_subdirectory(simple_alloc) | ||
| add_subdirectory(adjacency_list) | ||
| add_subdirectory(bfs) | ||
| add_subdirectory(rand_engine) | ||
| add_subdirectory(rand_engine) | ||
| add_subdirectory(mapping) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1 @@ | ||
| add_metall_executable(run_mapping_bench run_mapping_bench.cpp) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,206 @@ | ||
| #include <iostream> | ||
| #include <random> | ||
| #include <string> | ||
| #include <map> | ||
| #include <vector> | ||
| #include <metall/metall.hpp> | ||
| #include <metall/utility/random.hpp> | ||
| #include <metall/detail/time.hpp> | ||
| #include <metall/detail/mmap.hpp> | ||
|
|
||
| using rand_engine = metall::utility::rand_512; | ||
| static constexpr std::size_t k_page_size = 4096; | ||
|
|
||
| namespace { | ||
| namespace mdtl = metall::mtlldetail; | ||
| } | ||
|
|
||
| auto random_write_by_page(const std::size_t size, unsigned char *const map) { | ||
| const auto num_pages = size / k_page_size; | ||
| rand_engine rand_engine(123); | ||
| std::uniform_int_distribution<> dist(0, num_pages - 1); | ||
|
|
||
| const auto s = mdtl::elapsed_time_sec(); | ||
| for (std::size_t i = 0; i < num_pages; ++i) { | ||
| const auto page_no = dist(rand_engine); | ||
| const off_t offset = static_cast<off_t>(page_no * k_page_size); | ||
| map[offset] = '0'; | ||
| } | ||
| const auto t = mdtl::elapsed_time_sec(s); | ||
|
|
||
| return t; | ||
| } | ||
|
|
||
| auto random_read_by_page(const std::size_t size, const unsigned char *const map) { | ||
| const auto num_pages = size / k_page_size; | ||
| rand_engine rand_engine(1234); | ||
| std::uniform_int_distribution<> dist(0, num_pages - 1); | ||
|
|
||
| const auto s = mdtl::elapsed_time_sec(); | ||
| for (std::size_t i = 0; i < num_pages; ++i) { | ||
| const auto page_no = dist(rand_engine); | ||
| const off_t offset = static_cast<off_t>(page_no * k_page_size); | ||
| [[maybe_unused]] volatile char dummy = map[offset]; | ||
| } | ||
| const auto t = mdtl::elapsed_time_sec(s); | ||
|
|
||
| return t; | ||
| } | ||
|
|
||
| int create_normal_file(std::string_view path) { | ||
| const int fd = ::open(path.data(), O_RDWR | O_CREAT | O_TRUNC, S_IRUSR | S_IWUSR); | ||
| if (fd == -1) { | ||
| std::cerr << "Failed to create a file" << std::endl; | ||
| std::abort(); | ||
| } | ||
| return fd; | ||
| } | ||
|
|
||
| int create_tmpfile(std::string_view path) { | ||
| static char file_template[] = "/mmap.XXXXXX"; | ||
|
|
||
| char fullname[path.size() + sizeof(file_template)]; | ||
| (void)strcpy(fullname, path.data()); | ||
| (void)strcat(fullname, file_template); | ||
|
|
||
| int fd = -1; | ||
| if ((fd = mkstemp(fullname)) < 0) { | ||
| std::perror("Could not create temporary file"); | ||
| std::abort(); | ||
| } | ||
|
|
||
| (void)unlink(fullname); | ||
|
|
||
| return fd; | ||
| } | ||
|
|
||
| void extend_file(const int fd, const std::size_t size, const bool fill_with_zero) { | ||
| if (!mdtl::extend_file_size(fd, size, fill_with_zero)) { | ||
| std::cerr << "Failed to extend file" << std::endl; | ||
| std::abort(); | ||
| } | ||
| } | ||
|
|
||
| auto map_file(const int fd, const std::size_t size) { | ||
| static constexpr int k_map_nosync = | ||
| #ifdef MAP_NOSYNC | ||
| MAP_NOSYNC; | ||
| #else | ||
| 0; | ||
| #warning "MAP_NOSYNC is not defined" | ||
| #endif | ||
|
|
||
| auto *const map = mdtl::os_mmap(NULL, size, PROT_READ | PROT_WRITE, MAP_SHARED | k_map_nosync, fd, 0); | ||
| if (!map) { | ||
| std::cerr << " Failed mapping" << std::endl; | ||
| std::abort(); | ||
| } | ||
|
|
||
| return map; | ||
| } | ||
|
|
||
| void close_file(const int fd) { | ||
| if (!mdtl::os_close(fd)) { | ||
| std::cerr << __LINE__ << " Failed to close file" << std::endl; | ||
| std::abort(); | ||
| } | ||
| } | ||
|
|
||
| void unmap(void *const addr, const std::size_t size) { | ||
| if (!mdtl::munmap(addr, size, false)) { | ||
| std::cerr << __LINE__ << " Failed to munmap" << std::endl; | ||
| std::abort(); | ||
| } | ||
| } | ||
|
|
||
| /// \brief Run benchmark to evaluate different mapping methods | ||
| void run_bench_one_time(std::string_view dir_path, | ||
| const std::size_t length, | ||
| const bool init_file_writing_zero, | ||
| std::map<std::string, std::vector<double>> &time_table) { | ||
|
|
||
| const auto bench_core = [&time_table, length](std::string_view mode, unsigned char *const map) { | ||
| time_table[std::string(mode) + " write"].push_back(random_write_by_page(length, map)); | ||
| time_table[std::string(mode) + " read"].push_back(random_read_by_page(length, map)); | ||
| }; | ||
|
|
||
| // Use 'new' | ||
| { | ||
| auto *const map = new unsigned char[length]; | ||
| bench_core("malloc", map); | ||
| delete[] map; | ||
| } | ||
|
|
||
| // Use a normal file and mmap | ||
| { | ||
| std::string file_path{std::string(dir_path) + "/map-file"}; | ||
| const int fd = create_normal_file(file_path); | ||
| extend_file(fd, length, init_file_writing_zero); | ||
| auto *const map = static_cast<unsigned char *>(map_file(fd, length)); | ||
| close_file(fd); | ||
| bench_core("Normal-file", map); | ||
| unmap(map, length); | ||
| } | ||
|
|
||
| // Use tmpfile and mmap | ||
| { | ||
| const int fd = create_tmpfile(dir_path); | ||
| extend_file(fd, length, init_file_writing_zero); | ||
| auto *const map = static_cast<unsigned char *>(map_file(fd, length)); | ||
| close_file(fd); | ||
| bench_core("tmpfile", map); | ||
| unmap(map, length); | ||
| } | ||
|
|
||
| // Use Metall | ||
| { | ||
| metall::manager manager(metall::create_only, dir_path.data()); | ||
| auto *map = static_cast<unsigned char *>(manager.allocate(length)); | ||
| bench_core("Metall", map); | ||
| manager.deallocate(map); | ||
| } | ||
| metall::manager::remove(dir_path.data()); | ||
|
|
||
| } | ||
|
|
||
| void run_bench(std::string_view dir_path, | ||
| const std::size_t num_repeats, | ||
| const std::size_t length, | ||
| const bool init_file_writing_zero) { | ||
| std::cout << "\n----------" << std::endl; | ||
| std::cout << "Directory Path:\t" << dir_path | ||
| << "\nRepeats:\t" << num_repeats | ||
| << "\nLength:\t" << length | ||
| << "\nInit w/ writing:\t" << init_file_writing_zero | ||
| << "\n" << std::endl; | ||
|
|
||
| // Run bench | ||
| std::map<std::string, std::vector<double>> time_table; | ||
| for (std::size_t i = 0; i < num_repeats; ++i) { | ||
| run_bench_one_time(dir_path, length, init_file_writing_zero, time_table); | ||
| } | ||
|
|
||
| // Show results | ||
| for (const auto &entry: time_table) { | ||
| const auto &mode = entry.first; | ||
| const auto × = entry.second; | ||
| std::cout << std::fixed; | ||
| std::cout << std::setprecision(2); | ||
| std::cout << mode << " took (s)\t" | ||
| << std::accumulate(times.begin(), times.end(), 0.0f) / times.size() << std::endl; | ||
| } | ||
| } | ||
|
|
||
| int main() { | ||
| static constexpr std::size_t size = k_page_size * 1024 * 10; | ||
| const int num_repeats = 10; | ||
|
|
||
| #if defined(__linux__) | ||
| run_bench("/dev/shm", num_repeats, size, false); | ||
| run_bench("/dev/shm", num_repeats, size, true); | ||
| #endif | ||
| run_bench("/tmp", num_repeats, size, false); | ||
| run_bench("/tmp", num_repeats, size, true); | ||
|
|
||
| return 0; | ||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -1,17 +1,26 @@ | ||
| # Publication | ||
|
|
||
| ## Metall: A Persistent Memory Allocator Enabling Graph Processing | ||
| ## Metall: A persistent memory allocator for data-centric analytics | ||
|
|
||
| ``` | ||
| Keita Iwabuchi, Karim Youssef, Kaushik Velusamy, Maya Gokhale, Roger Pearce, | ||
| Metall: A persistent memory allocator for data-centric analytics, | ||
| Parallel Computing, 2022, 102905, ISSN 0167-8191, https://doi.org/10.1016/j.parco.2022.102905. | ||
| ``` | ||
|
|
||
| - [Parallel Computing](https://www.sciencedirect.com/science/article/abs/pii/S0167819122000114) (journal) | ||
|
|
||
| [Available PDF](https://www.osti.gov/servlets/purl/1576900) | ||
| - [arXiv](https://arxiv.org/abs/2108.07223) (preprint) | ||
|
|
||
| ## Metall: A Persistent Memory Allocator Enabling Graph Processing | ||
|
|
||
| A page in IEEE Xplore is [here](https://ieeexplore.ieee.org/document/8945094) | ||
| ```text | ||
| @INPROCEEDINGS{8945094, | ||
| author={K. {Iwabuchi} and L. {Lebanoff} and M. {Gokhale} and R. {Pearce}}, | ||
| booktitle={2019 IEEE/ACM 9th Workshop on Irregular Applications: Architectures and Algorithms (IA3)}, | ||
| title={Metall: A Persistent Memory Allocator Enabling Graph Processing}, | ||
| year={2019}, | ||
| pages={39-44}, | ||
| doi={10.1109/IA349570.2019.00012}, | ||
| month={Nov},} | ||
| K. Iwabuchi, L. Lebanoff, M. Gokhale and R. Pearce, | ||
| "Metall: A Persistent Memory Allocator Enabling Graph Processing," | ||
| 2019 IEEE/ACM 9th Workshop on Irregular Applications: Architectures and Algorithms (IA3), 2019, | ||
| pp. 39-44, doi: 10.1109/IA349570.2019.00012. | ||
| ``` | ||
|
|
||
| - [Available PDF](https://www.osti.gov/servlets/purl/1576900) | ||
|
|
||
| - A page in IEEE Xplore is [here](https://ieeexplore.ieee.org/document/8945094) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.