second call for feedback on Naiad design

Previous Topic Next Topic
 
classic Classic list List threaded Threaded
12 messages Options
Reply | Threaded
Open this post in threaded view
|

second call for feedback on Naiad design

ccrraaiigg

Hi--

      This is another call for feedback on the design of Naiad[1], a
Smalltalk module system I'm writing for Squeak as part of the Spoon
project[2].

      On the theory that I'll get more of a response by including the
whole text rather than a link to it, here it is... :)

***

2008-10-20, 1946 GMT

Copyright (c) 2008 Craig Latta. All rights reserved.


Hi--

      I've been on a quest to make Squeak smaller and more modular, the
Spoon project[1]. Part one was making the object memory small. Part
three is about making the virtual machine small. This message is about
part two, making a module system suitable for adding new behavior to a
minimal system in an organized way, and for transferring behavior
accurately between running systems.

      Spoon's module system is called "Naiad", which is an acronym for
"Name And Identity Are Distinct". It keeps track of the development
history of a system (what the "sources" and "changes" files are for
now), and makes it available for exchange with other systems. I think
keeping classes' names and identities separate is critical for
this. Following are some notes on its design and use, including the
object model[1].

      At this point I'd like to emphasize I am the author of this
design, that I intend to release its implementation under an MIT-style
license, and that I'd like to pursue a graduate degree with it (I'm
open to invitations :).

***

motivation

      A traditional Smalltalk system uses source code to express both
development history and changes exchanged between systems. The precise
meaning of source code depends on the current state of the system
compiling it. Since a Smalltalk system is dynamic, source code is an
inherently ambiguous medium across time.

      The most problematic system artifacts in light of this ambiguity
are classes. All activity in a Smalltalk system is the result of
sending messages to objects. The sending of a message invokes the
execution of a method, a sequence of instructions for a virtual
processor. Some of these instructions manipulate the state of the
object receiving the message. Classes define the structure of that
state. Therefore, when those class definitions change, the source code
for the methods of those classes may become meaningless.

      One may confront this situation when trying to recompile source
code for an old version of a method whose class definition has changed
in the meantime. Similarly, source code from one system may not be
meaningful on another, since corresponding class definitions on each
system may change independently (or be removed entirely).

      This means that the accurate exchange of behavior requires manual
labor, hindering the propagation of useful fixes and new code. It also
means that interpretation and use of historical code is more difficult
than necessary. So we pay twice for this problem: when learning the
system, and when trying to share our work with others. By separating
class name from identity, Naiad makes Smalltalk more approachable for
newcomers, and more productive for developer and user communities.


editions


      Using Naiad, each development system consists of two object
memories: one containing developed code, and another containing
"editions" which describe that code. I'll call the first one the
"subject memory" and the other the "history memory".

      An Edition is a description of some artifact in the subject
memory at some point in time, currently an author, comment, tag,
class, method, module, checkpoint, or edit. Each edition has a
reference to that artifact's next state in the future (the next
edition) and in the past (the previous edition), as well as an author
edition, a collection of licenses, and a timestamp.

      An Edit represents the activation of some edition at a point in
time. For example, there may be a method created in 2005 that is
removed in 2006 and reactivated in 2007. There would be an Edit for
each of those three events, but only two method editions (one
representing the method becoming active, and one representing it being
removed).

      The history memory replaces the current changes and sources
files. It has an instance of EditHistory corresponding to the subject
memory, which records the active (current) editions for the classes,
method, modules, and authors in the subject memory. It also keeps the
subject memory's id and the last Edit made to the subject memory.

      Every time the subject memory adds, changes, or removes a class
definition, method, author, comment, tag, or module, or makes a
checkpoint (i.e., makes an edit), it adds the appropriate editions to
the history memory via remote messages. The history memory snapshots
itself after every edit, so as to provide crash recovery support.

      The subject memory keeps a remote reference to the history
memory's instance of EditHistory as a class variable of the local
EditHistory class, and interacts with it using utility messages sent
to the local EditHistory class. The history memory also keeps that
EditHistory instance as a class variable of its local EditHistory
class, but as a local reference.

      An edition typically elides some of its references when it is
