Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 10,000 papers for “distributed programming”

OO Distributed Programming Is Not Distributed OO Programming

Rachid Guerraoui

Object-oriented (OO) distributed programming is fundamentally different from building mechanisms that hide remote invocations behind traditional, centralized abstractions. The metaphor of a community of independent objects communicating by passing messages is misleading and dangerous when thinking in terms of a distributed system. That metaphor should not hide the significant difference between distributed interaction and local interaction. OO distributed programming should not be about hiding distribution behind classical abstractions of traditional or centralized OO languages. In other words, OO distributed programming should not be about building a distributed OO language or system. OO distributed programming is about viewing distribution as the application domain from which fundamental abstractions should be extracted and classified. This is a challenging area of research and taking it seriously requires going beyond wrapping existing technologies with OO-like interfaces.

Cited by 0

Distributed Meta-Programming ∗

Chiyan Chen, Rui Shi, Hongwei Xi · 2004

The need for mobile computing is evident and growing rapidly in this age of Internet. However, it is in general difficult to construct programs in support of mobile computing due to issues such as mobility (of code) and locality and heterogeneity (of resources). In this paper, we study distributed meta-programming from a type-theoretic perspective, presenting a language to facilitate the construction of programs that may generate and distribute code at run-time. In particular, we are to form a type system that can statically guarantee that only well-typed code (according to some chosen type discipline) can be constructed and then sent to a proper location for execution. To achieve this, we make use of a form of typeful code representation developed in a previous study on meta-programming. The main contribution of the paper lies in the recognition and then formalization of a typeful approach to distributed meta-programming that is simple as well as general. In addition, we have finished a prototype implementation in support of the practicality of this approach, providing a solid proof of concept.

Cited by 0

Unix Distributed Programming

Chris Brown · Medical Entomology and Zoology · 1994

Distributed programming concepts UNIX support for distributed programming on a single machine UNIX support for distributed programming over a network how to write a clients and servers using sockets the transport level interface (TLI Library) distributed programming using remote procedure calls advanced client/server topics threads and multiprocessor support.

Cited by 14

Distributed dynamic programming

Dimitri P. Bertsekas · IEEE Transactions on Automatic Control · 1982

We consider distributed algorithms for solving dynamic programming problems whereby several processors participate simultaneously in the computation while maintaining coordination by information exchange via communication links. A model of asynchronous distributed computation is developed which requires very weak assumptions on the ordering of computations, the timing of information exchange, the amount of local information needed at each computation node, and the initial conditions for the algorithm. The class of problems considered is very broad and includes shortest path problems, and finite and infinite horizon stochastic optimal control problems. When specialized to a shortest path problem the algorithm reduces to the algorithm originally implemented for routing of messages in the ARPANET.

Cited by 218

Distributed eXtreme Programming

Michael Kircher, Prashant Jain, Angelo Corsaro et al. · 2001

One of the key requirements of eXtreme Programming (XP) is strong and effective communication between the team members. To enable this strong level of communication among team members, XP emphasizes the need to have the team members physically located close to each other. However, for various reasons, it may not be feasible to have team members physically located close to each other. To address these situations, we propose a crosscutting idea called "Distributed eXtreme Programming" (DXP), which inherits the merits of XP and applies it in a distributed team environment. Our experiences show that DXP can be both effective and rewarding in projects whose teams are geographically distributed.

Cited by 0

Programming Distributed Systems

Jerome A. Feldman, James Richard Low, Paul Rovner · 1978

For a number of technical and economic reasons, distributed computing is increasing rapidly in importance. The main technical considerations are the increased performance of small machines and of communications systems relative to that of giant computers and the opportunity for greater system reliability through redundancy. The economic considerations include all of the technical ones plus additional aspects including the geographic dispersal of needs and the organizational advantages of more specialized facilities (cf. Bank of America article in Datamation [1976]). The Computer Science Department of the University of Rochester has, from its inception in 1974, directed much of its research effort toward a better understanding of distributed computing.

Cited by 12

Distributed programming in Argus

Barbara Liskov · Communications of the ACM · 1988

Argus—a programming language and system developed to support the implementation and execution of distributed programs—provides mechanisms that help programmers cope with the special problems that arise in distributed programs, such as network partitions and crashes of remote nodes.

Cited by 472Open access

Concurrent and Distributed Programming

2016

Questo documento descrive le specifiche del progetto. Ciascun gruppo (di al più due studenti) deve sviluppare una applicazione Java per simulare due protocolli di clone detection per Ad-Hoc Network: LSM [1], e RED [2]. Ci aspettiamo che il sistema sviluppato abbia le seguenti componenti: • Un file di configurazione disponibile su un server

Cited by 0

Distributed Programming in Java

2018

An application is divided into a number of units. Each unit can be programed in a different language. The original interface designed by Berkeley was for C but since then sockets have been implemented in various languages. Sockets directly use the services of the transport layer in the OSI model (UDP or TCP protocols), which in turn use the services of the network layer. This chapter discusses transmitting objects through the sockets. The mode of IP communication used, UDP or TCP, corresponds to the type of socket. Telecommunication methods for Java are based on the transfer of bytes. Remote Method Invocation (RMI) allows virtual Java machines to communicate whether they are on the same machine or on two distinct machines. The RMI registry is called rmiregistry and it possesses a hashing table where the keys are names and the values are distant objects.

Cited by 2

Effective distributed pair programming

Mark Rajpal · 2018

Pair Programming1 has quickly become a widespread technique for teams adopting Agile. The interest has gained even more popularity for those implementing Extreme Programming (XP) which is a well-known Agile methodology. There is a general agreement that pair programming works well with a pair of developers working side by side. However, that is not always possible. Distributed teams and distributed team members are becoming the norm. With that said, is distributed pair programming possible? And if so, can it be done effectively? This paper examines a project where distributed pair programming was extremely effective. Contrary to agile dogma, some individuals may perform better in a distributed manner over collocated.

Cited by 6