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 8 changed one line
__Latest release is KMR-1.9 (2018-08-27)__.
__Latest release is KMR-1.10 (2018-11-16)__.
At line 13 changed one line
KMR provides utilities other than map-reduce operations to address issues such as accessing very large file-systems, on platforms K and Fujitsu FX10.
%%strike KMR provides utilities other than map-reduce operations to address issues such as accessing very large file-systems, on platforms K and Fujitsu FX10/%.
At line 15 changed one line
KMR is designed to work in-memory and exploit large amount of memory available on supercomputers, whereas most map-reduce implementations are designed to work with external (disk-based) operations.
KMR is designed to work in-memory and to exploit large amount of memory available on supercomputers, whereas most map-reduce implementations are designed to work with external (disk-based) operations.
At line 40 changed one line
* [ieeexplore.ieee.org|https://ieeexplore.ieee.org/document/6702663]: __K MapReduce: A Scalable Tool for Data-Processing and Search/Ensemble Applications on Large-Scale Supercomputers__. Motohiko Matsuda, Naoya Maruyama, and Shinichiro Takizawa. IEEE Cluster Computing (CLUSTER) 2013. (C) Copyright IEEE.\\
* __K MapReduce: A Scalable Tool for Data-Processing and Search/Ensemble Applications on Large-Scale Supercomputers__. Motohiko Matsuda, Naoya Maruyama, and Shinichiro Takizawa. IEEE Cluster Computing (CLUSTER) 2013. (C) Copyright IEEE. [ieeexplore.ieee.org|https://ieeexplore.ieee.org/document/6702663]\\
At line 43 changed one line
* [hpcs2014.pdf]: __Supporting Workflow Management of Scientific Applications by MapReduce Programming Model__. Shinichiro Takizawa, Motohiko Matsuda, and Naoya Maruyama. IPSJ HPCS 2014. (Japanese)\\
* __Supporting Workflow Management of Scientific Applications by MapReduce Programming Model__. Shinichiro Takizawa, Motohiko Matsuda, and Naoya Maruyama. IPSJ HPCS 2014. (in Japanese). [http://id.nii.ac.jp/1001/00096874]\\
At line 46 changed one line
* [dl.acm.org|https://dl.acm.org/doi/10.1145/2642769.2642800]: __Evaluation of Asynchronous MPI Communication in Map-Reduce System on the K Computer__. Motohiko Matsuda, Naoya Maruyama, and Shinichiro Takizawa. EuroMPI Workshop 2014. (C) Copyright ACM.\\
* __Evaluation of Asynchronous MPI Communication in Map-Reduce System on the K Computer__. Motohiko Matsuda, Naoya Maruyama, and Shinichiro Takizawa. EuroMPI Workshop 2014. (C) Copyright ACM. [dl.acm.org|https://dl.acm.org/doi/10.1145/2642769.2642800]\\
At line 51 removed 8 lines
!!DISCLAIMER
KMR comes with ABSOLUTELY NO WARRANTY.
This wiki also comes with ABSOLUTELY NO WARRANTY.
Contents are liable to change.
----
At line 57 added 6 lines
!!DISCLAIMER
KMR comes with ABSOLUTELY NO WARRANTY.
This wiki also comes with ABSOLUTELY NO WARRANTY.
Contents are liable to change.