Topic
Name resolution (programming languages)
About: Name resolution (programming languages) is a research topic. Over the lifetime, 271 publications have been published within this topic receiving 1746 citations.
Papers published on a yearly basis
Papers
Patent•
19 Oct 1995TL;DR: In this paper, the authors propose a method of managing resources in a high-flexible distributed system providing name spaces for performing local resource access every users, which reflect preference and intentions for an access method by each individual user.
Abstract: When the name of a resource is inputted to a given context holder, a name analysis unit analyzes the name and a name translation unit converts it into first or second resource implementation representations. A name resolution unit receives the first or second resource implementation representations from each context holder. When the result of conversion is of the second resource implementation representations, the name resolution unit outputs a resource name of a second series or string of resource elements included in the second resource implementation representations to its corresponding context holder. This operation is executed on a chain basis to solve the name. A resource implementation unit outputs a handle for the resource corresponding to the result of name resolution therefrom. A user can obtain access to a virtual resource corresponding to the input name by using the handle. Owing to the above construction, an apparatus for and a method of managing resources can be provided which is capable of embodying a high-flexible distributed system providing name spaces for performing local resource access every users, which reflect preference and intentions for an access method by each individual user.
145 citations
Patent•
22 May 1981
TL;DR: In this paper, the meaning of a given operation code is determined by the operation code set to which the instruction belongs, and a name resolution system for deriving the address of the data item represented by a name from the name using an architectural base address.
Abstract: A digital computer system including a memory and a processor. The memory operates in response to memory commands received from the processor. Items of data stored in the memory include instructions to which the processor responds. Each instruction contains an operation code which belongs to one of several sets of operation codes. The meaning of a given operation code is determined by the operation code set to which the instruction belongs. Some of the instructions also contain names representing items of data used in the operation specified by the operation code. The processor includes an operation code decoding system which decodes the operation code as required for the instruction set to which it belongs, a name resolution system for deriving the address of the data item represented by a name from the name using an architectural base address contained in the name resolution system, and a control system which controls the operation of the processor. The processor performs a call operation and a return operation. Only the call operation and the return operation may change the current architectural base address. The memory further contains name table entries associated with the names. Each name table entry contains information used by the name resolution system when it resolves a name.
62 citations
[...]
TL;DR: The limitations of the shared-memory and distributed-memory models for explicit parallel programming are discussed and a new model, the Linda parallel communication paradigm which was designed specifically for parallel programming, is examined, and a specific instance, QIX, is presented.
Abstract: The limitations of the shared-memory and distributed-memory models for explicit parallel programming are discussed and a new model, the Linda parallel communication paradigm which was designed specifically for parallel programming, is examined. Processes communicate in Linda by way of a shared data space called tuple space which acts something like an associative memory, since tuples are identified by matching on a key rather than using a specific address. This model is adapted for use as the basis of a new class of operating systems and a specific instance, QIX, is presented. Like Linda, this operating system model can support both the shared-memory and the distributed-memory styles of programming. Thus, it provides the benefits of both, while avoiding hardware dependencies. QIX also incorporates a novel scheme for name resolution that is easier to use than other methods and provides significant benefits in the operating system and it directly supports communication between programs written in different languages. >
56 citations
30 Oct 2002
TL;DR: This paper proposes a scalable, locality-aware, and fault-tolerant name resolution scheme which can be considered a simplified version of PRR, and exploits locality heuristically yet effectively.
Abstract: An efficient name resolution scheme is the cornerstone of any peer-to-peer network. The name resolution scheme proposed by Plaxton, Rajaraman, and Richa, which we hereafter refer to as the PRR scheme, is a scalable name resolution scheme that also provides provable locality properties. However, since PRR goes to extra lengths to provide these locality properties, it is somewhat complicated. In this paper, we propose a scalable, locality-aware, and fault-tolerant name resolution scheme which can be considered a simplified version of PRR. Although this new scheme does not provide as strong locality guarantees as PRR, it exploits locality heuristically yet effectively.
52 citations
Performance Metrics
| Year | Papers |
|---|---|
| 2021 | 1 |
| 2020 | 11 |
| 2019 | 26 |
| 2018 | 30 |
| 2017 | 27 |
| 2016 | 21 |