Programming Systems Lab. Darkover 1.0 manual. Technical Report CUCS-023-95e, Columbia University, Department of Computer Science, March 1995.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....statement. 21 Chapter 4 Related Works In this chapter we reviews some programming languages and their syntactic constructs for communication methods. We also discuss their pros and cons from the viewpoint of ecient concurrent distributed application development. 4. 1 Actor Foundry Actor Foundry[13] is a direct implementation of the Actor model on Java. It implements the Actor model as a runtime library, which allows users to send messages asynchronously among actors. As it is the rst Actor model implementation in Java, Actor Foundry has a signi cant importance for developers and computer ....

Open Systems Laboratory, Department of Computer Science, University of Illinois. The Actor Foundry home page. http://www-osl.cs.uiuc.edu/foundry.

....of the project was that it would be nice to be able to write parallel algorithms for PRAM in practice and really test them, and to be able to try to write a high level parallel language compiler for PRAM. Such a compiler for parallel modula 2 has been constructed as another special project (Juvaste 1992a, Juvaste 1992b) The emulator along with a high level parallel language compiler can be used to analyse real PRAM programs to see what kind of properties is required from a real machine that would execute PRAM programs. The emulator can be used as a teaching aid in parallel computing courses. ....

....was that it would be nice to be able to write parallel algorithms for PRAM in practice and really test them, and to be able to try to write a high level parallel language compiler for PRAM. Such a compiler for parallel modula 2 has been constructed as another special project (Juvaste 1992a, Juvaste 1992b) The emulator along with a high level parallel language compiler can be used to analyse real PRAM programs to see what kind of properties is required from a real machine that would execute PRAM programs. The emulator can be used as a teaching aid in parallel computing courses. In practice the ....

[Article contains additional citation context not shown here]

Juvaste S. 1992: Programming language pm2. University of Joensuu, Department of Computer Science, Report B-1992-1.

....proxy (see Figure 1) Filter based algorithms are designed with predictable resource requirements, which are ideal for carrying out data transformations on shared distributed computational resources. Many filter based algorithms were originally developed and analyzed by our group for Active Disks [1, 24]. These filter based algorithms carry out a variety of data transformations that arise in earth science applications and applications of standard relational database sort, select and join operations. In the DataCutter framework we are extending these algorithms and investigating the application of ....

M. Uysal. Programming Model, Algorithms, and Performance Evaluation of Active Disks. PhD thesis, Department of Computer Science, University of Maryland, College Park, 1999. 133

....of networks and routers for inclusion in a simulation. x Sim is tightly integrated with the x kernel architecture; it runs x kernel protocols and protocols can be moved between the simulator and the x kernel without any changes. x Sim Version 1.0 adheres to Version 3. 3 of the x kernel interface [NSR96]. Despite the close relationship between x sim and the x kernel, there are two important differences between the standard x kernel and the simulator of which the user should be aware. We discuss these differences here. First, the x kernel allows the hosts on which it runs to communicate with each ....

....RTCP in our simulation with another TCP, or have different TCP protocols running on different hosts, we can do so without recompiling because we ve already included these protocols in the simulator. Following the standard x kernel build procedures defined in the x kernel Programmer s Manual [NSR96], the above graph.comp file produces an x sim executable in the build directory. Section 2 shows the xsim.data file that is read at runtime by this executable, resulting in the protocol graph shown in Figure 2. Finally, we reiterate that only minimal modifications to the x kernel were necessary ....

[Article contains additional citation context not shown here]

Network Systems Research Group, Department of Computer Science, University of Arizona. x-kernel Programmer's Manual (Version 3.3), January 1996. 40

....1996 Abstract This document is a tutorial on writing x kernel protocols. It assumes a basic understanding of network protocols. This document does not cover the entire x kernel interface, focusing instead on the x kernel s most common operations. For a complete description of the x kernel, see [3]. This document also does not describe how to configure and run the x kernel, focusing instead on how to write the individual protocols that one might want to configure into a given instance of the x kernel. For an introduction on how to configure and run the x kernel, see [4] Finally, this ....