transferred out of a history memory. For example, a transferred
edition will usually omit the references to its next and previous
editions. The requesting subject memory can calculate the ID of those
editions and obtain them with a separate request, if necessary.

      A subject memory may elect to keep its EditHistory instance as a
local object, such as in a situation where one wants some limited
immutable history for debugging purposes, and no crash recovery
support. Whether in this scenario or in normal development the same
EditHistory utility messages suffice, since no special code need be
written to support remote objects. If no edits will be made during
deployment, and no history retrieval is required, one may simply
jettison the history memory. One may always reconnect the subject and
history memories at a later time and continue development.

      The subject memory has tools for browsing and activating the
editions, wherever they are located. This means that no special tools
are needed to browse the artifacts of multiple subject systems; one
uses the same tools as for browsing the artifacts of the local subject
memory. Each subject memory may connect to multiple history memories
concurrently (if allowed).

      For that matter, the history memories of multiple systems may
connect to each other directly, to aggregate editions from multiple
people, for example.


class and method IDs


      Each class in the subject memory has a universally-unique
identifier[3], or UUID. The classes in the minimal subject memory are
assigned UUIDs before the initial release, and all subsequent classes
are assigned UUIDs when created. Rather than use the single word
"class" to refer to either a metaclass or to its sole instance, Spoon
introduces the term "protoclass". For example, (Array class) is a
metaclass, and its sole instance, Array, is a protoclass. Each
metaclass and protoclass has its own UUID, called a "base ID". This is
supported by a new instance variable in ClassDescription.

      Each version of each class is identified by a ClassID, a byte
array with segments for the class's baseID, author UUID, and a
sixteen-bit version. This means we can uniquely identify, for each
author, 65,535 versions of each class in the system. Since we identify
authors by UUID, the number of possible authors is very large.

      Each version of each method is identified by a MethodID, a byte
array which contains a ClassID and segments for the method's selector,
author UUID, and a sixteen-bit version. This means we can uniquely
identify, for each author, 65,535 versions of each method in each
version of each class in the system.


method editions and method literal markers


      Each MethodEdition holds a reference to the corresponding
ClassEdition, the method source code, and the information needed to
reconstruct the corresponding CompiledMethod directly, without need of
the compiler (the method header, initial and final program-counter
values, method literal markers, and instructions). If one will never
use the history memory to install methods in a subject memory that
lacks a compiler, one could drop the compiled method information to
save space.

      Method literal markers are used to transmit a compiled method's
literal frame values between object memories. There are method literal
marker classes to support references to classes, class variables,
other pool variables, and literal objects, and to support methods
which perform class-side super-sends. Each method literal marker
instance knows how to serialize itself as part of Spoon's remote
messaging system. In particular, when a method literal that refers to
a class transmits itself, it transmits the ClassID of that class, not
the name of the class.

      This gets at the namesake concept of Naiad, "Name And Identity
Are Distinct". When referring to a class, we never need to use its
name. Each version of each class is an object with a distinct
identity. By using ClassIDs to refer to each of them, we can avoid
using class names at all when storing history or distributing
code. This means that name of each class can be anything, as far as
the system is concerned.

      With every class name unconstrained, there is no need for
"namespaces" to distinguish between classes which happen to have same
name at some point in time. Each class effectively has its own
namespace, since it is uniquely identifiable regardless of its
name.

      Developer tools armed with this information can resolve ambiguity
for humans browsing and changing the system. If a developer writes a
method which uses a name shared by multiple classes, the system can
present more information about each of those classes (such as the
author, time of creation, version, and module association), so that
the developer can choose the intended one. When browsing such a
method, the system can distinguish the aliased class name visually,
indicating that there is disambiguating information available.


class editions and shared variables


      Each ClassEdition holds the editions for all the method versions
currently active in the corresponding class in the subject
memory. Since every edition keeps a reference to its previous and next
editions, one can trace the history of any method by starting at the
active edition. Removed methods are represented by method editions
which have the same MethodID as a normal previous method edition, but
with the rest of the fields set to nil.

      Each ClassEdition also holds the information needed to
reconstruct the corresponding class directly, without need of the
class builder. For all classes, this includes the format, instance
variable names, and superclass ID. For protoclasses, it also includes
the class pool keys, class name, and received pool IDs.

      In Spoon, every shared variable pool is the responsibility of
some class in the system. There is no global variables pool ("system
dictionary"). Each class that defines a pool is said to "publish" that
pool; classes which use that pool "receive" it. Spoon adds an instance
variable to Class to map published pools to their names. Each
ReceivedPoolID that a protoclass edition uses is a byte array which
contains a class ID and a published pool name.


checkpoints and modules


      A Checkpoint edition is simply a named marker of a particular
point in time. A developer may use checkpoints to indicate various
interesting states of development, and use the tools to regress or
replay edits made before or after that time.

      The largest unit of work is represented by module editions. They
are named collections of method IDs, indicating the specific versions
of methods which comprise a module, along with sets of child, parent,
prerequisite, and postrequisite module editions. When a module edition
is transferred out of a history memory, those edition references are
transmitted as ModuleIDs. Each module edition also has an
"antimodule", a module edition calculated at installation time by a
receiving system which, if applied, would undo the changes made by
installing the original module. Finally, each module edition has a URI
by which someone at a remote site may install the module.

      That URI represents a command to a Spoon system running on a
requestor's local machine; it refers to a standard port on
localhost. Its path is a text-encoded action, containing an
instruction (in this case "install a module"), the hostname and port
of a Spoon system providing the module, and the module's ID. The
receiving system uses this information to request the module from a
providing history memory, which then transmits editions as
necessary. Exactly which editions are transmitted depends on the state
of the receiving system; this is a two-way conversation between the
providing and receiving systems. This is often more time and space
efficient than simply providing all of a module's code, which is what
happens with traditional static representations like change sets.

      The URIs may be cited on ordinary webpages, which are indexed by
search engines like Google. A person in search of a module for a
particular purpose can search for it with a web browser, using those
search engines. Having found a module's URI, the person can click on
it, establishing a connection to an embedded webserver in their local
Spoon system, which carries out the URI's command.

      This mechanism for code distribution avoids storing code in
static files. It's a deparature from Smalltalk's traditional "fileout"
mechanism.

      The encoded URIs can serve other functions as well, such as
listing a system's installed modules, removing an installed module,
making a snapshot, and quitting the system. In this way one can use a
web browser to interact with a Spoon system for several basic tasks;
this is especially useful when the system is headless (e.g., in its
initial minimal state).


comments and tags


      Editions for authors, classes, methods, checkpoints, edits, and
modules each have their own comment and tag editions. This means each
one of those artifacts has a comment and tags, and the changes in both
are recorded over time. Comments are as we've already been using them:
they're explanatory prose about the artifacts. Tags may be familiar to
you from the web; they are short semantic markers used for grouping
similar artifacts.

      I intend for tags to replace class and method
categories. Nominally, we've been using class and method categories to
establish semantic hierarchies, but the hierarchies have turned out to
be quite shallow. Although we can form hierarchies with tags as well,
I think we would do better to apply the sorts of algorithms that
search engines use, and not concern ourselves with memorizing an
artifact's semantic markers. The computational cost this incurs for
the tools might have been high in the early days of Smalltalk, but it
is quite modest now.


      Thanks for reading! Please let me know of any questions or other
feedback, and feel free to discuss this on the Spoon and Squeak-dev
mailing lists.


-C

[1] http://netjam.org/spoon/naiad
[2] http://netjam.org/spoon
[3] http://en.wikipedia.org/wiki/Universally_Unique_Identifier

--
Craig Latta
improvisational musical informaticist
www.netjam.org
Smalltalkers do: [:it | All with: Class, (And love: it)]


_______________________________________________
Spoon mailing list
[hidden email]
http://lists.squeakfoundation.org/cgi-bin/mailman/listinfo/spoon
Reply | Threaded
Open this post in threaded view
|

Re: second call for feedback on Naiad design

Tapple Gao
On Wed, Nov 19, 2008 at 12:27:51PM -0800, Craig Latta wrote:
>       This is another call for feedback on the design of Naiad[1], a
> Smalltalk module system I'm writing for Squeak as part of the Spoon
> project[2].

I have a suspicion that this rewrite has sped up the source code
access speed dramatically, which should make the browser much
snappier and Monticollo snapshotting much faster. Could you
comment on a rough estimate of this speedup? I think it is a
feature worth advertising.

--
Matthew Fulmer -- http://mtfulmer.wordpress.com/
_______________________________________________
Spoon mailing list
[hidden email]
http://lists.squeakfoundation.org/cgi-bin/mailman/listinfo/spoon
Reply | Threaded
Open this post in threaded view
|

Re: second call for feedback on Naiad design

ccrraaiigg
In reply to this post by ccrraaiigg

Hi Igor--

 > > Every time the subject memory adds, changes, or removes a class
 > > definition, method, author, comment, tag, or module, or makes a
 > > checkpoint (i.e., makes an edit), it adds the appropriate editions
 > > to the history memory via remote messages. The history memory
 > > snapshots itself after every edit, so as to provide crash recovery
 > > support.
 >
 > Hmm, this could be a bit heavyweight. A history can grow to multiple
 > hundreds of megabytes, then, imagine how slow it could be when you
 > have to snapshot full image at every change.
 >
 > As optimization, it could use a temporary file(s) to save incremental
 > changes, to avoid snapshotting at each edit. Then it can do full
 > snapshots when incremental file grows bigger than certain amount or by
 > direct request to clean-out incremental storage.

      Well, these days even memories that large have snapshot times that
fall within the idle intervals of a development system. But assuming
it's a problem, I'd rather divide the history memory into several
memories (probably by how utilized the editions are). I can also imagine
limited periods where one is willing to forego edition-by-edition crash
recovery (e.g., when installing a set of changes which are meant to be
atomic). The subject could keep track of the change order and report it
to the history memory later, if desired.

 > Since there is no single, global SystemDictionary its pointless to
 > discuss the cos and pros of namespaces. In your system each
 > class/module effectively is name space, the question, of course, how
 > to reflect the new capabilities of system in a way which don't shatter
 > the [foundation] of smalltalk syntax and its spirit.

      Well, my proposal doesn't change the syntax at all, although it
does impose additional responsibilities on the tools. Since the
existence of a single system dictionary was always an implementation
detail and never part of the fundamental spirit of the system, I think
we're okay there, too.


      thanks!

-C

--
Craig Latta
improvisational musical informaticist
www.netjam.org
Smalltalkers do: [:it | All with: Class, (And love: it)]

_______________________________________________
Spoon mailing list
[hidden email]
http://lists.squeakfoundation.org/cgi-bin/mailman/listinfo/spoon
Reply | Threaded
Open this post in threaded view
|

Re: second call for feedback on Naiad design

ccrraaiigg
In reply to this post by Tapple Gao

Hi Matthew--

 > I have a suspicion that this rewrite has sped up the source code
 > access speed dramatically, which should make the browser much
 > snappier and Monticollo snapshotting much faster. Could you
 > comment on a rough estimate of this speedup? I think it is a
 > feature worth advertising.

      Good point... I haven't done any measurements yet, though. This is
effectively comparing localhost network access from RAM to filesystem
access. I imagine it would come down to which way invoked more paging on
the part of the host system's memory management. My guess is that the
network case would be faster, but not amazingly so these days.

      You experience unduly slow speeds with the file-based case now?


      thanks again,

-C


_______________________________________________
Spoon mailing list
[hidden email]
http://lists.squeakfoundation.org/cgi-bin/mailman/listinfo/spoon
Reply | Threaded
Open this post in threaded view
|

Re: second call for feedback on Naiad design

Tapple Gao
On Wed, Nov 19, 2008 at 07:08:12PM -0800, Craig Latta wrote:

>
> Hi Matthew--
>
>  > I have a suspicion that this rewrite has sped up the source code
>  > access speed dramatically, which should make the browser much
>  > snappier and Monticollo snapshotting much faster. Could you
>  > comment on a rough estimate of this speedup? I think it is a
>  > feature worth advertising.
>
>       Good point... I haven't done any measurements yet, though. This is
> effectively comparing localhost network access from RAM to filesystem
> access. I imagine it would come down to which way invoked more paging on
> the part of the host system's memory management. My guess is that the
> network case would be faster, but not amazingly so these days.
>
>       You experience unduly slow speeds with the file-based case now?

No. It's not the filesystem access that is slow. It is that the
current source code storage format reads the file character by
character, looking for the terminating !, and doing utf-8
conversion the whole way. 95% of the time in a MC snapshot is
spent in testing the source file characters for the terminating
! character. I immagine you do much more in bulk rather than
character by character. The format of the .sources file is
horrible for access speed.

--
Matthew Fulmer -- http://mtfulmer.wordpress.com/
_______________________________________________
Spoon mailing list
[hidden email]
http://lists.squeakfoundation.org/cgi-bin/mailman/listinfo/spoon
Reply | Threaded
Open this post in threaded view
|

Re: second call for feedback on Naiad design

ccrraaiigg

 > It's not the filesystem access that is slow. It is that the
 > current source code storage format reads the file character by
 > character, looking for the terminating !, and doing utf-8
 > conversion the whole way. 95% of the time in a MC snapshot is
 > spent in testing the source file characters for the terminating
 > ! character. I imagine you do much more in bulk rather than
 > character by character. The format of the .sources file is
 > horrible for access speed.

      Oh, right! I forgot about that. :)  Yeah, should be quite a bit
