Efficient binary I/O of IDL objects

Newcomer, Joseph M.

doi:10.1145/39305.39309

Cited by 7 publications

(1 citation statement)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Packing arbitrary graph is a non-trivial problem, and the full paper discusses related work in this area 34,27,15], together with the algorithms and heuristics used in GUM to pack graph into packets. It also carefully describes the mechanism that ensures that, even when a thunk is transferred between PEs, there is always exactly one copy of it.…”

Section: Packing/unpacking Graphmentioning

confidence: 99%

The Partridge

Bird Dog Days, Wingshooting Ways

View full text Add to dashboard Cite

GUM is a portable, parallel implementation of the Haskell functional language. Despite sustained research interest in parallel functional programming, GUM is one of the rst such systems to be made publicly available. GUM is message-based, and portability is facilitated by using the PVM communications harness that is available on many multi-processors. As a result, GUM is available for both shared-memory (Sun SPARCserver multiprocessors) and distributed-memory (networks of workstations) architectures. The high message-latency of distributed machines is ameliorated by sending messages asynchronously, and by sending large packets of related data in each message. Initial performance gures demonstrate absolute speedups relative to the best sequential compiler technology. To improve the performance of a parallel Haskell program GUM provides tools for monitoring and visualising the behaviour of threads and of processors during execution.

show abstract

Section: Packing/unpacking Graphmentioning

confidence: 99%

The Partridge

Bird Dog Days, Wingshooting Ways

View full text Add to dashboard Cite

show abstract

Efficient binary transfer of pointer structures

Toyn

Dix

1994

Softw Pract Exp

View full text Add to dashboard Cite

This paper presents a pair of algorithms for output and input of pointer structures in binary format. Both algorithms operate in linear space and time. They have been inspired by copying garbage collection algorithms, and make similar assumptions about the representations of pointer structures, In real programs, the transfer of entire pointer structures is often inappropriate. The algorithms are extended to transfer partitions of a pointer structure lazily: the receiver requests partitions when it needs them.A remote procedure call mechanism is presented that uses the binary transfer algorithms for communicating arguments and results. A use of this as an enabling mechanism in the implementation of a software engineering environment is discussed.KEY WORDS Pointer structure Lazy transfer Distributed system Inter-process communication Remote procedure call Cadiz THE PROBLEM Many programs build data structures that consist of pieces of primary memory (often called records, structures or nodes) linked by memory addresses (often called pointers or references). Such linked data structures, or pointer structures, can be used to represent linear lists, trees, directed acyclic graphs, and unrestricted cyclic graphs. Pointer structures can be built, traversed, and revised, and finally the space they occupy can be reclaimed for reuse.The problem is how to transfer a pointer structure from one process to another, either via secondary storage or more directly via an inter-process communication stream. The requirements on a solution are that it be able to cope with an arbitrary pointer structure (maintaining any sharing and cycles), and that the original pointer structure be left in its original state.The links in the receiving process' copy of the pointer structure will almost inevitably be represented by different primary memory addresses to those in the original pointer structure, simply because primary memory at the same addresses is unlikely to be free. The major difficulty is in the maintenance of the links. Whether the transfer takes place via secondary storage or via an inter-process communication stream makes no difference.

show abstract

Some thoughts on systems integration: A conceptual framework

Rossak

1991

Journal of Systems Integration

View full text Add to dashboard Cite

Abstract. This article presents a conceptual framework for systems integration in the area of computing systems. The framework identifies a hierarchical structure of concepts and methods that allows us to discuss the different elements of systems integration. The kernel of this approach is the concept of an integration architecture, specifyhag the general layout of the integration framev~rk. Such an integration architecture is based on enabling technologies, like networking, and forms the basis for global integration activities. These global integration activities are targeted to preserve a common universe of discourse for the user of the integrated architecture and to agree upon a conceptual model of the application domain. Based on these prerequisites, two models for managing the process of systems integration, the post facto approach and the phased top-down approach, are discussed.

show abstract

Efficient binary I/O of IDL objects

Cited by 7 publications

References 0 publications

The Partridge

The Partridge

Efficient binary transfer of pointer structures

Some thoughts on systems integration: A conceptual framework

Contact Info

Product

Resources

About