The UIUC web integration repository. Computer Science Department, University of Illinois at Urbana-Chapaign. http://metaquerier.cs.uiuc.edu/repository. (2003)  @ NUS  Home/Search   Document Not in Database   Summary   Related Articles   Check

....limit the data set of interest. In the case of the GridFTP monitoring data, initial results showed that file transfer rates had a strong correlation to file size. Studies of Internet traffic have also revealed that small files achieve low bandwidths while larger files tend to have high bandwidths [4, 16]. This is thought to be primarily due to the startup overhead associated with the TCP slow start mechanism that probes the bandwidth at connection startup. Recent work has attempted to perform class based isolation of TCP flows [35] or startup optimizations [37, 38] to attempt to mitigate this ....

L. Guo and I. Matta, The War Between Mice and Elephants, Technical Report BU-CS-2001-005, Boston University, Computer Science Department, May 2001.

....developed for relational databases, it seemed to us that that theory should be applicable to temporal databases as well. Previously, an array of temporal normalization concepts had been proposed, including first temporal normal form [SS88a] and two different normal forms termed time normal form [BZ82, NA89] Each of these is specific to a particular data model, and thus appropriates the inherent peculiarities of its data model. Furthermore, these normal forms often deviate substantially in nature from conventional normal forms and are in some sense not true extensions of these, for a ....

J. Ben-Zvi. The Time Relational Model. Ph.D. thesis, Computer Science Department, UCLA, 1982.

....belonging to a group will receive the same set of messages, in the same order, within the same view. 2.2 Postgres R The Postgres R [17] system is a modification to the PostgreSQL [23] database kernel, that adds a transparent replication layer within the database. This layer uses Ensemble [12] as the underlying group communication system, making use of its total order primitive. Transaction messages are multicast using the total order primitive, and the order of their delivery is used to determine the serialization order of conflicting transactions. The authors presented several such ....

....replication protocol. It coordinates with the other sites through the exchange of messages, interacts with client ap plications, and submits transactions to the local database. The communication manager is the interface between the transaction manager and the group communication system, Ensemble [12]. The transaction manager interacts with the database through the connection manager. In this system the database used is PostgreSQL [23] The replication protocol, described in detail in [19] uses the concept of conflict classes for load partitioning. The initially available data is divided into ....

M. Hayden. The Ensemble System. PhD thesis, Cornell University, Computer Science Department, 1998.

....and hierarchical composition while in NAVTECH emphasis was given on dynamic configuration and filtering of local control data. Composition is an established principle of distributed protocol design. Typical examples of protocol composition frameworks are the # kernel[29] Horus [40] Ensemble [22], Coyote [6] The NAVTECH architecture is not tied to a concrete protocol composition framework, but it assumes that modules are implemented using such a construct. More recently, we are developing on the Appia framework[25] One of the early prototypes of NAVTECH used the Horus run time, combined ....

....Although the architecture itself is not tied to a concrete protocol composition framework, its implementation should desirably rely on a run time environment that allows micro protocols to be composed in a flexible way. Typical examples of such frameworks are the # kernel[29] Horus [40] Ensemble [22], Coyote [6] and Appia[25] The lessons learned from these implementations motivated the development of a new composition framework[30] This framework, called Appia[25] is currently being used to implement an instantiation of the NAVTECH architecture to support intrusion tolerance techniques[9] ....

M. Hayden. The Ensemble System. PhD thesis, Cornell University, Computer Science Department, 1998.

....good sense, since the expected number of rank fixed cards is 4, and we would expect that when n is large the number of rank matches would be roughly Poisson distributed. Probably the current situation is covered by the theory of asymptotically independent events developed by Aspvall and Liang [1] in their analysis of the dinner table problem, but we haven t checked into this yet. Evidently p n = R n = 4n) is still pretty far from its asymptotic value when n = 13. Checking larger values of n, we find that p 20 = 0:01695430844136377527 : p 50 = 0:01776805714328362582 : 8 ....

