<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://hihat.opencommons.org/index.php?action=history&amp;feed=atom&amp;title=Hierarchical_algorithms%2C_approaches_and_data_structures</id>
	<title>Hierarchical algorithms, approaches and data structures - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://hihat.opencommons.org/index.php?action=history&amp;feed=atom&amp;title=Hierarchical_algorithms%2C_approaches_and_data_structures"/>
	<link rel="alternate" type="text/html" href="https://hihat.opencommons.org/index.php?title=Hierarchical_algorithms,_approaches_and_data_structures&amp;action=history"/>
	<updated>2026-05-01T22:28:03Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.43.1</generator>
	<entry>
		<id>https://hihat.opencommons.org/index.php?title=Hierarchical_algorithms,_approaches_and_data_structures&amp;diff=291&amp;oldid=prev</id>
		<title>imported&gt;Cnewburn: Created page with &quot;This wiki page is intended to capture discussions around the &quot;hierarchical&quot; part of HiHAT.  Initially, there&#039;s a focus on understanding usage requirements and surveying possib...&quot;</title>
		<link rel="alternate" type="text/html" href="https://hihat.opencommons.org/index.php?title=Hierarchical_algorithms,_approaches_and_data_structures&amp;diff=291&amp;oldid=prev"/>
		<updated>2017-11-17T21:43:26Z</updated>

		<summary type="html">&lt;p&gt;Created page with &amp;quot;This wiki page is intended to capture discussions around the &amp;quot;hierarchical&amp;quot; part of HiHAT.  Initially, there&amp;#039;s a focus on understanding usage requirements and surveying possib...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;This wiki page is intended to capture discussions around the &amp;quot;hierarchical&amp;quot; part of HiHAT.  Initially, there&amp;#039;s a focus on understanding usage requirements and surveying possible support.&lt;br /&gt;
&lt;br /&gt;
* Hierarchical algorithms&lt;br /&gt;
** [https://hihat-wiki.modelado.org/Applications#Categories_of_Hierarchical_Algorithms Categories of Hierarchical Algorithms]&lt;br /&gt;
* Requirements and Concerns&lt;br /&gt;
** Overdecomposition can lead to excess overhead&lt;br /&gt;
** The degree of decomposition needed may vary by target architecture, heterogeneity of the node&amp;#039;s computing resources, NUMA-ness of the node, and topology of the network&lt;br /&gt;
** Support representations of multi-D arrays, and make the movement of slices very efficient&lt;br /&gt;
* Approaches&lt;br /&gt;
** Choose the degree of decomposition based on the target system and the input data set&lt;br /&gt;
** Enable trade-offs between moving (halo) data and recomputing data&lt;br /&gt;
** Decomposition could be done at successive levels of the hierarchy, where schedulers make choices at each level on whether and how to further decompose work and data&lt;br /&gt;
* Data structures&lt;br /&gt;
** X10&lt;br /&gt;
** OCR&lt;/div&gt;</summary>
		<author><name>imported&gt;Cnewburn</name></author>
	</entry>
</feed>