<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://homeostasis.scs.carleton.ca/wiki/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=Joshua+Tessier</id>
	<title>Soma-notes - User contributions [en]</title>
	<link rel="self" type="application/atom+xml" href="https://homeostasis.scs.carleton.ca/wiki/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=Joshua+Tessier"/>
	<link rel="alternate" type="text/html" href="https://homeostasis.scs.carleton.ca/wiki/index.php/Special:Contributions/Joshua_Tessier"/>
	<updated>2026-05-18T16:35:53Z</updated>
	<subtitle>User contributions</subtitle>
	<generator>MediaWiki 1.42.1</generator>
	<entry>
		<id>https://homeostasis.scs.carleton.ca/wiki/index.php?title=Talk:Untrusted_Distributed_Storage&amp;diff=1968</id>
		<title>Talk:Untrusted Distributed Storage</title>
		<link rel="alternate" type="text/html" href="https://homeostasis.scs.carleton.ca/wiki/index.php?title=Talk:Untrusted_Distributed_Storage&amp;diff=1968"/>
		<updated>2008-11-03T22:23:09Z</updated>

		<summary type="html">&lt;p&gt;Joshua Tessier: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;==Group 1==&lt;br /&gt;
Pond:&amp;lt;br&amp;gt;&lt;br /&gt;
1) Why use Java?&amp;lt;br&amp;gt;&lt;br /&gt;
2) How was the inner-ring chosen?&amp;lt;br&amp;gt;&lt;br /&gt;
3) How big was the prototype able to scale?&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Farsite:&amp;lt;br&amp;gt;&lt;br /&gt;
1) What is convergence cryptography?&amp;lt;br&amp;gt;&lt;br /&gt;
2) What are the advantages/disadvantages of not locking the directory name of an open file handle?&amp;lt;br&amp;gt;&lt;br /&gt;
3) What assumptions did they make about concurrency in the system and how did they plan to handle it?&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Retro:&amp;lt;br&amp;gt;&lt;br /&gt;
1) Why did this never move beyond a research project?&amp;lt;br&amp;gt;&lt;br /&gt;
2) (in lessons learned) networking turned out to be the limiting factor over disk space.&amp;lt;br&amp;gt;&lt;br /&gt;
	Why had they assumed that networking wouldn&#039;t be an issue?&amp;lt;br&amp;gt;&lt;br /&gt;
