<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>http://debianws.lexgopc.com/wiki143/index.php?action=history&amp;feed=atom&amp;title=LogP_machine</id>
	<title>LogP machine - Revision history</title>
	<link rel="self" type="application/atom+xml" href="http://debianws.lexgopc.com/wiki143/index.php?action=history&amp;feed=atom&amp;title=LogP_machine"/>
	<link rel="alternate" type="text/html" href="http://debianws.lexgopc.com/wiki143/index.php?title=LogP_machine&amp;action=history"/>
	<updated>2026-05-13T15:02:54Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.43.1</generator>
	<entry>
		<id>http://debianws.lexgopc.com/wiki143/index.php?title=LogP_machine&amp;diff=7406673&amp;oldid=prev</id>
		<title>imported&gt;David Eppstein: Eunice Santos</title>
		<link rel="alternate" type="text/html" href="http://debianws.lexgopc.com/wiki143/index.php?title=LogP_machine&amp;diff=7406673&amp;oldid=prev"/>
		<updated>2023-07-11T22:31:21Z</updated>

		<summary type="html">&lt;p&gt;&lt;a href=&quot;/wiki143/index.php?title=Eunice_Santos&amp;amp;action=edit&amp;amp;redlink=1&quot; class=&quot;new&quot; title=&quot;Eunice Santos (page does not exist)&quot;&gt;Eunice Santos&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;The &amp;#039;&amp;#039;&amp;#039;LogP machine&amp;#039;&amp;#039;&amp;#039; is a model for [[parallel computation]].&amp;lt;ref&amp;gt;Culler et al. 1993&amp;lt;/ref&amp;gt;&lt;br /&gt;
It aims at being more practical than the [[Parallel random-access machine |PRAM]] model while still allowing for easy analysis of computation.&lt;br /&gt;
The name is not related to the [[Logarithm|mathematical logarithmic function]]:  Instead, the machine is described by the four parameters &amp;lt;math&amp;gt;L&amp;lt;/math&amp;gt;, &amp;lt;math&amp;gt;o&amp;lt;/math&amp;gt;, &amp;lt;math&amp;gt;g&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;P&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
The LogP machine consists of arbitrarily many processing units with [[distributed memory]].&lt;br /&gt;
The processing units are connected through an abstract communication medium which allows point-to-point communication. This model is pair-wise synchronous and overall asynchronous.&lt;br /&gt;
&lt;br /&gt;
The machine is described by the four parameters:&lt;br /&gt;
&lt;br /&gt;
* &amp;lt;math&amp;gt;L&amp;lt;/math&amp;gt;, the [[Latency (engineering)|latency]] of the communication medium.&lt;br /&gt;
* &amp;lt;math&amp;gt;o&amp;lt;/math&amp;gt;, the [[Overhead (computing)|overhead]] of sending and receiving a message.&lt;br /&gt;
* &amp;lt;math&amp;gt;g&amp;lt;/math&amp;gt;, the gap required between two send/receive operations. A more common interpretation of this quantity is as the inverse of the [[Bandwidth (computing)|bandwidth]] of a processor-processor communication channel.&lt;br /&gt;
* &amp;lt;math&amp;gt;P&amp;lt;/math&amp;gt;, the number of processing units.&lt;br /&gt;
&lt;br /&gt;
Each local operation on each machine takes the same time (&amp;#039;unit time&amp;#039;).  This time is called a processor cycle. The units of the parameters &amp;lt;math&amp;gt;L&amp;lt;/math&amp;gt;, &amp;lt;math&amp;gt;o&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;g&amp;lt;/math&amp;gt; are measured in multiples of processor cycles.&lt;br /&gt;
&lt;br /&gt;
== See also ==&lt;br /&gt;
&lt;br /&gt;
* [[Bulk synchronous parallel]]&lt;br /&gt;
* [[Parallel programming model]]&lt;br /&gt;
&lt;br /&gt;
== Notes ==&lt;br /&gt;
{{reflist|2}}&lt;br /&gt;
&lt;br /&gt;
== References ==&lt;br /&gt;
&lt;br /&gt;
{{Citation&lt;br /&gt;
  | last = Culler&lt;br /&gt;
  | first = David&lt;br /&gt;
  | title = LogP: Towards a realistic model of parallel computation&lt;br /&gt;
  | journal = ACM SIGPLAN Notices&lt;br /&gt;
  | volume = 28&lt;br /&gt;
  | issue = 7&lt;br /&gt;
  | pages = 1–12&lt;br /&gt;
  | date = July 1993&lt;br /&gt;
  | url = https://dl.acm.org/doi/pdf/10.1145/173284.155333&lt;br /&gt;
  | doi = 10.1145/173284.155333&lt;br /&gt;
  | last2 = Karp&lt;br /&gt;
  | first2 = Richard&lt;br /&gt;
  | last3 = Patterson&lt;br /&gt;
  | first3 = David&lt;br /&gt;
  | last4 = Sahay&lt;br /&gt;
  | first4 = Abhijit&lt;br /&gt;
  | last5 = Schauser&lt;br /&gt;
  | first5 = Klaus Erik&lt;br /&gt;
  | last6 = Santos&lt;br /&gt;
  | first6 = Eunice | author6-link=Eunice Santos&lt;br /&gt;
  | last7 = Subramonian&lt;br /&gt;
  | first7 = Ramesh&lt;br /&gt;
  | last8 = Von Eicken&lt;br /&gt;
  | first8 = Thorsten| citeseerx = 10.1.1.319.7827&lt;br /&gt;
  }}&lt;br /&gt;
&lt;br /&gt;
[[Category:Educational abstract machines]]&lt;br /&gt;
[[Category:Theoretical computer science]]&lt;br /&gt;
[[Category:Models of computation]]&lt;br /&gt;
[[Category:Parallel computing]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Comp-sci-stub}}&lt;/div&gt;</summary>
		<author><name>imported&gt;David Eppstein</name></author>
	</entry>
</feed>