Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Liam M. Casey

dblp:39/2044 · also Liam Casey · DBLP profile ↗
← Back
6ranked-venue papers
2as first author
0since 2021 · last 1996
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 2 · 1 first-authorComputer networks · 2Software engineering, systems software and programming languages · 2 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Internet architecture and protocols · 84% Content delivery and video streaming · 16%
Computer architecture, parallel and distributed computing, and storage systems
2 papers
Distributed systems · 97% Parallel and multicore computing · 3%

Topics — the 5 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Internet architecture and protocols › ATM networks
ATM network architecture
0.011996
Digital Storage of Media-Command and Control Protocol Applied to ATM · IEEE J. Sel. Areas Commun. 1996
Internet architecture and protocols
quality of service
0.011996
Digital Storage of Media-Command and Control Protocol Applied to ATM · IEEE J. Sel. Areas Commun. 1996
Distributed systems
fault tolerance
0.011986
Comments on "The Design of a Reliable Remote Procedure Call Mechanism" · IEEE Trans. Computers 1986
Distributed systems
remote procedure call
0.011986
Comments on "The Design of a Reliable Remote Procedure Call Mechanism" · IEEE Trans. Computers 1986
Parallel and multicore computing
load balancing
0.011977
A Domain Structure for Distributed Computer Systems · SOSP 1977

Methods — techniques the papers use, named apart from their topics

protocol design · 0.0
YearPublicationVenuePosition
1996 Digital Storage of Media-Command and Control Protocol Applied to ATM
abstract
Digital storage media-command and control (DSM-CC) is a set of protocols for the delivery of integrated video-based multimedia services over networks, including delivery over residential broadband networks to homes. Open protocols in this area are essential for widespread deployment of interactive multimedia services to homes. After describing the basic reference model of DSM-CC and its concept of session and multiresource connection, this paper examines how DSM-CC can work over broadband ATM networks. A series of ATM network architectures is described along with the DSM-CC and Q.2931 message flows that together set up sessions and allocate connections between servers and clients. The characteristics of each ATM network architecture are briefly discussed.
Vahe Balabanian, Liam M. Casey, Nancy Greene
IEEE J. Sel. Areas Commun.2
1987 A Robust Ring Transmission Protocol
Jan K. Pachl, Liam M. Casey
Comput. Networks2
1987 Remote Rendezvous
abstract
Abstract BNR Pascal is a systems programming language intended for the implementation of the systems software of distributed computing systems. It supports the Ada Rendezvous model of tasking and communication, uniformly extended to support communications between tasks distributed over the computing nodes of a system. BNR Pascal was designed and implemented in 1980, and has since been used to implement the operating systems and real‐time applications software for Northern Telecom's Meridian family of products. In total, more than 2 million lines of BNR Pascal exist. This paper describes the BNR Pascal remote rendezvous: the extension of rendezvous to interprocessor communication. It discusses the implementation of remote rendezvous, describing the advantages and disadvantages of several options. Finally, it details BNR's experience in using remote rendezvous in building substantial, practical distributed systems used in products.
Neil D. Gammage, R. F. Kamel, Liam M. Casey
Softw. Pract. Exp.3
1986 Comments on "The Design of a Reliable Remote Procedure Call Mechanism"
abstract
In the above correspondence1 a remote procedure call mechanism is proposed that uses a system-wide sequence number to eliminate duplicate and orphan messages. We show that the described mechanism also discards valid messages. A brief description is provided of an alternative scheme that avoids this problem.
Liam M. Casey
IEEE Trans. Computers1
1984 The Software Architecture of a Distributed Processing System
Neil D. Gammage, Liam M. Casey
ICDCS2
1977 A Domain Structure for Distributed Computer Systems
abstract
The successful implementation of generalized multiple computer systems will require attention both to the form of physical architecture and to the choice and implementation of a suitable systems environment in which to construct and run applications. This paper argues for the use of a multi-computer physical architecture in preference to a multi-processor architecture, and for dynamic distribution of functions and control as opposed to static allocation of functions and hierarchical control. A systems environment which is based on a domain structure is then described. The domain structure restricts sharing of items. This alleviates the main problem in implementing a capability mechanism to support domains in a system without shared memory, which is that a central table of capabilities is required. It also makes the management of the non shared items easier since they can be required only at one computer at a time. Essential sharing is also handled without central control but at the cost of some complexity. Considerable attention is paid to the handling of interdomain jumps as they provide the opportunity for the dynamic allocation of functions. It is conjectured that the resulting system would be capable of smooth expansion in size from one to twenty five computers. In operation it would exhibit dynamic load balancing as well as having the protection advantages of domain structure.
Liam M. Casey, N. H. Shelness
SOSP1