faster, I'm just answering String objects that are sitting in memory.
The measurements will be interesting.

      But again, I take it from your comment that you're actually
finding the speed of the traditional setup to be a problem? If so, then
yeah, it'd make a good marketing point.


      thanks again,

-C



_______________________________________________
Spoon mailing list
[hidden email]
http://lists.squeakfoundation.org/cgi-bin/mailman/listinfo/spoon
Reply | Threaded
Open this post in threaded view
|

Re: second call for feedback on Naiad design

Tapple Gao
On Wed, Nov 19, 2008 at 09:48:38PM -0800, Craig Latta wrote:

>
>  > It's not the filesystem access that is slow. It is that the
>  > current source code storage format reads the file character by
>  > character, looking for the terminating !, and doing utf-8
>  > conversion the whole way. 95% of the time in a MC snapshot is
>  > spent in testing the source file characters for the terminating
>  > ! character. I imagine you do much more in bulk rather than
>  > character by character. The format of the .sources file is
>  > horrible for access speed.
>
>       Oh, right! I forgot about that. :)  Yeah, should be quite a bit
> faster, I'm just answering String objects that are sitting in memory.
> The measurements will be interesting.
>
>       But again, I take it from your comment that you're actually
> finding the speed of the traditional setup to be a problem? If so, then
> yeah, it'd make a good marketing point.

It's by far the biggest bottleneck in MC speed. Try viewing
changes on the Morphic package. It takes about 3 minutes on a
fast machine, and 99.6% of the time is source code lookup, last
time I measured Morphic

--
Matthew Fulmer -- http://mtfulmer.wordpress.com/
_______________________________________________
Spoon mailing list
[hidden email]
http://lists.squeakfoundation.org/cgi-bin/mailman/listinfo/spoon
Reply | Threaded
Open this post in threaded view
|

Re: second call for feedback on Naiad design

Tapple Gao
On Thu, Nov 20, 2008 at 08:57:40AM -0700, Matthew Fulmer wrote:

> On Wed, Nov 19, 2008 at 09:48:38PM -0800, Craig Latta wrote:
> >
> >  > It's not the filesystem access that is slow. It is that the
> >  > current source code storage format reads the file character by
> >  > character, looking for the terminating !, and doing utf-8
> >  > conversion the whole way. 95% of the time in a MC snapshot is
> >  > spent in testing the source file characters for the terminating
> >  > ! character. I imagine you do much more in bulk rather than
> >  > character by character. The format of the .sources file is
> >  > horrible for access speed.
> >
> >       Oh, right! I forgot about that. :)  Yeah, should be quite a bit
> > faster, I'm just answering String objects that are sitting in memory.
> > The measurements will be interesting.
> >
> >       But again, I take it from your comment that you're actually
> > finding the speed of the traditional setup to be a problem? If so, then
> > yeah, it'd make a good marketing point.
>
> It's by far the biggest bottleneck in MC speed. Try viewing
> changes on the Morphic package. It takes about 3 minutes on a
> fast machine, and 99.6% of the time is source code lookup, last
> time I measured Morphic

I mention it because I've spent a lot of time optimizing MC for
speed. Between MC 1.0 and 1.6, I've improved PackageInfo speed
8x and package loading speed 6x (and I have another unstable
experimental patch that reduces loading from an quadratic time
operation to linear time one). However, I havn't been able to
touch package saving speed at all, because it would require
changing the source code storage format, which is outside the
scope of MC.

--
Matthew Fulmer -- http://mtfulmer.wordpress.com/
_______________________________________________
Spoon mailing list
[hidden email]
http://lists.squeakfoundation.org/cgi-bin/mailman/listinfo/spoon
Reply | Threaded
Open this post in threaded view
|

Re: second call for feedback on Naiad design

ccrraaiigg
In reply to this post by ccrraaiigg

Hi--

      Thanks for the comments! I'm responding to the comments so far in
this single message. I see no reason to restrict Naiad-related
discussion to a single thread; hopefully threads will emerge around
particular specific issues, rather than particular people. :)  Please
feel free to break issues out into new threads... for this message,
there's such a grab-bag going that I decided to deal with it all in one
place.

      Karl writes:

 > When this system works, won't image size be an issue, like an
 > ever-growing web browser cache that has no size limit?

      I imagine the history memory will have various utilities, like:

-    dumping all the compiled method info, because the subject memory
      will always have a compiler

-    dumping all the method source, because the subject memory will
      never have a compiler :)

-    storing its less-frequently-accessed editions in one or more
      separate history memories, which spend most of their time as
      suspended snapshot files, but which can be activated when
      necessary. Remote message-sending is a fundamental part of
      Spoon; there's no inherent reason why the history memory can't be a
      federation of history memories instead.

      Of course, one might decide to put editions in another object
      database at any point instead (e.g., Magma or Gemstone). I just
      want to provide something that provides the bare minimum
      functionality "out of the box".

-    purging certain editions entirely (rather like when we made new
      sources files with the traditional setup)

***

      Wolfgang writes:

 > For me the main issue is the protocol that is used between the two
 > images (subject and history). There is little written about it.

      This is true, I haven't finished that documentation yet. One can
look at the implementation of remote message-sending from the last Spoon
release, but I haven't described it in prose yet, and the Naiad design
document is the most prose I've written about how the subject and
history memories communicate at a higher level. Eventually all this
stuff will be in the Spoon book[1].

 > Just for thought, what if the history memory would be a web server.
 > What would the protocol look like?

      Well, there is already a (tiny) webserver in the subject memory,
to  provide the initial user interface when first run. One could load
its conveying module into the history memory and do lots of interesting
things with it, yes.

 > Can the low-level protocol be hacked to support this?

      Yes.

 > And one thing I am suspicious is that there is so much knowledge in
 > the IDs.

      Since they're going to be flying back and forth over sockets,
sometimes in large numbers, they need to be as small as possible; so
I've thought carefully about minimizing them. At this point I'm simply
open to discussion about what anyone would leave out. :)  I think have a
good argument for every bit in every ID (likewise for every bit in the
minimal subject memory).

 > And limits to the maximum number of editions etc.

      So far I've decided that it's not worth any extra bits expressing
variable-length sizes, but again I'm open to discussion about that.

 > I'd rather have proper objects that those IDs, with LargeIntegers :-)

      (The size argument applies here, too.)

***

      Michael writes:

 > I think the main reason people aren't commenting is because that's a
 > lot of reading!

      Sure, I'll just keep asserting that the importance justifies the
time. :)

 > Perhaps "versions" is a better name than "editions"? That's the name
 > we're more familiar with.

      In this case I think the familiarity is a disadvantage; "version"
has multiple strong meanings to people. A "version" is sometimes an
artifact which has multiple interesting states over time, and sometimes
it's an identifier used to refer to such an artifact. I think it's
better to use a less-used term here, and I like the resonance between
"edition" and "edit".

 > Do we need to run two instances of Squeak to edit code, one for the
 > current version and one for managing the edit history? I assume that's
 > what you mean by needing two object memories.

      That's right. The typical case is one person using one subject
memory connected to one history memory that is mostly that person's
editions, over a localhost socket connection.

 > If so, is it intended for the edit history object memory to be a live
 > central repository shared by developers?

      That's also an option, yes; it's just not the default.

 > Does the system work if it can't contact the edit history object
 > memory?

      Yes, but the tools would show decompiled method source, and some
