|
1. |
Compiler‐assisted full checkpointing |
|
Software: Practice and Experience,
Volume 24,
Issue 10,
1994,
Page 871-886
Chung‐Chi Jim Li,
Elliot M. Stewart,
W. Kent Fuchs,
Preview
|
PDF (954KB)
|
|
摘要:
AbstractThis paper describes a compiler‐based approach to checkpointing for process recovery. The implementation is transparent to both the programmer and the hardware. The compiler‐generatedsparse potential checkpointcode maintains the desired checkpoint interval.Adaptive checkpointingreduces the size of the checkpoints.Trainingis used to select low‐cost, high‐coverage potential checkpoints. The problem of selecting potential checkpoints is shown to be NP‐complete, and a heuristic algorithm is introduced that determines a quick suboptimal solution. These compiler‐assisted checkpointing techniques have been implemented in a modified version of the GNU C (GCC) compiler. Experiments involving the modified version of the GCC compiler on a Sun SPARC workstation are
ISSN:0038-0644
DOI:10.1002/spe.4380241002
出版商:John Wiley&Sons, Ltd.
年代:1994
数据来源: WILEY
|
2. |
Mirage+: A kernel implementation of distributed shared memory on a network of personal computers |
|
Software: Practice and Experience,
Volume 24,
Issue 10,
1994,
Page 887-909
Brett D. Fleisch,
Randall L. Hyde,
Niels Christian Juul,
Preview
|
PDF (1531KB)
|
|
摘要:
AbstractWe describe the evolution of adistributed shared memory(DSM) system, Mirage, and the difficulties encountered when moving the system from a Unix‐based* kernel on the VAX to a Unix‐based kernel on personal computers. Mirage provides a network transparent form of shared memory for a loosely coupled environment. The system hides network boundaries for processes that are accessing shared memory and is upward compatible with the Unix System V Interface Definition.This paper addresses the architectural dependencies in the design of the system and evaluates performance of the implementation. The new version, MIRAGE+, performs well compared to Mirage even though eight times the amount of data is sent on each page fault because of the larger page size used in the implementation. We show that performance of systems with a large page size to network packet size can be dramatically improved on conventional hardware by applying three well‐known techniques: packet blasting, compression, and running at interrupt level.The measured time for a page fault in MIRAGE+ has been reduced 37 per cent by sending a page using packet blasting instead of using a handshake for each portion of the page. When compression was added to MIRAGE+, the time to fault a page across the network was further improved by 47 per cent when the page was compressed into one network packet. Our measured performance compares favorably with the amount of time it takes to fault a page from disk. Lastly, running at interrupt level may improve performance 16 per cent when faulting pages without compre
ISSN:0038-0644
DOI:10.1002/spe.4380241003
出版商:John Wiley&Sons, Ltd.
年代:1994
数据来源: WILEY
|
3. |
A database of groups of prime‐power order |
|
Software: Practice and Experience,
Volume 24,
Issue 10,
1994,
Page 911-951
G. Butler,
S. S. Iyer,
E. A. O'brien,
Preview
|
PDF (2422KB)
|
|
摘要:
AbstractThe design, implementation and performance ofTwoGroups, a deductive database for the 58,761 groups of order 2n, (n ≤ 8), is described. The system is implemented inNU‐Prolog, a Prolog system with built‐in functions for creating and using deductive databases. TwoGroups has a set‐theoretic query language, which provides users with a familiar notation to access the data. The paper describes the data and its representation, the set‐theoretic query language, its translator and optimiser, and the experiments on the performance of the
ISSN:0038-0644
DOI:10.1002/spe.4380241004
出版商:John Wiley&Sons, Ltd.
年代:1994
数据来源: WILEY
|
4. |
A message‐driven programming system for fine‐grain multicomputers |
|
Software: Practice and Experience,
Volume 24,
Issue 10,
1994,
Page 953-980
Daniel Maskit,
Stephen Taylor,
Preview
|
PDF (1682KB)
|
|
摘要:
AbstractThis paper describes an experimental message‐driven programming system for fine‐grain multicomputers. The initial target architecture is the J‐machine designed at MIT. This machine combines a unique collection of architectural features that includefine‐grain processes, on‐chip associative memory;andhardware support for process synchronization.The programming system uses these mechanisms via a simple message‐driven process model that blurs the distinction between processes and messages: messages correspond to processes that are executed elsewhere in the network. This model allows code and data to be distributed across the computers in the machine, and is supported at every stage of the program development cycle. The prototype system we have developed includes a basic set of programming tools to support the model; these include a compiler, linker, archiver, loader and microkernel. Although the concepts are language independent, our prototype system is bas
ISSN:0038-0644
DOI:10.1002/spe.4380241005
出版商:John Wiley&Sons, Ltd.
年代:1994
数据来源: WILEY
|
5. |
Masthead |
|
Software: Practice and Experience,
Volume 24,
Issue 10,
1994,
Page -
Preview
|
PDF (63KB)
|
|
ISSN:0038-0644
DOI:10.1002/spe.4380241001
出版商:John Wiley&Sons, Ltd.
年代:1994
数据来源: WILEY
|
|