This page (revision-136) was last changed on 24-Nov-2020 16:59 by kmrdev

This page was created on 09-Mar-2018 02:16 by UnknownAuthor

Only authorized users are allowed to rename pages.

Only authorized users are allowed to delete pages.

Page revision history

Version Date Modified Size Author Changes ... Change note
136 24-Nov-2020 16:59 2 KB kmrdev to previous
135 24-Nov-2020 16:58 2 KB kmrdev to previous | to last
134 24-Nov-2020 16:55 2 KB kmrdev to previous | to last
133 19-Mar-2020 23:30 2 KB kmrdev to previous | to last
132 19-Mar-2020 23:29 2 KB kmrdev to previous | to last
131 19-Mar-2020 23:28 2 KB kmrdev to previous | to last
130 19-Mar-2020 23:27 2 KB kmrdev to previous | to last
129 19-Mar-2020 23:25 2 KB kmrdev to previous | to last
128 14-Feb-2020 17:16 3 KB kmrdev to previous | to last
127 14-Feb-2020 17:15 3 KB kmrdev to previous | to last
126 23-Aug-2018 21:05 3 KB kmrdev to previous | to last
125 23-Aug-2018 19:45 3 KB kmrdev to previous | to last
124 23-Aug-2018 19:09 3 KB kmrdev to previous | to last
123 23-Aug-2018 19:03 3 KB kmrdev to previous | to last
122 10-Jun-2018 18:03 3 KB kmrdev to previous | to last
121 10-Jun-2018 17:55 3 KB kmrdev to previous | to last

Page References

Incoming links Outgoing links

Version management

Difference between version and

At line 6 changed 3 lines
KMR is a set of high-performance map-reduce operations in the MPI (Message Passing Interface) environment. Its main target is large-scale computers with thousands nodes, especially ones such as K and Fujitsu FX10.
On those platforms, KMR provides utilities for map-reduce operations to the issues
such as accessing large file-systems.
KMR is a set of high-performance map-reduce operations in the MPI (Message Passing Interface) environment.
Its main target is large-scale computers with thousands nodes, K and Fujitsu FX10.
On those platforms, KMR provides utilities for the map-reduce operations to address
issues such as accessing large file-systems.
At line 11 changed one line
KMR assumes large amount of memory and designed to work on-memory, whereas most map-reduce implementations are designed to work with external (disk-based) operations. So, data exchanges in KMR occur as message passing instead of remote file operations. The KMR routines work in bulk-synchronous and the most part of the code is single-threaded, but the code inside the mapper and reducer includes compiler directives for OpenMP threading.
KMR assumes large amount of memory and designed to work on-memory, whereas most map-reduce implementations are designed to work with external (disk-based) operations.
So, data exchanges in KMR occur as message passing instead of remote file operations.
The KMR routines work in bulk-synchronous and the most part of the code is sequential, but the code inside the mapper and reducer are multi-threaded.