CSC/ECE 506 Spring 2013/4a ss - Revision history

Lsirive at 02:58, 14 February 2013

2013-02-14T02:58:32Z

← Older revision		Revision as of 02:58, 14 February 2013
Line 220:		Line 220:
	process acquires the queue lock to identify a promising partial path and releases it upon finding one. When		process acquires the queue lock to identify a promising partial path and releases it upon finding one. When
	increasing the ''Shortest_path'' a lock is acquired to ensure [http://en.wikipedia.org/wiki/Mutual_exclusion '''mutual exclusion'''] to update this shared data as well.		increasing the ''Shortest_path'' a lock is acquired to ensure [http://en.wikipedia.org/wiki/Mutual_exclusion '''mutual exclusion'''] to update this shared data as well.

Lsirive at 02:57, 14 February 2013

2013-02-14T02:57:49Z

← Older revision		Revision as of 02:57, 14 February 2013
Line 220:		Line 220:
	process acquires the queue lock to identify a promising partial path and releases it upon finding one. When		process acquires the queue lock to identify a promising partial path and releases it upon finding one. When
	increasing the ''Shortest_path'' a lock is acquired to ensure [http://en.wikipedia.org/wiki/Mutual_exclusion '''mutual exclusion'''] to update this shared data as well.		increasing the ''Shortest_path'' a lock is acquired to ensure [http://en.wikipedia.org/wiki/Mutual_exclusion '''mutual exclusion'''] to update this shared data as well.

Lsirive at 02:56, 14 February 2013

2013-02-14T02:56:47Z

← Older revision		Revision as of 02:56, 14 February 2013
Line 220:		Line 220:
	process acquires the queue lock to identify a promising partial path and releases it upon finding one. When		process acquires the queue lock to identify a promising partial path and releases it upon finding one. When
	increasing the ''Shortest_path'' a lock is acquired to ensure [http://en.wikipedia.org/wiki/Mutual_exclusion '''mutual exclusion'''] to update this shared data as well.		increasing the ''Shortest_path'' a lock is acquired to ensure [http://en.wikipedia.org/wiki/Mutual_exclusion '''mutual exclusion'''] to update this shared data as well.

Lsirive at 02:55, 14 February 2013

2013-02-14T02:55:15Z

← Older revision		Revision as of 02:55, 14 February 2013
Line 220:		Line 220:
	process acquires the queue lock to identify a promising partial path and releases it upon finding one. When		process acquires the queue lock to identify a promising partial path and releases it upon finding one. When
	increasing the ''Shortest_path'' a lock is acquired to ensure [http://en.wikipedia.org/wiki/Mutual_exclusion '''mutual exclusion'''] to update this shared data as well.		increasing the ''Shortest_path'' a lock is acquired to ensure [http://en.wikipedia.org/wiki/Mutual_exclusion '''mutual exclusion'''] to update this shared data as well.

Lsirive at 02:54, 14 February 2013

2013-02-14T02:54:41Z

← Older revision		Revision as of 02:54, 14 February 2013
Line 220:		Line 220:
	process acquires the queue lock to identify a promising partial path and releases it upon finding one. When		process acquires the queue lock to identify a promising partial path and releases it upon finding one. When
	increasing the ''Shortest_path'' a lock is acquired to ensure [http://en.wikipedia.org/wiki/Mutual_exclusion '''mutual exclusion'''] to update this shared data as well.		increasing the ''Shortest_path'' a lock is acquired to ensure [http://en.wikipedia.org/wiki/Mutual_exclusion '''mutual exclusion'''] to update this shared data as well.

Lsirive at 02:52, 14 February 2013

2013-02-14T02:52:57Z

← Older revision		Revision as of 02:52, 14 February 2013
Line 220:		Line 220:
	process acquires the queue lock to identify a promising partial path and releases it upon finding one. When		process acquires the queue lock to identify a promising partial path and releases it upon finding one. When
	increasing the ''Shortest_path'' a lock is acquired to ensure [http://en.wikipedia.org/wiki/Mutual_exclusion '''mutual exclusion'''] to update this shared data as well.		increasing the ''Shortest_path'' a lock is acquired to ensure [http://en.wikipedia.org/wiki/Mutual_exclusion '''mutual exclusion'''] to update this shared data as well.

Lsirive at 02:47, 14 February 2013

2013-02-14T02:47:50Z

← Older revision		Revision as of 02:47, 14 February 2013
Line 193:		Line 193:
	=== Programming Environment ===		=== Programming Environment ===

			[[File:Shortest_path_pseudocode.jpg\|300px\|thumb\|right\|Shortest path pseudocode using TreadMarks API]]
	The globally shared memory abstraction provided through virtual memory or some other DSM mechanism allows programmers		The globally shared memory abstraction provided through virtual memory or some other DSM mechanism allows programmers
	to focus on algorithms instead of processor communication and data tracking. Many programming environments have been		to focus on algorithms instead of processor communication and data tracking. Many programming environments have been
Line 199:		Line 200:
	C, C++ or Fortran and then compiled and linked with the TreadMarks library.		C, C++ or Fortran and then compiled and linked with the TreadMarks library.

	[[File:~~Shortest_path_pseudocode~~.jpg\|300px\|thumb\|~~right~~\|~~Shortest path~~ pseudocode using TreadMarks API]]		[[File:Jacobi_code.jpg\|300px\|thumb\|left\|Jacobi method pseudocode using TreadMarks API]]

	Shown at right is a pseudocode example of using the TreadMarks API to implement the Jacobi method, a type of partial		Shown at right is a pseudocode example of using the TreadMarks API to implement the Jacobi method, a type of partial
	differential equation solver. The code iterates over a 2D array and updates each element to the average of its four		differential equation solver. The code iterates over a 2D array and updates each element to the average of its four
Line 211:		Line 211:
	guarantees all current iteration values are written before any next iteration computation begins.		guarantees all current iteration values are written before any next iteration computation begins.

	~~[[File:Jacobi_code.jpg\|300px\|thumb\|left\|Jacobi method pseudocode using TreadMarks API]]~~

	To the left is shown a short pseudocode program exemplifying another SAS synchronization technique which uses [http://en.wikipedia.org/wiki/Lock_%28computer_science%29 '''locks''']. This program calculates the shortest path in a grouping of nodes that starts at any designated start node, visits each		To the left is shown a short pseudocode program exemplifying another SAS synchronization technique which uses [http://en.wikipedia.org/wiki/Lock_%28computer_science%29 '''locks''']. This program calculates the shortest path in a grouping of nodes that starts at any designated start node, visits each

Lsirive at 02:46, 14 February 2013

2013-02-14T02:46:30Z

← Older revision		Revision as of 02:46, 14 February 2013
Line 201:		Line 201:
	[[File:Shortest_path_pseudocode.jpg\|300px\|thumb\|right\|Shortest path pseudocode using TreadMarks API]]		[[File:Shortest_path_pseudocode.jpg\|300px\|thumb\|right\|Shortest path pseudocode using TreadMarks API]]

	Shown at ~~left~~ is a pseudocode example of using the TreadMarks API to implement the Jacobi method, a type of partial		Shown at right is a pseudocode example of using the TreadMarks API to implement the Jacobi method, a type of partial
	differential equation solver. The code iterates over a 2D array and updates each element to the average of its four		differential equation solver. The code iterates over a 2D array and updates each element to the average of its four
	nearest neighbors. All processors are assigned an approximately equivalent number of rows and neighboring processes		nearest neighbors. All processors are assigned an approximately equivalent number of rows and neighboring processes
Line 213:		Line 213:
	[[File:Jacobi_code.jpg\|300px\|thumb\|left\|Jacobi method pseudocode using TreadMarks API]]		[[File:Jacobi_code.jpg\|300px\|thumb\|left\|Jacobi method pseudocode using TreadMarks API]]

	To the ~~right~~ is shown a short pseudocode program exemplifying another SAS synchronization technique which uses [http://en.wikipedia.org/wiki/Lock_%28computer_science%29 '''locks''']. This program calculates the shortest path in a grouping of nodes that starts at any designated start node, visits each		To the left is shown a short pseudocode program exemplifying another SAS synchronization technique which uses [http://en.wikipedia.org/wiki/Lock_%28computer_science%29 '''locks''']. This program calculates the shortest path in a grouping of nodes that starts at any designated start node, visits each
	other node once and returns to the origin node. The shortest route identified thus far is stored in the shared ''Shortest_length''		other node once and returns to the origin node. The shortest route identified thus far is stored in the shared ''Shortest_length''
	and investigated routes are kept in a queue, most promising at the front, and expanded one node at a time. A process		and investigated routes are kept in a queue, most promising at the front, and expanded one node at a time. A process

Lsirive at 02:44, 14 February 2013

2013-02-14T02:44:21Z

← Older revision		Revision as of 02:44, 14 February 2013
Line 137:		Line 137:
	which acts as protection to control access to relevant memory locations. When received at the appropriate member		which acts as protection to control access to relevant memory locations. When received at the appropriate member
	node, the virtual address is translated to a local physical address.		node, the virtual address is translated to a local physical address.
	~~[[File:Jacobi_code.jpg\|300px\|thumb\|left\|Jacobi method pseudocode using TreadMarks API]]~~

	=====Improvements in communication=====		=====Improvements in communication=====
Line 210:		Line 210:
	guarantees all previous iteration values are read before any current iteration values are written, and ''Tmk_barrier(2)''		guarantees all previous iteration values are read before any current iteration values are written, and ''Tmk_barrier(2)''
	guarantees all current iteration values are written before any next iteration computation begins.		guarantees all current iteration values are written before any next iteration computation begins.

			[[File:Jacobi_code.jpg\|300px\|thumb\|left\|Jacobi method pseudocode using TreadMarks API]]

	To the right is shown a short pseudocode program exemplifying another SAS synchronization technique which uses [http://en.wikipedia.org/wiki/Lock_%28computer_science%29 '''locks''']. This program calculates the shortest path in a grouping of nodes that starts at any designated start node, visits each		To the right is shown a short pseudocode program exemplifying another SAS synchronization technique which uses [http://en.wikipedia.org/wiki/Lock_%28computer_science%29 '''locks''']. This program calculates the shortest path in a grouping of nodes that starts at any designated start node, visits each

Lsirive at 02:41, 14 February 2013

2013-02-14T02:41:03Z

← Older revision		Revision as of 02:41, 14 February 2013
Line 157:		Line 157:
	CPU interruption.		CPU interruption.

	~~[[File:Shortest_path_pseudocode.jpg\|300px\|thumb\|right\|Shortest path pseudocode using TreadMarks API]]~~


Line 179:		Line 178:

	===== Memory mapping in Mome =====		===== Memory mapping in Mome =====
			[[File:Mem hierarchy.png\|200px\|thumb\|right\|Memory hierarchy of node]]
	The Mome memory mapping figure to the left shows a possible DSM memory organization on a single node. The DSM memory size		The Mome memory mapping figure to the left shows a possible DSM memory organization on a single node. The DSM memory size
	shown is 22 pages. When a new segment is created on a node a segment descriptor is created on that node. In this case the		shown is 22 pages. When a new segment is created on a node a segment descriptor is created on that node. In this case the
Line 189:		Line 188:
	block 8 as a modified version, and has initiated a modifications merge as indicated by the block 17 pointer. The communication		block 8 as a modified version, and has initiated a modifications merge as indicated by the block 17 pointer. The communication
	layer manages incoming messages from other nodes.		layer manages incoming messages from other nodes.

	~~[[File:Mem hierarchy.png\|200px\|thumb\|right\|Memory hierarchy of node]]~~


Line 201:		Line 198:
	in the 1990s. TreadMarks was a user-level library that ran on top of Unix. Programs were written in		in the 1990s. TreadMarks was a user-level library that ran on top of Unix. Programs were written in
	C, C++ or Fortran and then compiled and linked with the TreadMarks library.		C, C++ or Fortran and then compiled and linked with the TreadMarks library.

			[[File:Shortest_path_pseudocode.jpg\|300px\|thumb\|right\|Shortest path pseudocode using TreadMarks API]]

	Shown at left is a pseudocode example of using the TreadMarks API to implement the Jacobi method, a type of partial		Shown at left is a pseudocode example of using the TreadMarks API to implement the Jacobi method, a type of partial