3) What planned goals did they achieve?&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Group 2==&lt;br /&gt;
OceanStore&lt;br /&gt;
&lt;br /&gt;
#	What was the purpose of introspection in terms of nomadic data?&lt;br /&gt;
#	How does the less-reliable-but-faster probabalistic lookup work?&lt;br /&gt;
#	What is a Bloom filter and how is it used in OceanStore?&lt;br /&gt;
&lt;br /&gt;
FarSite&lt;br /&gt;
&lt;br /&gt;
#	Farsite was desgined to look like NTFS. How do Farsite&#039;s semantics differ from NTFS?&lt;br /&gt;
#	How is the content lease system similar to lease systems in distributed systems we&#039;ve already seen, and which is most similar?&lt;br /&gt;
#	What is the scope of Farsite? Could it work as a world wide filesystem like OceanStore.&lt;br /&gt;
&lt;br /&gt;
Retro&lt;br /&gt;
&lt;br /&gt;
#	How did the lease system change between planning and implementation?&lt;br /&gt;
#	What was the programming model used in the implementation of Farsite?&lt;br /&gt;
#	What was the biggest disadvantage to the implementation?&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Group 3 - Farsite==&lt;br /&gt;
&lt;br /&gt;
OceanStore&lt;br /&gt;
&lt;br /&gt;
1) What is convergence cryptography?&lt;br /&gt;
&lt;br /&gt;
Ans. The  file key is used to encrypt the hashes rather than to encrypt the file blocks  directly.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
2) What are the advantages/disadvantages of not locking the directory name of an open file handle?&lt;br /&gt;
&lt;br /&gt;
Ans. Advantages - The  results  of  directory  rename  operations  are  not propagated  synchronously&lt;br /&gt;
to  all  descendent  directory groups during the rename operation, because this would unacceptably&lt;br /&gt;
retard  the  rename  operation,  particularly for  directories  near  the  root  of  the  namespace  tree. &lt;br /&gt;
&lt;br /&gt;
Disadvantages- because they used lazy propagation, other users wouldn’t see the name immediately, also&lt;br /&gt;
more then one user can change the name at the same time.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
3) What assumptions did they make about concurrency in the system and how did they plan to handle it?&lt;br /&gt;
&lt;br /&gt;
Ans. The authors assume that no files are both read by many users and also frequently updated by at least one user. &lt;br /&gt;
How did they handle it? There are four classes of leases in Farsite: content leases, name leases,mode leases, and &lt;br /&gt;
access leases.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Retro&lt;br /&gt;
&lt;br /&gt;
1)Whats is the main target environment for farsite?&lt;br /&gt;
&lt;br /&gt;
Ans. The target was governments and universities environments&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
2) What are the 3 different type of certificates?  And what are their purposes?&lt;br /&gt;
&lt;br /&gt;
Ans. Namespace certificates – associated the root of a file system namespace with a set of machines  that manage the  root metadata.&lt;br /&gt;
&lt;br /&gt;
User certificates - associates  a  user with  his  personal  public  key,  so  that  the  user  identity can  be  validated  for  access  control.&lt;br /&gt;
&lt;br /&gt;
Machine certificates - associates  a  machine  with  its  own  public key,  which  is  used  for  establishing  the  validity  of  the machine as a physically unique resource&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
3) What is convergence encryption?&lt;br /&gt;
&lt;br /&gt;
Ans. The  file key  is used to encrypt the hashes rather than to encrypt the file blocks  directly.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Ponds&lt;br /&gt;
&lt;br /&gt;
1) Farsite was designed to look like NTFS.  How do Farsite’s semantics differ from NTFS?&lt;br /&gt;
&lt;br /&gt;
2) How is the content lease system similar to lease systems in distributed systems we’ve already seen and which is most similar.&lt;br /&gt;
&lt;br /&gt;
3) What is the scope of Farsite? Could it work as a World Wide file system like OceanStore.&lt;br /&gt;
&lt;br /&gt;
Ans. Farsites main scope was that of a univertisy, governement or large company.  Analysis points to a scale of approximately 10^5 machines whereas OceanStore is around 10^10&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Group 4 - Farsite Retrospective==&lt;br /&gt;
Some questions were received by paper so they are put here as well as &amp;quot;FROM &amp;lt;GROUP&amp;gt;&amp;quot;&lt;br /&gt;
&lt;br /&gt;
TO OceanStore&lt;br /&gt;
#  What is their business model?&lt;br /&gt;
#  What is introspective and what are its many applications?¬&lt;br /&gt;
#  What are the advantages of using a “Version Control System” over a typical file system model?&lt;br /&gt;
&lt;br /&gt;
TO Pond&lt;br /&gt;
#  What is Tapestry and how does it work?&lt;br /&gt;
#  How did they meet the expectations of the original OceanStore paper and vision?  (i.e. how did they solve design problems)&lt;br /&gt;
#  What is the difference between the primary and secondary replicas?&lt;br /&gt;
&lt;br /&gt;
TO FARSITE&lt;br /&gt;
#  What was the target environment for FARSITE?&lt;br /&gt;
#  What were the three different types of certificates and what were their purposes?&lt;br /&gt;
#  What is convergent encryption?&lt;br /&gt;
&lt;br /&gt;
FROM Pond&lt;br /&gt;
&lt;br /&gt;
#   How did the lease system change between planning and implementation?&lt;br /&gt;
#   What are the programming models used in the implementation?&lt;br /&gt;
#   What was the biggest disadvantage to their implementation?&lt;br /&gt;
&lt;br /&gt;
From FARSITE(?)&lt;br /&gt;
&lt;br /&gt;
#   What are the trends in technology that justify FARSITE?&lt;br /&gt;
#   Were the team members familiar with windows SIS driver?&lt;br /&gt;
#   What&#039;s WebDAV?&lt;/div&gt;</summary>
		<author><name>Joshua Tessier</name></author>
	</entry>
	<entry>
		<id>https://homeostasis.scs.carleton.ca/wiki/index.php?title=Talk:Distributed_Shared_Memory&amp;diff=1896</id>
		<title>Talk:Distributed Shared Memory</title>
		<link rel="alternate" type="text/html" href="https://homeostasis.scs.carleton.ca/wiki/index.php?title=Talk:Distributed_Shared_Memory&amp;diff=1896"/>
		<updated>2008-09-24T01:52:58Z</updated>

		<summary type="html">&lt;p&gt;Joshua Tessier: /* Difference between DSM and NUMA? */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;Here is the page where we will be discussing the DSM readings.&lt;br /&gt;