....using self. This is because VSIZE wants to intercept all of the higher level protocol s messages, and it has no header of its own to stick this protocol s demux key in. static Sessn vsizeOpen(Protl self, Protl hlp, Protl hlpType, Part p) Sessn s; Sessn lls[VSIZEMAXDOWN] Part savedPart[3]; PSTATE pstate = PSTATE )self state; int plen; int i,j; Save the original participants before opening since we need to use it in both opens and it will get munged in the first open plen = partLength(p) sizeof(Part) bcopy( char )p, char )savedPart, plen) for (i = 0; ....

Network Systems Research Group, Department of Computer Science, University of Arizona. x-kernel Programmer 's Manual (Version 3.3), Jan. 1996.

....1996 Abstract This document describes the current implementation of the x kernel message library. The focus is on its data structures and the underlying principles. This document does not describe the message library s interface or how it is used. Please refer to the x kernel Programmer s Manual [1] and the x kernel Tutorial [2] for that purpose. 1 Introduction Conceptually, a message is simply a linear sequence of bytes. A message therefore has contents (data) and a length (in bytes) The data in a message is never interpreted by the message library itself. The message library is optimized ....

....be only one byte long. In reality, the buffer is size bytes long. This is the size field in the MsgNodeLeafPart structure) This works correctly so long as this structure appears at the very end of the enclosing data structure. The declaration is given below. struct MsgNodePagePart char buffer[1]; longer in actuality ; BUF type nodes contain a reference to the function that is used to free (deallocate) the data buffer once it is no longer needed by the message library. The address of the deallocation function is stored in the free field in the following structure. struct ....

Network Systems Research Group, Department of Computer Science, University of Arizona. x-kernel Programmer 's Manual (Version 3.3), Jan. 1996.

....January 1996 Abstract This document describes the current implementation of the x kernel map library. The focus is on its underlying data structures and algorithms. This document does not describe the map library s interface or how it is used. Please refer to the x kernel Programmer s Manual [1] and the x kernel Tutorial [2] for that purpose. 1 Overview The map tool is the x kernel s central hash table manager. It provides three kinds of operations: mutating operations (insertion and removal of an element) a lookup operations (lookup and membership test) and an iterator (visit all ....

Network Systems Research Group, Department of Computer Science, University of Arizona. x-kernel Programmer 's Manual (Version 3.3), Jan. 1996.

.... Figure 2 shows a (somewhat more readable) horizontal view from that site, with an open connection to the pds site (Peter Skopp s workspace) Over the summer 1995 we converted Oz from its native pointer based object management system to using a OID based object oriented database component, Darkover [14]. An OID (or object identifier) is a unique identifier represented as an integer. The native transaction manager had already been replaced with a component [11] a much simpler effort performed using OzMarvel, and work on the new process engine component was still progressing independently. Source ....

Programming Systems Lab. Darkover 1.0 manual. Technical Report CUCS-023-95e, Columbia University, Department of Computer Science, March 1995.

....rule is selected from the current bulge. 2. Bindings Variable bindings are established via queries to the objectbase. The object6 oriented database currently used with Amber by default, called Darkover, supports a rich declarative query language combining navigational and associative access [23]; Darkover is, in principle, replaceable and we have experimented with using PCTE s object management system as a backend [28] 3. Condition evaluation The rule s condition is evaluated by traversing its tree structured representation, in which internal nodes represent logical operations and ....

Programming Systems Lab. Darkover 1.0 manual. Technical Report CUCS-023-95e, Columbia University, Department of Computer Science, March 1995.

.... A SubEnv is considered active if exactly one server is executing on the environment , meaning that it has loaded the SubEnv s process, and the SubEnv s objectbase (containing persistent product data and process state) is under the control of the server s data management subsystem (described in [41]) Typically, an active environment also has at least one active (i.e. executing) client connected to its server, because the server automatically shuts itself down when there are no more active clients (and is automatically started up on demand by 5 Oz actually supports several kinds of user ....

Programming Systems Lab. Darkover 1.0 manual. Technical Report CUCS-023-95e, Columbia University, Department of Computer Science, March 1995.

No context found.

Systems #FQAS'98#, pages 43#54. Department of Computer Science, Roskilde University, 1998.

No context found.

Computer Programming #To appear.#. #6# Jones, M. P., and Duponcheel, L. Composing monads. Tech. Rep. YALEU#DCS#RR-1004, Department of Computer Science, Yale University, Dec. 1993.

No context found.

Knowledge Systems Laboratory, Department of Computer Science, Stanford University. Hayes-Roth, B. (1993b). Intelligent control. Artificial Intelligence, 59, 213-220.

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