history features like regression would be unavailable, (similar to what
happens if you don't have the changes/sources files with the current
setup). But the typical case is that you have the history memory
snapshot on the local machine, so it seems no more likely this would
happen than it would be for one to lose the old changes/sources files,
or indeed the subject memory itself.

 > What do your remote references look like?

      Each one is an object which holds a special hash for a remote
object, and stream on a socket connected to the remote system. So...

 > How stable are they? Do they rely on, e.g. IP address to find a remote
 > object memory? If somebody changes IP, are the remote references still
 > valid?

      ...currently, they do not survive suspension or termination of the
object memory in which they live. They are *not* like URLs, as your
comment implies. They are not a description of how to reach a remote
object, they are an active connection to a remote object which behaves
in all ways like the remote object. In general, they are created by
sending messages to other remote objects. The first remote objects in a
session are created specially as part of the connection handshake
between object memories.

      If the object memory of the reference is suspended (saved and
quit), the reference is nilled on resumption of the memory.

      I implemented this part of the system in 2003; it's been in all
the Spoon releases so far.

 > I assume a class now contains a ClassID and a collection of MethodIDs?

      No, a class has a "base ID", which is a UUID. The subject memory
as a whole also has a UUID. The history memory knows the UUID of the
subject memory it is tracking, and has "class editions" for each of the
classes that have ever existed in the subject memory. Each class edition
has "method editions" for all of the methods which have ever existed for
that class as defined at a certain point in time.

 > Why is ClassID so complex?

      It's complex? It's just a base UUID, an author UUID, and a version
number. I think if it were any simpler we'd lose something important.

 > Why not just assign each class a new UUID for each new version of that
 > class, with authorship and versioning being metadata of that class?

      It seems to me that it would be useful to have a single unique
identifier that can refer to the definition of a class at all points in
time, as expressed by all authors. When you want to get more specific as
to author and point in time, you can append additional bits to it.

      Also, I explicitly want to keep history information separate from
the artifact objects they describe, so that they may be easily left
behind during production.

 > Limiting to 65,536 versions per author is going to create problems in
 > 10 years time.

      I disagree. Remember, these are editions of a class *definition*
(instance variable format, etc.). If you add a method to a class, you're
not creating a new edition of that class, you're merely creating a new
method edition. From my experience (which encompasses more than ten
years ;), authors tend to create entirely new classes much more often
than they revise class definitions, and they simply use the classes as
they exist a lot more often than that. Frankly, I'd expect 1,024 to
suffice here. Sixteen bits is simply the first sufficient number of
bytes, so it's convenient as well.

 > Isn't having the author and version in the [class] IDs going to cause
 > conflict problems? What happens if the author is careless and ends up
 > with two different versions of a method with the same unique
 > identifier?

      Another good reason for keeping the history information in a
separate (and headless) object memory is so it can take of itself
without most developers bothering with it. :)  The typical developer
uses tools in the subject memory. Those tools only make requests to the
history memory for new editions to be added; they have no say in how the
corresponding IDs are made. In particular, the history memory decides
what the next available version number is for a particular combination
of class base ID, author, and selector.

 > Are author UUIDs going to be able to be looked up to get email
 > addresses and names somehow?

      Each history memory stores author editions; each author edition
associates an author UUID with all that info and more (see the class
tree at [2]). When you receive a module from another author's system,
you get the relevant author editions as well. When you use a new system
for the first time, you can create an author edition for yourself.

 > Methods shouldn't have an author. The changes between methods
 > versions/editions should have an author.

      I disagree. I think it's less work over time to figure out those
changes when necessary.

 > I think you're taking the "minimal memory usage" idea too far.

      I think it's necessary to make the system as easy to learn and
maintain as I want it to be.

 > In my design for distributable packages... packages (cf: classes in
 > Naiad)...

      I would expect them to correspond to Naiad's modules, not classes.

 > ...they need to (deep-)copy it...

      Uh-oh... "deep copy" is one of those phrases that immediately
makes me suspect something is wrong (almost as bad as someone saying
"dude" ;).

 > I've separated source from bytecodes.

      Naiad does that, too.

 > I'm not sure it's a good idea to propose an unstable system as the
 > next version of Squeak though.

      Well, this is two major versions out, not one. I think we can get