&lt;br /&gt;
== IVY ==&lt;br /&gt;
[[User:Soma|Anil]]: What were the key characteristics of IVY?  What exactly did Kai Li build?&lt;br /&gt;
&lt;br /&gt;
[[user:Alireza|Alireza]] : IVY was a software based DSM system that&#039;s been developed to allow users share their local memories in a distributed manner. IVY was designed to be used in loosely coupled environments. It had five main modules including memory allocation, process management, initialization, remote operation and memory mapping.  The main advantage of IVY was gaining performance in parallel applications comparing.&lt;br /&gt;
&lt;br /&gt;
[[user:Alireza|Alireza]] :(Question) Name some of the applications that you would think benefit from using IVY environment? Distributed Database system is the one that is mentioned in the dissertation. Thinks of something different.&lt;br /&gt;
&lt;br /&gt;
[[user:Azalia|Azalia]]:(Answer) Some of the current sample applications can be (CRM) Customer Relationship Management or (ERP) Enterprise Resource Planning applications that serve multiple users across an organization.Another example, imagine a billing system that has to calculate the telephone bills of thousands of customers can benefit from this environment by calculating the bill of multiple customers at the same time on different machines distributed across the network. Even though, each customer bill calculation can be done separately, using a shared memory space for reading input values like cost per minute, or cost per text message can be very useful. In addition, since each customer bill is a separate object the write operation is done in different pages of the shared memory and even using multiple writer algorithm, in this case, does not introduce any concurrency issue.&lt;br /&gt;
&lt;br /&gt;
== Current DSM systems? ==&lt;br /&gt;
&lt;br /&gt;
[[User:soma|Anil]]: What is a current production system that uses distributed shared memory?  What about the underlying problem makes DSM a good technological fit?&lt;br /&gt;
&lt;br /&gt;
[[user:Azalia|Azalia]]:(Answer) What is a current production system that uses distributed shared memory?&lt;br /&gt;
Any application with complex independent steps that can be parallelized would be suitable for DSM environment. Some of the current sample applications can be (CRM) Customer Relationship Management or (ERP) Enterprise Resource Planning applications that serve multiple users across an organization. &lt;br /&gt;
What about the underlying problem makes DSM a good technological fit?&lt;br /&gt;
Apart from DSM there are alternative methods for using in distributed environment (e.g. RPC and message passing), they have some inadequacies that DSM has been introduced to address them.  For instance, message passing and RPC, have difficulties in sending complex data structures and pointers over the network due to different memory address spaces. The distributed shared memory can be a solution of this problem since all the processors share the same memory address space. In addition, if we consider current RPC technologies like Web Services, we&#039;ll realize that for each task we have to pack and send a lot of XML data around. With DSM we can share a memory space and prevent overloading network by sending XML messages.&lt;br /&gt;
&lt;br /&gt;
== Difference between DSM and NUMA? ==&lt;br /&gt;
&lt;br /&gt;
[[User:Soma|Anil]] What are the differences between DSM and NUMA?  Under what circumstances are each appropriate?&lt;br /&gt;
&lt;br /&gt;
[[User:Alirez|Alireza]]: NUMA follows SMP paradigm where there is common memory bus for accessing shared memories. In addition, one of the most important aspects of the NUMA is that it provides different access time for the processers based on their locations. For instance local processors can have faster access to local memories. In addition, NUMA access to memory is hardware based.&lt;br /&gt;
&lt;br /&gt;
[[User: Joshua Tessier|Joshua Tessier]]:  Correct me if I&#039;m wrong but NUMA is basically a type of DSM.  In a NUMA system, each processor has access to a common memory, however this common memory is distributed across each of the processors.  For example, if there are 8 processors, the total memory is divided into 8 sections.  As stated above, the processors have different access times to memory stores.  Meanwhile, DSM is just dynamic shared memory; not a specific type like NUMA.&lt;br /&gt;
&lt;br /&gt;
== DSM Implementations? ==&lt;br /&gt;
[[User:Azalia|Azalia]]:(Question) What are the different types of DSM Implementations?&lt;br /&gt;
&lt;br /&gt;
[[User:Ywahyudi|Yohan]]:(Answer) There are 3 different types of DSM implementation. The first one is Software-level implementation which can be achieved in user-level, run-time library routine, the OS, or the programming language, for example IVY, Mermaid, Munin, etc. The second one is Hardware-level implementation which ensures that automatic replication of shared data in local memories and processors caches, transparently for software-layer, for example Memnet, Dash, SCI KSR1, etc. Since software is used in hardware support to optimize memory reference, and hardware is used in software solution such as virtual memory management, then the third one is Hybrid Level Implementation which is a combination of both implementation. Several examples of such implementation are Plus, Galactica Net, Alewife, etc.&lt;br /&gt;
&lt;br /&gt;
[[User:Joshua Tessier|Joshua Tessier]]:(Question) Does the hybrid solution hold much relevance today?  From what I got in the paper, it came to light due to some limitations of the hardware/OS layers at the time.  Today, we have a ton of different tools at our disposal and these limitations are no longer present.  How would such a solution be divided today?&lt;/div&gt;</summary>
		<author><name>Joshua Tessier</name></author>
	</entry>
	<entry>
		<id>https://homeostasis.scs.carleton.ca/wiki/index.php?title=Talk:Distributed_Shared_Memory&amp;diff=1895</id>
		<title>Talk:Distributed Shared Memory</title>
		<link rel="alternate" type="text/html" href="https://homeostasis.scs.carleton.ca/wiki/index.php?title=Talk:Distributed_Shared_Memory&amp;diff=1895"/>
		<updated>2008-09-24T01:36:07Z</updated>

		<summary type="html">&lt;p&gt;Joshua Tessier: /* DSM Implementations? */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;Here is the page where we will be discussing the DSM readings.&lt;br /&gt;
