skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Rubik

Abstract

Rubik is a tool that simplifies the process of creating task mappings for structured applications. Rubik allows an application developer to specify communicating groups of processes in a virtual application topology succinctly and map them onto groups of processors in a physical network topology. Both the application topology and the network topology must be Cartesian, but the dimensionality of either is arbitrary. This allows users to easily map low-dimensional structures such as planes to higher-dimensional structures like cubes to increase the number of links used for routing.

Publication Date:
Research Org.:
Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
Sponsoring Org.:
USDOE
Contributing Org.:
T. Gamblin, A. Bhatele
OSTI Identifier:
1231591
Report Number(s):
RUBIK V.1.0; 002819MLTPL00
LLNL-CODE-599252
DOE Contract Number:  
AC52-07NA27344
Resource Type:
Software
Software Revision:
00
Software Package Number:
002819
Software Package Contents:
Open Source Software package available from Lawrence Livermore National Laboratory at the following URL: https://github.com/llnl/rubik
Software CPU:
MLTPL
Open Source:
Yes
Source Code Available:
Yes
Country of Publication:
United States

Citation Formats

. Rubik. Computer software. https://www.osti.gov//servlets/purl/1231591. Vers. 00. USDOE. 29 Oct. 2012. Web.
. (2012, October 29). Rubik (Version 00) [Computer software]. https://www.osti.gov//servlets/purl/1231591.
. Rubik. Computer software. Version 00. October 29, 2012. https://www.osti.gov//servlets/purl/1231591.
@misc{osti_1231591,
title = {Rubik, Version 00},
author = {},
abstractNote = {Rubik is a tool that simplifies the process of creating task mappings for structured applications. Rubik allows an application developer to specify communicating groups of processes in a virtual application topology succinctly and map them onto groups of processors in a physical network topology. Both the application topology and the network topology must be Cartesian, but the dimensionality of either is arbitrary. This allows users to easily map low-dimensional structures such as planes to higher-dimensional structures like cubes to increase the number of links used for routing.},
url = {https://www.osti.gov//servlets/purl/1231591},
doi = {},
year = {2012},
month = {10},
note =
}