....A key feature of the application of inclusion exclusion to the rank derangement problem is that the quantity N(S) does not depend solely on jSj, and a little care is needed to identify the parameters to sum over. Other problems of this kind are the dinner table problem (see Aspvall and Liang [1] and Robbins [7] and the problem of enumerating Latin rectangles (see Doyle [4] ....

B. Aspvall and F. M. Liang. The dinner table problem. Technical Report STAN-CS-80-8222, Computer Science Department, Stanford University, Stanford, California, 1980.

....G 1 and G 2 with the same number of vertices, find the number of one to one mappings of the vertices of G 1 onto the vertices of G 2 such that no pair of vertices that are adjacent in G 1 get sent to vertices that are adjacent in G 2 . Show that the dinner table problem (see Aspvall and Liang [1], Robbins [10] can be phrased in these terms, and give a solution using inclusion exclusion. Formulate and solve an unrelaxed version of this problem. Show that the m enage problem can be phrased in these terms, and discuss how useful this reformulation is. Do the same for the problem of ....

B. Aspvall and F. M. Liang. The dinner table problem. Technical Report STAN-CS-80-8222, Computer Science Department, Stanford University, Stanford, California, 1980.

....7 Typical examples of events are data transmission requests, indications and con rmations. Examples of layers are datagram transport , positive acknowledgment , total order , checksum , etc. Examples of relevant layers and events in the context of fault tolerant applications can be found in [8]. An ordered set of layers (protocols) de nes a quality of service. When a new quality of service is de ned, Appia gathers the event types that each layer is able to produce and consume and uses that information for: Performance improvement Appia de nes event routes for each event type that ....

M. Hayden. The Ensemble System. PhD thesis, Cornell University, Computer Science Department, 1998.

....compiler generates optimized code for some paths. When a path is created at runtime, if the runtime system can determine that optimized code is available for that path, it uses the optimized code. Formal methods can be used to build optimized fast paths [68] in the Ensemble network architecture [51]. A protocol stack consists of a sequence of protocol layers. The NuPRL [34] system was used to semiautomatically extract a fast path from the protocol stack. It ensures that the fast path generated is provably semantically equal to the protocol stack when the fast path predicate holds. How to ....

M. Hayden. The Ensemble System. Technical Report TR98-1662, Computer Science Department, Cornell University, 1998.

....channels, each with its own QoS, to be integrated in a coherent multi channel protocol stack [9] Appia recognizes the need to integrate channels, allowing properties to be shared across several channels. Most of the previous distributed communication models such as the x Kernel [6] and Ensemble [5] offer limited support for expression of inter channel constraints. The work with Maestro [2] illustrates the difficulties of maintaining consistent failure detection when channels with diverse characteristics are used concurrently. To satisfy inter channel requirements, Appia extends the ....

M. Hayden. The Ensemble System. PhD thesis, Cornell University, Computer Science Department, 1998.

....man machine interface, sequential access to data, and communication not being treated at that time. In the same way, some operating systems can access files via virtual memory mapping e.g. VAX VMS and some versions of UNIX. Similarly in persistent storage systems (e.g. the E programming language [13]) we find that assignment and reference are used as a file access method for persistent data. The possibility of using these statements to handle communication is not discussed in [13] Functional and Logic programming languages[3,4,12] use streams for mapping sequential data files onto lists. ....

....VAX VMS and some versions of UNIX. Similarly in persistent storage systems (e.g. the E programming language [13] we find that assignment and reference are used as a file access method for persistent data. The possibility of using these statements to handle communication is not discussed in [13]. Functional and Logic programming languages[3,4,12] use streams for mapping sequential data files onto lists. Indeed, in the LUCID[5] language, every variable is a stream or sequence of values. This too is a partial approach, treating only external lists and sequences via memory mapping. Our ....

"The Design of the E Programming Language", J.E. Richardson, M.J. Carey and D.T. Schuh, Research Report, Computer Sciences Department, University of VVinconsin.

....work on protocol composition. A version of x Kernel adapted to real time operation has been developed in the scope of the CORDS project [12] Following the initial work with x Kernel, many other protocol kernels have been designed with enriched functionality. Notable examples are Ensemble [2], RTCactus [3] and RTAppia [7] In this paper we are interested in designing a framework to extract the timing behavior of compositions of protocols. Even though we are interested in deriving a general framework, we will use the concrete example of the RTAppia protocol kernel. In RT Appia each ....

M. Hayden. The Ensemble System. PhD thesis, Cornell University, Computer Science Department, 1998.

....who in turn had never actually seen video being used during their investigations because it was used so infrequently. Figure 2. Handling different types of materials work situation Figure 3. Action lists in prefabrication work situation For a short presentation of our group, see [17]; a major recent project is described in [14] An example of a related kind of bias is found in a paper by Button and Harper, who, based on their presentation of a case study, conclude: In short, the technology needed was ubiquitous technology [6, p. 106] The use of the concept ubiquitous in ....

Kyng, M. The system work group, computer science department, Aarhus University. In Human Factors in Computing Systems, Reaching Through Technology (New Orleans), S.P. Robertson, G. M. Olson, and J. S. Olson, Eds. ACM Press, NY, 1991, 477--478.

....to limit the data set of interest. With the GridFTP monitoring data, initial results showed that file transfer rates had a strong correlation with file size. Studies of Internet traffic have also revealed that small files achieve low bandwidths whereas larger files tend to have high bandwidths [4, 5, 19]. This difference is thought to be primarily due to the startup overhead associated with the TCP start mechanism that probes the bandwidth at connection startup. Recent work has focused on class based isolation of TCP flows [43] and on startup optimizations [45, 46] to mitigate this problem. As a ....

L. Guo and I. Matta, The War between Mice and Elephants, Technical report BU-CS-2001-005, Computer Science Department, Boston University, May 2001.

....the fault tolerant shell or ftsh. The techniques we describe are possible in any language, but the introduction of a specialized syntax serves to make our examples succinct and watertight. Here, we will sketch the unique features of the language. Further details may be found in a technical report. [27] Like any other shell, ftsh is a nested procedural scripting language whose atoms are external commands. Compound procedures may be built up by combining atoms and structural elements. A procedure, atomic or compound, does not return any value, but simply succeeds or fails. An external command ....

D. Thain. The fault tolerant cookbook. Technical Report UWCS -TR-1476, University of Wisconsin, Computer Sciences Department, 2003.

No context found.

The UIUC web integration repository. Computer Science Department, University of Illinois at Urbana-Chapaign. http://metaquerier.cs.uiuc.edu/repository. (2003)

No context found.

M. Hayden. The Ensemble System. Technical Report TR981662, Computer Science Department, Cornell University, 1998.

No context found.

M. Hayden. The Ensemble System. PhD thesis, Cornell University, Computer Science Department, 1998.

No context found.

J. Ben-Zvi. The Time Relational Model. PhD thesis, Computer Science Department, UCLA, 1982.

No context found.

J. Ben-Zvi. The Time Relational Model. PhD thesis, Computer Science Department, UCLA, 1982.

No context found.

J. Ben-Zvi. The Time Relational Model. PhD thesis, Computer Science Department, UCLA, 1ffLA,

No context found.

M. Hayden. The Ensemble System. PhD thesis, Cornell University, Computer Science Department, 1998.

No context found.

J. Ben-Zvi. The Time Relational Model. PhD thesis, Computer Science Department, UCLA, 1982.

No context found.

M. Hayden. The Ensemble System. PhD thesis, Cornell University, Computer Science Department, 1998.

No context found.

M. Hayden. The Ensemble System. PhD thesis, Cornell University, Computer Science Department, January 1998.

No context found.

D. CULLEP,, The Split C Programming Language, Computer Science Department, University of California, Berkeley.

First 50 documents  Next 50

Online articles have much greater impact   More about CiteSeer.IST at NUS   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST at NUS - Copyright Penn State and NEC. Hosted by the School of Computing, National University of Singapore.