&lt;br /&gt;
== IVY ==&lt;br /&gt;
[[User:Soma|Anil]]: What were the key characteristics of IVY?  What exactly did Kai Li build?&lt;br /&gt;
&lt;br /&gt;
[[user:Alireza|Alireza]] : IVY was a software based DSM system that&#039;s been developed to allow users share their local memories in a distributed manner. IVY was designed to be used in loosely coupled environments. It had five main modules including memory allocation, process management, initialization, remote operation and memory mapping.  The main advantage of IVY was gaining performance in parallel applications comparing.&lt;br /&gt;
&lt;br /&gt;
[[user:Alireza|Alireza]] :(Question) Name some of the applications that you would think benefit from using IVY environment? Distributed Database system is the one that is mentioned in the dissertation. Thinks of something different.&lt;br /&gt;
&lt;br /&gt;
[[user:Azalia|Azalia]]:(Answer) Some of the current sample applications can be (CRM) Customer Relationship Management or (ERP) Enterprise Resource Planning applications that serve multiple users across an organization.Another example, imagine a billing system that has to calculate the telephone bills of thousands of customers can benefit from this environment by calculating the bill of multiple customers at the same time on different machines distributed across the network. Even though, each customer bill calculation can be done separately, using a shared memory space for reading input values like cost per minute, or cost per text message can be very useful. In addition, since each customer bill is a separate object the write operation is done in different pages of the shared memory and even using multiple writer algorithm, in this case, does not introduce any concurrency issue.&lt;br /&gt;
&lt;br /&gt;
== Current DSM systems? ==&lt;br /&gt;
&lt;br /&gt;
[[User:soma|Anil]]: What is a current production system that uses distributed shared memory?  What about the underlying problem makes DSM a good technological fit?&lt;br /&gt;
&lt;br /&gt;
[[user:Azalia|Azalia]]:(Answer) What is a current production system that uses distributed shared memory?&lt;br /&gt;
Any application with complex independent steps that can be parallelized would be suitable for DSM environment. Some of the current sample applications can be (CRM) Customer Relationship Management or (ERP) Enterprise Resource Planning applications that serve multiple users across an organization. &lt;br /&gt;
What about the underlying problem makes DSM a good technological fit?&lt;br /&gt;
Apart from DSM there are alternative methods for using in distributed environment (e.g. RPC and message passing), they have some inadequacies that DSM has been introduced to address them.  For instance, message passing and RPC, have difficulties in sending complex data structures and pointers over the network due to different memory address spaces. The distributed shared memory can be a solution of this problem since all the processors share the same memory address space. In addition, if we consider current RPC technologies like Web Services, we&#039;ll realize that for each task we have to pack and send a lot of XML data around. With DSM we can share a memory space and prevent overloading network by sending XML messages.&lt;br /&gt;
&lt;br /&gt;
== Difference between DSM and NUMA? ==&lt;br /&gt;
&lt;br /&gt;
[[User:Soma|Anil]] What are the differences between DSM and NUMA?  Under what circumstances are each appropriate?&lt;br /&gt;
&lt;br /&gt;
[[User:Alirez|Alireza]]: NUMA follows SMP paradigm where there is common memory bus for accessing shared memories. In addition, one of the most important aspects of the NUMA is that it provides different access time for the processers based on their locations. For instance local processors can have faster access to local memories. In addition, NUMA access to memory is hardware based.&lt;br /&gt;
&lt;br /&gt;
== DSM Implementations? ==&lt;br /&gt;
[[User:Azalia|Azalia]]:(Question) What are the different types of DSM Implementations?&lt;br /&gt;
&lt;br /&gt;
[[User:Ywahyudi|Yohan]]:(Answer) There are 3 different types of DSM implementation. The first one is Software-level implementation which can be achieved in user-level, run-time library routine, the OS, or the programming language, for example IVY, Mermaid, Munin, etc. The second one is Hardware-level implementation which ensures that automatic replication of shared data in local memories and processors caches, transparently for software-layer, for example Memnet, Dash, SCI KSR1, etc. Since software is used in hardware support to optimize memory reference, and hardware is used in software solution such as virtual memory management, then the third one is Hybrid Level Implementation which is a combination of both implementation. Several examples of such implementation are Plus, Galactica Net, Alewife, etc.&lt;br /&gt;
&lt;br /&gt;
[[User:Joshua Tessier|Joshua Tessier]]:(Question) Does the hybrid solution hold much relevance today?  From what I got in the paper, it came to light due to some limitations of the hardware/OS layers at the time.  Today, we have a ton of different tools at our disposal and these limitations are no longer present.  How would such a solution be divided today?&lt;/div&gt;</summary>
		<author><name>Joshua Tessier</name></author>
	</entry>
	<entry>
		<id>https://homeostasis.scs.carleton.ca/wiki/index.php?title=Talk:Distributed_Shared_Memory&amp;diff=1894</id>
		<title>Talk:Distributed Shared Memory</title>
		<link rel="alternate" type="text/html" href="https://homeostasis.scs.carleton.ca/wiki/index.php?title=Talk:Distributed_Shared_Memory&amp;diff=1894"/>
		<updated>2008-09-24T01:35:33Z</updated>

		<summary type="html">&lt;p&gt;Joshua Tessier: /* DSM Implementations? */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;Here is the page where we will be discussing the DSM readings.&lt;br /&gt;
&lt;br /&gt;
== IVY ==&lt;br /&gt;
[[User:Soma|Anil]]: What were the key characteristics of IVY?  What exactly did Kai Li build?&lt;br /&gt;
&lt;br /&gt;
[[user:Alireza|Alireza]] : IVY was a software based DSM system that&#039;s been developed to allow users share their local memories in a distributed manner. IVY was designed to be used in loosely coupled environments. It had five main modules including memory allocation, process management, initialization, remote operation and memory mapping.  The main advantage of IVY was gaining performance in parallel applications comparing.&lt;br /&gt;
&lt;br /&gt;
[[user:Alireza|Alireza]] :(Question) Name some of the applications that you would think benefit from using IVY environment? Distributed Database system is the one that is mentioned in the dissertation. Thinks of something different.&lt;br /&gt;
&lt;br /&gt;
[[user:Azalia|Azalia]]:(Answer) Some of the current sample applications can be (CRM) Customer Relationship Management or (ERP) Enterprise Resource Planning applications that serve multiple users across an organization.Another example, imagine a billing system that has to calculate the telephone bills of thousands of customers can benefit from this environment by calculating the bill of multiple customers at the same time on different machines distributed across the network. Even though, each customer bill calculation can be done separately, using a shared memory space for reading input values like cost per minute, or cost per text message can be very useful. In addition, since each customer bill is a separate object the write operation is done in different pages of the shared memory and even using multiple writer algorithm, in this case, does not introduce any concurrency issue.&lt;br /&gt;
&lt;br /&gt;
== Current DSM systems? ==&lt;br /&gt;
&lt;br /&gt;
[[User:soma|Anil]]: What is a current production system that uses distributed shared memory?  What about the underlying problem makes DSM a good technological fit?&lt;br /&gt;
&lt;br /&gt;
[[user:Azalia|Azalia]]:(Answer) What is a current production system that uses distributed shared memory?&lt;br /&gt;
Any application with complex independent steps that can be parallelized would be suitable for DSM environment. Some of the current sample applications can be (CRM) Customer Relationship Management or (ERP) Enterprise Resource Planning applications that serve multiple users across an organization. &lt;br /&gt;
What about the underlying problem makes DSM a good technological fit?&lt;br /&gt;
Apart from DSM there are alternative methods for using in distributed environment (e.g. RPC and message passing), they have some inadequacies that DSM has been introduced to address them.  For instance, message passing and RPC, have difficulties in sending complex data structures and pointers over the network due to different memory address spaces. The distributed shared memory can be a solution of this problem since all the processors share the same memory address space. In addition, if we consider current RPC technologies like Web Services, we&#039;ll realize that for each task we have to pack and send a lot of XML data around. With DSM we can share a memory space and prevent overloading network by sending XML messages.&lt;br /&gt;
&lt;br /&gt;
== Difference between DSM and NUMA? ==&lt;br /&gt;
&lt;br /&gt;
[[User:Soma|Anil]] What are the differences between DSM and NUMA?  Under what circumstances are each appropriate?&lt;br /&gt;
&lt;br /&gt;
[[User:Alirez|Alireza]]: NUMA follows SMP paradigm where there is common memory bus for accessing shared memories. In addition, one of the most important aspects of the NUMA is that it provides different access time for the processers based on their locations. For instance local processors can have faster access to local memories. In addition, NUMA access to memory is hardware based.&lt;br /&gt;
&lt;br /&gt;
== DSM Implementations? ==&lt;br /&gt;
[[User:Azalia|Azalia]]:(Question) What are the different types of DSM Implementations?&lt;br /&gt;
&lt;br /&gt;
[[User:Ywahyudi|Yohan]]:(Answer) There are 3 different types of DSM implementation. The first one is Software-level implementation which can be achieved in user-level, run-time library routine, the OS, or the programming language, for example IVY, Mermaid, Munin, etc. The second one is Hardware-level implementation which ensures that automatic replication of shared data in local memories and processors caches, transparently for software-layer, for example Memnet, Dash, SCI KSR1, etc. Since software is used in hardware support to optimize memory reference, and hardware is used in software solution such as virtual memory management, then the third one is Hybrid Level Implementation which is a combination of both implementation. Several examples of such implementation are Plus, Galactica Net, Alewife, etc.&lt;br /&gt;
&lt;br /&gt;
[[User:Joshua Tessier]]:(Question) Does the hybrid solution hold much relevance today?  From what I got in the paper, it came to light due to some limitations of the hardware/OS layers at the time.  Today, we have a ton of different tools at our disposal and these limitations are no longer present.  How would such a solution be divided today?&lt;/div&gt;</summary>
		<author><name>Joshua Tessier</name></author>
	</entry>
	<entry>
		<id>https://homeostasis.scs.carleton.ca/wiki/index.php?title=Distributed_Shared_Memory&amp;diff=1893</id>
		<title>Distributed Shared Memory</title>
		<link rel="alternate" type="text/html" href="https://homeostasis.scs.carleton.ca/wiki/index.php?title=Distributed_Shared_Memory&amp;diff=1893"/>
		<updated>2008-09-24T01:32:09Z</updated>

		<summary type="html">&lt;p&gt;Joshua Tessier: /* Questions */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;==Readings==&lt;br /&gt;
