Zack Ives Amit, Amit Aggarwal, Jonathan Aldrich et al. · 2007
The Distributed Java Object System adds advanced naming, persistence, security, mobility, and load balancing features to Java's basic RMI communications package. Security is provided through a combination of capabilities [Dennis and Van Horn 1966] and ACLs [Saltzer 1974] that combines some of the best features of both. Objects are persistently stored through directories that provide a user-readable and location transparent naming system. Through a check pointing system, active objects allow themselves to be moved by a distributed dynamic load balancing system that tries to balance the load on different processors. This migration of objects is transparent to the user. We have written several sample applications that demonstrate the features of our system.
Cited by 0
Andrew S. Tanenbaum, Maarten Van Steen, Najafabad Branch · 2016
The first paradigm consists of distributed objects. In distributed object-based systems, the notion of an object plays a key role in establishing distribution transparency. In principle, everything is treated as an object
Cited by 0
John R. Rymer, Richard Mark Soley, William Stephen Andreas et al. · 1990
article Free Access Share on OOPSLA distributed object management Authors: John R. Rymer Seybold Office Computing Group, Moderator Seybold Office Computing Group, ModeratorView Profile , Richard Mark Soley Vice President, Object Management Group Vice President, Object Management GroupView Profile , William Stephen Andreas Staff Software Engineer, Distributed Applications Architecture, Data General Staff Software Engineer, Distributed Applications Architecture, Data GeneralView Profile , Ian Fuller Project Manager, Distributed New Wave Application Architecture, Hewlett-Packard Project Manager, Distributed New Wave Application Architecture, Hewlett-PackardView Profile , Neal Jacobson Principal Engineer, Distributed Information Systems, Digital Equipment Corp. Principal Engineer, Distributed Information Systems, Digital Equipment Corp.View Profile , Richard A. Demers Distributed Data Management Architecture, IBM Distributed Data Management Architecture, IBMView Profile Authors Info & Claims ACM SIGPLAN NoticesVolume 25Issue 10Oct. 1990 pp 331–333https://doi.org/10.1145/97946.97985Published:01 September 1990Publication History 0citation229DownloadsMetricsTotal Citations0Total Downloads229Last 12 Months10Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
Cited by 0
Alan Jeffrey · 2000
this paper, these two strands of research are brought together, to provide a model for distributed object-based languages. In doing so, two features of distributed programming become clear:
Cited by 4
Stephane Perret, John Dilley, Martin Arlitt et al. · 1999
cache replacement policy, distributed object consistency protocol, performance analysis, tracedriven simulation This report analyzes the performance of two methods for maintaining object consistency in World Wide Web proxy cache servers: the widely used Alex adaptive TTL protocol and a proposed Distributed Object Consistency Protocol (DOCP). The goal of this report is to evaluate these approaches to web cache consistency using a realistic workload and trace-driven simulation. We examine the effect of cache replacement policies and consistency protocols on cache performance. This analysis indicates that the DOCP outperforms the Alex protocol while preventing access to inconsistent objects. DOCP also improves cache response time by serving consistent objects without communicating with the origin server to check freshness. This improves fast hit rate and reduces request demand on origin servers.
Cited by 0
E. D’Azevedo · 1994
This report describes the use and implementation of DOLIB (Distributed Object Library), a library of routines that emulates global or virtual shared memory on Intel multiprocessor systems. Access to a distributed global array is through explicit calls to gather and scatter. Advantages of using DOLIB include: dynamic allocation and freeing of huge (gigabyte) distributed arrays, both C and FORTRAN callable interfaces, and the ability to mix shared-memory and message-passing programming models for ease of use and optimal performance. DOLIB is independent of language and compiler extensions and requires no special operating system support. DOLIB also supports automatic caching of read-only data for high performance. The virtual shared memory support provided in DOLIB is well suited for implementing Lagrangian particle tracking techniques. We have also used DOLIB to create DONIO (Distributed Object Network I/O Library), which obtains over a 10-fold improvement in disk I/O performance on the Intel Paragon.
Cited by 4Open access
David H. Patton · IGI Global eBooks · 2011
Tomorrow’s business environment will make it increasingly difficult for businesses to operate efficiently. To gain the needed edge, in the global economy, many businesses are looking towards information technology. By utilizing technology as a conduit, companies are able to leverage their greatest asset: their internal knowledge base. This chapter presents a framework for architecting enterprise-wide object based information systems. These next-generation systems maximize information value throughout the enterprise, while reducing development time and effort throughout the system lifetime. By presenting a complex concept in a pragmatic fashion this chapter should provide benefit for both information architects and business managers.
Cited by 0
Isidore Rigoutsos, Robert A. Hummel · 2002
A new paradigm for performing realistic object recognition is presented. It is shown how several intuitive notions in the context of geometric hashing can be translated into a well-founded Bayesian approach to object recognition. This interpretation leads to well-justified formulas and gives a precise weighted-voting method for the evidence-gathering phase of geometric hashing. A computational model for performing object recognition in a distributed fashion is described. The validity of the authors' paradigm is demonstrated by presenting a prototype system that has been implemented on a small cluster of nondedicated workstations. The resulting system is scalable and can recognize models subjected to 2-D rotation, translation and scale changes in real-world digital imagery. The performance of the system is superior by a factor of 2 to that obtained for a similar system on the Connection Machine-2 (CM-2).< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Cited by 19
Fred Hebbel · 2002
Distributed Objects is one of four competing technologies which include SQL Databases, TP Monitors and Groupware. The promise of Distributed Objects is that the partitioning of systems across networks will become more flexible, more homogeneous, more standardized, resulting in less difficulty to develop future applications. As the name implies, Distributed Objects encompasses two paradigms: the notion of distribution and the notion of object orientation These two concepts converge in what is referred to as middleware. Middleware is the somewhat nebulas domain in-between clients and servers where a great deal of time and effort is often spent in developing applications. In a properly designed Distributed Object System, enterprises have the ability to access any information by any system (or user) which has proper authorization and do so in a uniform and consistent fashion. In an admittedly oversimplified decomposition, two things are required to do this. The first is to make everything (including legacy systems) appear to be object oriented, and the second is to be able to access those objects across systems boundaries.
Cited by 3
D. R. McGregor · 1990
Ever more extensive computer systems are required by complex, multi-centre organisations. The distributed object oriented systems model matches well to these requirements, combining the attractive properties of persistent object systems with the contents addressability of the conventional relational model. The author focuses on the application of the object oriented model in large-scale concurrent distributed database systems. In designing a really large scale and complex system such as a major healthcare application, the simplest approach is to build a model of the existing human organisation and its information systems. Fortunately, with today's technology this is also a cost/effective approach to implementation.
Cited by 0
2017
Cited by 0
Dedecker · 2003
Introduction Prototype-based languages (PBLs) are good at sharing information between objects, while sharing is a ubiquitous problem in distributed application programming (due to concurrency and partial failures). New language concepts can exploit the advantages of PBLs to ease the distribution problems. Distributed Object Inheritance Objects can share information with each other through the use of object inheritance. When an object receives a message that it does not know it can delegate that message to its object parent, which then executes that message in the context of original receiver. The child - parent object relation may be distributed over multiple machines. Communication Patterns Object inheritance raises the split object problem. The split object problem can be solved by transparent multicast messages, depending on the required semantics of the split object. Multicast messages are introduced via: WE keyword Multivalue references Per Object When objects are concu
Cited by 0
Frank Manola · 1989
Cited by 8
Yuan-Heng Lee, F.J. Wang, Chih‐Hung Chang · Information Sciences · 1994
Cited by 3
Kottmann, Dietmar, Lockemann, Peter C., Walter, Hans-Dirk · KITopen · 1995
It is an emerging trend to build large information systems in a component-based fashion where the components follow the concept of object. Applications are constructed by organizing pre-built objects such that they cooperate with each other to perform some task. However, considerable programming effort is required to express multi-object constraints in terms of the traditional message-passing mechanism. This observation lead many authors to suggest communication abstractions in object models. One promising approach is to separate multi-object constraints from the objects and collect them into a separate construct. We call this construct an alliance. Unlike other approaches we allow alliances to involve large sets of long-lived objects which may dynamically vary during the - also potentially long - life-time of the alliance. Alliances are not only visible at the specification level but are also computational entities which enforce multi-object constraints at run-time. They do so in an unreliable world, i.e., we do not assume that objects will always meet their obligations in a cooperation. Since objects may often be distributed across a network, we demonstrate that alliances are an ideal place to deal with aspects of distribution in an application-specific manner. We illustrate our thesis by one of the key questions of distributed object management: where shall objects be located and when shall they migrate to which node? We show that alliances allow for customized distribution policies which are neither "hardwired" into the objects nor necessitate a centralized distribution control.
Cited by 0Open access
Konstantinos Raptis, Diomidis Spinellis, Sokratis Katsikas · 2000
An important aspect of research on software objects, components, and component-based applications concerns their interoperation. Is their interoperation technically possible? Which elements are responsible for the software objects’ incompatibility? Is compatibility a responsibility of the objects or of their underlying architectures? In this article we discuss the object compatibility problems, we describe basic strategies for bridging the gap between the three basic middleware remoting technologies (CORBA, DCOM, and RMI), and present our approach for a Java-based Object Mediator architecture.
Cited by 1
Douglas C. Schmidt, Steve Vinoski · 1995
Cited by 0
Douglas C. Schmidt, Steve Vinoski · 1995
this article provide varying degrees of support for these requirements. In general, the current generation of commercially available DOC frameworks handle certain requirements fairly well (such as network heterogeneity, object location and selection, synchronous communication and threading, deferred activation, security, and binary data exchange). Other requirements are not handled as thoroughly at this point (such as OS heterogeneity, reliability and availability, load balancing, and interoperability). Naturally, there are exceptions to these generalizations (e.g., Isis supports fault tolerant DOC and OODCE handles interoperability quite well). We expect the next-generation DOC frameworks to provide more comprehensive and better integrated support for common distributed application requirements. 3 Concluding Remarks
Cited by 0
Ian Taylor, Andrew Harrison · Computer communications and networks · 2008
Cited by 0
Steve Vinoski · 1993
The Object Management Group (OMG) was formed in 1989 with the purpose of creating standards allowing for the interoperability and portability of distributed object-oriented (OO) applications. Unlike the Open Software Foundation (OSF), the OMG does not actually produce software, only specifications. These specifications are created using ideas and technology from OMG members who respond to Requests For Information (RFI) and Requests For Proposals (RFP) issued by the OMG. A strength of this approach is that most of the major players in the commercial distributed OO computing arena are among the several hundred companies that belong to the OMG.
Cited by 80