plenty of testing in. And I think we're in serious danger of stagnation
as it is. For better or worse, I think this history stuff is the sort of
thing that has to be done with a relatively provocative step. Sometimes
this is good (insert your favorite Alan Kay quote here ;).


      thanks again!

-C

[1] http://netjam.org/spoon/book
[2] http://netjam.org/spoon/naiad

_______________________________________________
Spoon mailing list
[hidden email]
http://lists.squeakfoundation.org/cgi-bin/mailman/listinfo/spoon
Reply | Threaded
Open this post in threaded view
|

Re: second call for feedback on Naiad design

NorbertHartl
In reply to this post by ccrraaiigg
Hi,

I didn't follow he whole discussion but read Craigs
summary. There are two things I want to know:

Theoretically I like a lot of the ideas. Practically I
don' want to deal with two things (subject and history).
It reads a lot like I need to start two different images
to be able to start working. Are there ideas how to hide
the fact that there are two things involved? Or is there
even the possibility to have the history memory and the
subject memory in one thing? Don't get me wrong I really
like the idea to have these separated. But I want to
separate them later not at first.

I like to edit my history (and also remove versions). Is
there a definition of a fallback behaviour of the history
memory if a version is missing?

thanks,

Norbert

_______________________________________________
Spoon mailing list
[hidden email]
http://lists.squeakfoundation.org/cgi-bin/mailman/listinfo/spoon
Reply | Threaded
Open this post in threaded view
|

Re: second call for feedback on Naiad design

david54
I would think that Hyrdra would be a good way to simplify the management of two object memories for the typical use-case.

-david

On Sat, Nov 22, 2008 at 3:02 AM, Norbert Hartl <[hidden email]> wrote:
Hi,

I didn't follow he whole discussion but read Craigs
summary. There are two things I want to know:

Theoretically I like a lot of the ideas. Practically I
don' want to deal with two things (subject and history).
It reads a lot like I need to start two different images
to be able to start working. Are there ideas how to hide
the fact that there are two things involved? Or is there
even the possibility to have the history memory and the
subject memory in one thing? Don't get me wrong I really
like the idea to have these separated. But I want to
separate them later not at first.

I like to edit my history (and also remove versions). Is
there a definition of a fallback behaviour of the history
memory if a version is missing?

thanks,

Norbert

_______________________________________________
Spoon mailing list
[hidden email]
http://lists.squeakfoundation.org/cgi-bin/mailman/listinfo/spoon


_______________________________________________
Spoon mailing list
[hidden email]
http://lists.squeakfoundation.org/cgi-bin/mailman/listinfo/spoon
Reply | Threaded
Open this post in threaded view
|

re: history memory control

ccrraaiigg
In reply to this post by NorbertHartl

Hi Norbert--

 > I don't want to deal with two things (subject and history). It reads a
 > lot like I need to start two different images to be able to start
 > working. Are there ideas how to hide the fact that there are two
 > things involved?

      Yes indeed. The subject memory starts the history memory (via the
OSProcess plugin), and manages its run state afterward, so the developer
need never think about it.

 > Or is there even the possibility to have the history memory and the
 > subject memory in one thing?

      You could run both memories at once with Hydra (as David Pennell
suggests), but I'm not yet sure what effect it could have on crash
recovery. If one memory managed to crash Hydra, could another one go
down at an inopportune state?.

 > Don't get me wrong I really like the idea to have these separated. But
 > I want to separate them later not at first. I like to edit my history
 > (and also remove versions).

      You can do that from the tools running in the subject memory, but
no mention need be made of the history memory per se.

 > Is there a definition of a fallback behaviour of the history memory if
 > a version is missing?

      How would that happen? The only ways I can imagine so far would
also take out the entire history memory, and probably the subject memory
too (i.e., people should still run backups of their storage).


      thanks!

-C

--
Craig Latta
improvisational musical informaticist
www.netjam.org
Smalltalkers do: [:it | All with: Class, (And love: it)]

_______________________________________________
Spoon mailing list
[hidden email]
http://lists.squeakfoundation.org/cgi-bin/mailman/listinfo/spoon