&lt;br /&gt;
There will be no formal class this week.  Instead, please read the following:&lt;br /&gt;
&lt;br /&gt;
* [http://homeostasis.scs.carleton.ca/~soma/distos/fall2008/kai-li-shared.pdf Kai Li, &#039;&#039;Shared virtual memory on loosely coupled multiprocessors&#039;&#039; (1986)].&amp;lt;br /&amp;gt;This thesis is the first major work on distributed shared memory.  You don&#039;t need to follow all of the technical details in this thesis; instead, try to understand Li&#039;s framing of the DSM problem and the thread of his argument.&lt;br /&gt;
&lt;br /&gt;
* [http://homeostasis.scs.carleton.ca/~soma/distos/2008-02-11/protic-overview.pdf Jelica Protic et al., &amp;quot;Distributed Shared Memory: Concepts and Systems&amp;quot; (1996)]&amp;lt;br /&amp;gt;This paper reviews later work in the area of distributed shared memory.  Read it to understand what issues dominated later research into DSM.&lt;br /&gt;
&lt;br /&gt;
==Questions==&lt;br /&gt;
&lt;br /&gt;
* What is the appeal of DSM?&lt;br /&gt;
* How is DSM related to virtual memory?&lt;br /&gt;
* How do concurrency issues affect the design of DSM systems?&lt;br /&gt;
* What sort of programs will benefit from DSM?  What do not?&lt;br /&gt;
* What were the major problems addressed in DSM research following Kai Li&#039;s dissertation?&lt;br /&gt;
* Did these advances change the scope of environments and problems appropriate for DSM?&lt;br /&gt;
* Why aren&#039;t DSM systems commonly in use today?&lt;br /&gt;
&lt;br /&gt;
==Online Discussion==&lt;br /&gt;
&lt;br /&gt;
There is no lecture this week; however, there is a reading response and discussion!&lt;br /&gt;
&lt;br /&gt;
* Please submit your response by Tuesday night (Sept. 23rd).  You may submit by WebCT under &amp;quot;Response 2&amp;quot;.  Or, if you do not have access to WebCT, you may submit your assignment via email at soma at ccsl.carleton.ca, subject line &amp;quot;Response 2&amp;quot;.&lt;br /&gt;
&lt;br /&gt;
* We will have an online discussion of the readings through Friday, 5 PM, via the discussion for this wiki page.  Everyone should plan to make at least one edit here.  Ideally, you should all post at least one question and one response.  Your group presentation grade will be based on your participation in this discussion.  Note that you can sign posts by using four tilde&#039;s.  You don&#039;t need to use your full name; however, if you use an alias please email me privately with your wiki username.&lt;br /&gt;
&lt;br /&gt;
* Note: I have sent a test email to everyone via Carleton Connect.  If you did not get an email, please let me know.  Thanks.&lt;br /&gt;
&lt;br /&gt;
Have fun this week, see you online and then Sept. 29th in class!&lt;br /&gt;
&lt;br /&gt;
--[[User:Soma|Anil]]&lt;/div&gt;</summary>
		<author><name>Joshua Tessier</name></author>
	</entry>
	<entry>
		<id>https://homeostasis.scs.carleton.ca/wiki/index.php?title=Distributed_Shared_Memory&amp;diff=1878</id>
		<title>Distributed Shared Memory</title>
		<link rel="alternate" type="text/html" href="https://homeostasis.scs.carleton.ca/wiki/index.php?title=Distributed_Shared_Memory&amp;diff=1878"/>
		<updated>2008-09-22T20:01:44Z</updated>

		<summary type="html">&lt;p&gt;Joshua Tessier: /* Questions */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;==Readings==&lt;br /&gt;
&lt;br /&gt;
There will be no formal class this week.  Instead, please read the following:&lt;br /&gt;
&lt;br /&gt;
* [http://homeostasis.scs.carleton.ca/~soma/distos/fall2008/kai-li-shared.pdf Kai Li, &#039;&#039;Shared virtual memory on loosely coupled multiprocessors&#039;&#039; (1986)].&amp;lt;br /&amp;gt;This thesis is the first major work on distributed shared memory.  You don&#039;t need to follow all of the technical details in this thesis; instead, try to understand Li&#039;s framing of the DSM problem and the thread of his argument.&lt;br /&gt;
&lt;br /&gt;
* [http://homeostasis.scs.carleton.ca/~soma/distos/2008-02-11/protic-overview.pdf Jelica Protic et al., &amp;quot;Distributed Shared Memory: Concepts and Systems&amp;quot; (1996)]&amp;lt;br /&amp;gt;This paper reviews later work in the area of distributed shared memory.  Read it to understand what issues dominated later research into DSM.&lt;br /&gt;
&lt;br /&gt;
==Questions==&lt;br /&gt;
&lt;br /&gt;
* What is the appeal of DSM?&lt;br /&gt;
* How is DSM related to virtual memory?&lt;br /&gt;
* How do concurrency issues affect the design of DSM systems?&lt;br /&gt;
* What sort of programs will benefit from DSM?  What do not?&lt;br /&gt;
* What were the major problems addressed in DSM research following Kai Li&#039;s dissertation?&lt;br /&gt;
* Did these advances change the scope of environments and problems appropriate for DSM?&lt;br /&gt;
* Why aren&#039;t DSM systems commonly in use today?&lt;br /&gt;
&lt;br /&gt;
* It doesn&#039;t seem to be discussed, but how do we secure sensitive information that is being stored on a remote machine?  It seems sort of pointless if you&#039;re going to end up in situations where you&#039;re stuck with having potentially insecure pieces of code run on some dude&#039;s machine...&lt;br /&gt;
&lt;br /&gt;
==Online Discussion==&lt;br /&gt;
&lt;br /&gt;
There is no lecture this week; however, there is a reading response and discussion!&lt;br /&gt;
&lt;br /&gt;
* Please submit your response by Tuesday night (Sept. 23rd).  You may submit by WebCT under &amp;quot;Response 2&amp;quot;.  Or, if you do not have access to WebCT, you may submit your assignment via email at soma at ccsl.carleton.ca, subject line &amp;quot;Response 2&amp;quot;.&lt;br /&gt;
&lt;br /&gt;
* We will have an online discussion of the readings through Friday, 5 PM, via the discussion for this wiki page.  Everyone should plan to make at least one edit here.  Ideally, you should all post at least one question and one response.  Your group presentation grade will be based on your participation in this discussion.  Note that you can sign posts by using four tilde&#039;s.  You don&#039;t need to use your full name; however, if you use an alias please email me privately with your wiki username.&lt;br /&gt;
&lt;br /&gt;
* Note: I have sent a test email to everyone via Carleton Connect.  If you did not get an email, please let me know.  Thanks.&lt;br /&gt;
&lt;br /&gt;
Have fun this week, see you online and then Sept. 29th in class!&lt;br /&gt;
&lt;br /&gt;
--[[User:Soma|Anil]]&lt;/div&gt;</summary>
		<author><name>Joshua Tessier</name></author>
	</entry>
</feed>