Design and Evaluation of a WideArea Distributed Shared Memory Middleware

A liquid crystal optical modulation element is disclosed. The modulation element comprises two transparent substrates positioned so as to face each other; a transparent electrode provided on the facing surface of the transparent substrates; a transparent insulating/orientation control layer provided on each of the facing surfaces of the transparent electrodes, having insulating properties and orientating the liquid crystal molecules in the proximity thereof in a preferential direction substantially parallel to the surfaces of the substrates; a liquid crystal layer exhibiting ferroelectricity, sandwiched between the insulating/orientation control layers; and means for polarizing light passing through said liquid crystal layer. The liquid crystal optical modulation element of the present invention is produced by the steps of coating transparent electrodes onto transparent sbstrates; coating polyimide films so as to cover the transparent electrodes; rubbing the polyimide coating films; positioning the transparent substrates parallel to each other so that the rubbed polyimide coating films face each other so that a liquid crystal cell is thereby assembled; introducing a liquid crystal exhibiting ferroelectricity into the cell thus formed and sealing the cell; and providing polarizers on the external surfaces of the substrates.

[1]  Brian Vinter,et al.  Java PastSet: a structured distributed shared memory system , 2003, IEE Proc. Softw..

[2]  Michael Schöttner,et al.  A gaming framework for a transactional DSM system , 2003, CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings..

[3]  Andrew S. Tanenbaum,et al.  Distributed operating systems , 2009, CSUR.

[4]  John K. Bennett,et al.  Brazos: a third generation DSM system , 1997 .

[5]  Michael Stumm,et al.  Algorithms implementing distributed shared memory , 1990, Computer.

[6]  Leslie Lamport,et al.  Time, clocks, and the ordering of events in a distributed system , 1978, CACM.

[7]  David Mosberger,et al.  Memory consistency models , 1993, OPSR.

[8]  Willy Zwaenepoel,et al.  Techniques for reducing consistency-related communication in distributed shared-memory systems , 1995, TOCS.

[9]  Alan L. Cox,et al.  Adaptive protocols for software distributed shared memory , 1999 .

[10]  Leslie Lamport,et al.  The Byzantine Generals Problem , 1982, TOPL.

[11]  Calton Pu,et al.  Replica control in distributed systems: as asynchronous approach , 1991, SIGMOD '91.

[12]  Ralph Johnson,et al.  design patterns elements of reusable object oriented software , 2019 .

[13]  Leslie Lamport,et al.  Reaching Agreement in the Presence of Faults , 1980, JACM.

[14]  Leslie Lamport,et al.  How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs , 2016, IEEE Transactions on Computers.

[15]  M. Hill,et al.  Weak ordering-a new definition , 1990, [1990] Proceedings. The 17th Annual International Symposium on Computer Architecture.

[16]  Anne-Marie Kermarrec,et al.  The many faces of publish/subscribe , 2003, CSUR.

[17]  Henri E. Bal,et al.  Orca: a language for distributed programming , 1990, SIGP.

[18]  Kai Li,et al.  Understanding Application Performance on Shared Virtual Memory Systems , 1996, 23rd Annual International Symposium on Computer Architecture (ISCA'96).

[19]  Alan L. Cox,et al.  TreadMarks: shared memory computing on networks of workstations , 1996 .

[20]  Henri E. Bal,et al.  Runtime optimizations for a Java DSM implementation , 2001, JGI '01.

[21]  Daniel A. Menascé.  MOM vs. RPC: Communication Models for Distributed Applications , 2005, IEEE Internet Comput..

[22]  John K. Bennett,et al.  Using multicast and multithreading to reduce communication in software DSM systems , 1998, Proceedings 1998 Fourth International Symposium on High-Performance Computer Architecture.

[23]  Kourosh Gharachorloo,et al.  Shasta: a low overhead, software-only approach for supporting fine-grain shared memory , 1996, ASPLOS VII.

[24]  Brian N. Bershad,et al.  Software write detection for a distributed shared memory , 1994, OSDI '94.

[25]  Willy Zwaenepoel,et al.  Implementation and performance of Munin , 1991, SOSP '91.

[26]  Arthur J. Bernstein,et al.  Efficient solutions to the replicated log and dictionary problems , 1984, PODC '84.

[27]  Michel Dubois,et al.  Synchronization, coherence, and event ordering in multiprocessors , 1988, Computer.

[28]  Nancy A. Lynch,et al.  Impossibility of distributed consensus with one faulty process , 1983, PODS '83.

[29]  Mark D. Hill,et al.  Weak ordering—a new definition , 1998, ISCA '98.

[30]  Alan L. Cox,et al.  Java/DSM: A Platform for Heterogeneous Computing , 1997, Concurr. Pract. Exp..

[31]  Danny Dolev,et al.  On the minimal synchronism needed for distributed consensus , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[32]  V AdveSarita,et al.  Weak orderinga new definition , 1990 .

[33]  Anoop Gupta,et al.  The DASH prototype: implementation and performance , 1992, ISCA '92.

[34]  Thomas Seidmann.  Distributed shared memory using the .NET framework , 2003, CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings..

[35]  Satoshi Matsuoka,et al.  Implementation of a portable software DSM in Java , 2001, JGI '01.

[36]  Galen C. Hunt,et al.  Shared memory computing on clusters with symmetric multiprocessors and system area networks , 2005, TOCS.

[37]  Paul Hudak,et al.  Memory coherence in shared virtual memory systems , 1989, TOCS.

[38]  Henri E. Bal,et al.  Performance evaluation of the Orca shared-object system , 1998, TOCS.

[39]  Alan L. Cox,et al.  Java/DSM: A platform for heterogeneous computing , 1997 .

[40]  Henri E. Bal,et al.  Run‐time optimizations for a Java DSM implementation , 2003, Concurr. Comput. Pract. Exp..