M. Mira da Silva and M. Atkinson. Higher-order Distributed Computation over Autonomous Persistent Stores. In Proc. of The Seventh International Workshop on Persistent Object Systems, Cape May, New Jersey, USA, May, 1996. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Combining Mobile Agents with Persistent Systems.. - Silva, Atkinson (1996) Self-citation (Da Atkinson) (Correct)
....arguments to the remote procedures. However, there is a new brand of higher order RPC systems that support much richer data types as arguments to remote procedures, namely procedures themselves [25, 6, 3] Recently, this research area has been extended towards persistence with some novel proposals [17, 16, 20, 19, 18]. 3. Database agent language Relational database systems acting as servers accept queries from client programs written in SQL, a declarative language. In this sense, SQL is a well know, established database agent language (although there are not many references to SQL in the agent literature) ....
....like that of the Internet. Another approach to reduce the transitive closure which does not create remote references is simply not to migrate objects that already exist in the target program [14, 16, 17, 3] We have generalised this technique with our scheme of migration by substitution [20, 19, 18]. 2. Sharing objects between stores There are basically two approaches to solve the sharing problem in a distributed system: one copy (by remote access, see previous paragraph) or many copies (using some sort of replication protocol) 8] The problem with replication is to maintain the ....
[Article contains additional citation context not shown here]
M. Mira da Silva and M.P. Atkinson. Higher-order distributed computation over autonomous persistent stores. In Proceedings of the Seventh International Workshop on Persistent Object Systems (Cape May, New Jersey, USA, May 29-31, 1996), 1996. Accepted for publication.
Combining Mobile Agents with Persistent Systems.. - Silva, Atkinson Self-citation (Da) (Correct)
....time, speed of execution, etc. These costs must be kept low enough to meet the needs of applications . The time taken to transmit a procedure between two Napier88 stores is acceptable, even though the current implementation of the language is typically 2 to 3 orders of magnitude slower than C [46]. For example, Napier88 RPC takes 13 seconds to transfer an empty Map[int,string] a data structure which includes two small procedures for integer equalTo and lessThan tests, across our departmental Ethernet. A new Napier88 implementation has recently been completed that promises to increase ....
....and programprogram communication. For example, the Napier88 standard library [33] for example, offers some basic support for distribution implemented by variants of the procedures that already exist to implement persistence [50] Both Tycoon RPC [43] and the latest version of Napier88 RPC [45, 46] use the same approach. Program Store Persistent System Program Store Persistent System Fig. 2. Similarities of Persistence and Mobility The opposite is also true. The same procedures for marshaling and un marshaling arguments to remote procedures can be used to export objects to a file or ....
[Article contains additional citation context not shown here]
M. Mira da Silva and M.P. Atkinson. Higher-order distributed computation over autonomous persistent stores. In Proceedings of the Seventh International Workshop on Persistent Object Systems (Cape May, New Jersey, USA, May 29-31, 1996), 1996. Accepted for publication.
Insisting on Persistent Mobile Agent Systems - Silva, Silva (1997) (1 citation) Self-citation (Da) (Correct)
....to support facilities 8, 7, and 6 (possibly 5 as well) But facility 9 seems to be compatible with all others due to the initial good design of Java. In addition, mobility and persistence also have a difficult co existence see for example, the work on Tycoon [20, 21, 22] and Napier88 [24, 28, 27, 25]. Facilities 3 and 7 are particularly difficult to achieve together, while 4 and 8 have been achieved only by Tycoon to our knowledge. 4 Survey of Existing Systems We have argued in a previous paper that the combination of mobility and persistence leads to new opportunities and challenges [26] ....
....because its syntax has no resemblance with Java. One of the authors has also worked on similar issues with another persistent programming language called Napier88 [30, 29] As a result, a number of models for communication between autonomous persistent programs have been designed and implemented [24, 28, 27, 25]. Like Tycoon, procedures and threads are first class values in Napier88 and code can migrate between autonomous programs (but not threads) However, Napier88 can also be considered a proprietary language for the very same reasons. PJava [5, 3] is a persistent version of Java that maintains the ....
[Article contains additional citation context not shown here]
M. Mira da Silva and M.P. Atkinson. Higher-order distributed computation over autonomous persistent stores. In Atkinson et al. [6].
Mobility and Persistence - Silva (1997) (2 citations) Self-citation (Da) (Correct)
....communication. For example, the Napier88 standard library [KBC 94] offers some basic support for distribution implemented by modifying the procedures that already existed to implement persistence [Mun93] Both Tycoon RPC [MMS95, MMS96, Mat96] and the latest version of Napier88 RPC [MdS95b, MdSA96b] use the same approach. Same algorithms Program Persistent System Program Persistent System Database Database Fig. 2. Similarities of Persistence and Mobility The opposite is also true. The same procedures for marshaling and un marshaling arguments to remote procedures can be used to export ....
....runtime are explicitly removed [BC95] Octopus [FD93, FD94] is another proposal to allow application programmers themselves to manipulate bindings in persistent objects. As part of our work with Napier88 we have designed and implemented a mechanism called migration by substitution [MdSAB96, MdSA96b, MdS96] in which only a surrogate identifying the object migrates to the target program. In the implementation, the surrogate is just a name that has been previously agreed between the source and target programs (see next paragraph) On arrival at the target program, the name is replaced by an ....
[Article contains additional citation context not shown here]
M. Mira da Silva and M.P. Atkinson. Higher-order distributed computation over autonomous persistent stores. In Atkinson et al. [AMB96].
Efficient Object Serialization in Java - Lukasz Opyrchal And (1998) (Correct)
No context found.
M. Mira da Silva and M. Atkinson. Higher-order Distributed Computation over Autonomous Persistent Stores. In Proc. of The Seventh International Workshop on Persistent Object Systems, Cape May, New Jersey, USA, May, 1996.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC