Showing papers on "Shared resource published in 1993"

Network objects

Abstract: A network object is an object whose methods can be invoked over a network. This paper describes the design, implementation, and early experience with a network objects system for Modula-3. The system is novel for its overall simplicity. The paper includes a thorough description of realistic marshaling algorithms for network objects.

Communications resource assignment in a wireless telecommunications system

Abstract: Fast resource assignments, especially needed in microcellular network architectures having many fast moving subscribers and high traffic volume, is provided through the use of a priority based resource assignment apparatus and procedure. Part of the communications resources in a cellular network, for example, one carrier frequency and/or one time slot, or particular code division multiple access sequences are dedicated to the execution of the assignment procedure. Available communications resources are auctioned to cellular subscribers contending for resources based upon a level of priority assigned to each contending subscriber. The priority level may be based on such things as the quality of service to which a customer subscribes or the particular needs of a subscriber at the time the subscriber is contending for resources, for example, the subscriber's request for resources may be prompted by a need to make a handoff. The procedure involves an auction period when a determination is made regarding which of a group of contending subscribers has the highest priority level. The procedure then enters a resource assignment period where an available communications resource is actually assigned to the subscriber having the highest priority level. The auction and assignment periods are then repeated for the remaining contending subscribers until there are no longer any contending subscribers or there are no longer any available resources. Fast resource assignment could be used to increase system capacity and efficiency of spectrum utilization through the ability to perform speech activity resource sharing.

A space based model for user interaction in shared synthetic environments

Abstract: In a distributed shared synthetic environment with provisions for high quality 3D visualization and interaction, it is possible to implement a powerful variant of a rooms/space metaphor based on the concept of presence or proximity between participants in 3D space. This kind of model can be used as an interface between the user and the computer, for overview and control of applications, file systems, networks and other computer resources, as well as for communication and collaboration with other users in the networked environment. We model proximity with a geometric volume of the immediate surroundings, the aura, of the participant's representation in the synthetic environment. This proximity, or aura, is used to establish presence at meetings, to establish communication channels and to provide interaction.

Distributed processing object shared resource control apparatus and method

Abstract: A system and method for determining a master process for control of a shared system resource. The improved system requires the master process to hold exclusive access on a shared resource control file only intermittently. The master process periodically updates the shared resource control file with a new timestamp. Processes seeking resource access read the shared control file and determine whether another process has been designated master. If the interval since the latest timestamp is greater than a preset staleness interval, the shared control file is discarded and a new one created by the accessing process.

Arbitration protocol system granting use of a shared resource to one of a plurality of resource users

Abstract: An arbitration protocol comprises the steps of receiving a plurality of resource request signals (12), comparing the received plurality of resource request signals to a rotating pointer (14), and either granting the shared resource to the resource user specified by the rotating pointer (16) and incrementing the rotating pointer (18) or granting the shared resource to a resource user according to fixed priority protocol (20, 22, 24, 26 and 28). The rotating pointer specifies one of a plurality of resource users according to a predetermined order. The two steps of granting are responsive to the step of comparing.

A remote file system for heterogeneous network topologies

Abstract: Achieving high performance in a distributed computing environment is a combination of efforts between the network, distributed operating systems, and the applications. All too often the focus of improvement excludes the opportunity for the application to make an impact on performance. In this study we provide a facility where the application characteristics can be employed in formulating a distributed solution. The specific problem being considered is remote file services, although the general ideas can be applied to other areas. Our file system permits the application to indicate the type of caching and transfer strategies most suitable for each remote file access instance: depending on the application will effect the load realized on the network. Earlier work provided techniques to characterize application behavior through simple profiles. This profile data can be employed in selecting what kind of caching and transfer strategies would be most suitable to minimize traffic on the network. We describe the architecture of our file system. We show how the system provides for efficient network performance by realization of reduced traffic on the network for each application. This application data approach will always provide better performance than any random based model design. >

System and method of data transfer

Abstract: A system and method are provided wherein a user of an interconnected computer system can identify a specific piece of data and then access this data from another computer in the network. It is often desirable for data to be capable of being displayed and manipulated from another system during meetings, discussions and the like. The user who wishes to transfer a file to another system simply points an untethered stylus to a representation of a file, such as a filename, icon, or the like and then selects the file to be transferred. The user then carries the stylus to a remote interconnected computer and points the stylus at the remote computer which verifies the identity of the stylus and obtains a path to the selected file. The data file is then transferred from the user's computer to the remote computer through the network.

Multi-agent coordination and cooperation in a distributed dynamic environment with limited resources: simulated air wars

Abstract: Coordination and cooperation are two major issues of concern in Distributed Artificial Intelligence (DAI) systems. How can a group of geographically distributed agents properly allocate a set of tasks among themselves? Also, in an environment of limited resources, how can agents resolve resource conflicts so as to effectively accomplish tasks? This research has examined these two problems and has implemented techniques to promote multi-agent coordination and cooperation. A method of negotiation allows agents to bid for tasks based upon the agents' capabilities. Furthermore, the use of a threshold value ensures that only the best agents for a task become task commanders, as well as allowing some tasks to be re-negotiated as agents improve their bids. To resolve resource conflicts, a technique known as Hierarchical Iterative Conflict Resolution has been used. This technique allows conflicts to be resolved in an iterative manner, based upon a hierarchy of task priorities. Agents with higher priority tasks have preference for borrowing resources from agents with lower priority tasks. This ensures that higher priority tasks will be solved before those of lower priority. These two techniques were employed in a DAI testbed which simulates an air war environment. Empirical studies were conducted using the testbed. The studies consisted of air war simulations between two opposing forces. During the simulations, tasks (air missions) had to be accomplished. Various decision making entities were examined in this study--human decision makers, distributed computer agents with resource sharing, distributed computer agents without resource sharing, and a single computer agent. The results of the studies indicate that within a dynamic and volatile environment, distributed agents sharing resources can achieve a higher level of task accomplishment than the other decision making entities.

Resource sharing schemes for state owned land in Zimbabwe: A discussion of conceptual issues needing consideration in the development and planning of co-management regimes

Abstract: ................................................... 3 PREFACE.................................................... 4 INTRODUCTION .............................................. 5 A DIFFERENT MODEL RESOURCE SHARING .................... 6 THE CURRENT CONTEXT THE MAFUNGABUSI EXAMPLE ............... 6 CONCEPTUAL ELEMENTS INHERENT TO THE RESOURCE SHARING MODEL . 11 There are Resource Problems on Both Sides of the Bound­ ary ................................................. 11 The Legitimacy of H i s t o r y .............................. 13 Mental Maps and the Basket of Resources.............. 14 The Constraints of Managerial Mental Maps ............ 15 The Definition of Targeted communities ................. 17 Spatial Proximity and the Definition of Community . 18 Class Membership as a criterion for Community . . . 19 Political/Administrative Units as Communities . . . 19 PRESCRIPTIONS FOR THE DEVELOPMENT OF RESOURCE SHARING PRO­ JECTS .................................................22 Localize authority........................................ 22 The status quo is not a bad s t a r t ..................... 23 Make it l e g a l ........................................... 23 Make It Legitimate and Create Authority..............25 Change the L a w ..................................... 25 Make It Convenient................................. 26 Make It Clear....................................... 27 Good Planning Looks at Both Sides of the Protected Area Bo u n d a r y ........................................... 27 Handholding and the Iterative Learning Approach . . . . 29 CONCLUDING REMARKS ........................................ 32 CITATIONS................................ ..................3 2

Implementation of string mode: a multi-link broadband network protocol

Abstract: The paper presents a summary of the research currently being undertaken within the RACE R2016 STRATOSPHERIC project to improve the efficiency of ATM-based networks through the use of a string mode protocol. The string mode is a multi-link transmission protocol, conceived within the RACE project R1014 ATMOSPHERIC. It provides improved network performance through resource sharing and load balancing. The paper concentrates on the first network implementation. >

Design of a file server operating system

Abstract: This paper describes the design of a file server operating system called Cypress. The design of Cypress is aimed at improving the file server response time through exploiting latest hardware advances. Cypress is distinctive in its caching and management strategies that take advantage of the large-capacity disk caches, tens to hundreds megabytes, and the powerful processors in contemporary file servers. If compared with general-purpose operating systems that are installed to perform file server operations, Cypress enjoys another advantage of featuring more predictable response time for real-time applications. Based on our measurement on our first version of implementation, the average hit response times of Cypress when running on a Intel 80486 CPU based PC with 32-megabyte memory are 1.38 ms and 1.39 ms for read and write requests, respectively. >

Impact of Technology on Resource Sharing: Experimentation and Maturity

Abstract: ContentsExperimentation and Maturity: A Prelude to Cycles * A Union Catalog on CD-ROM: Tool for Resource Sharing? The Houston Area Research Library Consortium CD-ROM Union Catalog Project * The OCLC/AMIGOS Collection Analysis CD A Unique Tool for Collection Evaluation and Development * Social Science Perspectives on Cooperative Collection Development * Building a Nationwide Bibliographic Database: The Role of Local Shared Automated Systems * Resource Sharing and System Interconnection * The Z39.50 Protocol: An Implementor?s Perspective * Internetworking: New Opportunities and Challenges in Resource Sharing * High School Education and the Internet: The Davis Senior High School Experience * Technology-Driven Resource Sharing: A View of the Future * An Annotated Bibliography on Networking: Past, Present, and Future

Resource and service trading in a heterogeneous large distributed system

Abstract: The authors describe a new class of name and resource management facility - a trading service - which allows users of a heterogeneous large distributed system to share resources and services (resources) which are not available in their local systems. A distributed implementation of a trading service which provides name and location transparency to users is presented. This trading service is based on both attribute names and mutual cooperation of a number of independent trading servers (traders). The authors demonstrate that resource sharing among heterogeneous local systems can be achieved by introducing the concepts of export and import of resources to/from different local systems, and that a trading service based on attribute names can easily deal with name heterogeneity problems resulting from the different name schemes used by underlying local operating systems.

Volume resource managing system in virtual computer system

Abstract: PURPOSE:To perform the management of the same resource of a real volume device including even the nonexclusive control of a file by plural virtual computers and to efficiently execute shared resource control. CONSTITUTION:The virtual computers (alpha), (beta) are provided with virtual storage managing functions by a segmentation system, and are operated under the control of the same kind of operating systems 2, 3. A real volume device 6 can be shared with the virtual computers (alpha), (BETA), and is connected to a real computer system. A file managing part 5 performs the assignment management of file resource of the real volume device 6 by performing file exclusive control relating to the assignment request of the file resources for the real volume device 6 outputted from the jobs of the operating systems 2, 3, and also, performs the release management of the file resource for the release request of the file resource. The file managing part 5 is shared with the virtual computers (alpha), (beta) by installing in a system shared address space 7 by the virtual storage managing function of the virtual computers (alpha), (beta).

Spreading the ILLINET: A Distributed Network for Library Resource Sharing in Illinois

Abstract: Describes the development of a plan to facilitate library resource sharing in Illinois by means of a decentralized network architecture based on TCP/IP communications and the Z39.50 and Interlibrary Loan (ILL) protocol standards.

Interfacing a high performance disk array file server to a gigabit LAN

Abstract: The design and implementation of the network architecture (hardware, software, and protocols) of the RAID-II system are described. RAID-II is a high-speed file server connected to an UltraNetwork. To support high bandwidth network transfers with the RAID-II server, the networking software is divided among the various processors in the system. With the distributed software, the CPU still limits the RAID-II file server to 21 Mbyte/s of data bandwidth on the authors' network.

Modeling restrictive processes that involve blocking requests

Abstract: A decomposition method is given for showing restrictiveness that supports shared resource handling. The author splits a process into two subprocesses representing the server and client. The client process may request information and block until the information is sent. The server process will provide information when requested. This kind of method supports a natural way of expressing models using a shared resource such as file system. The author presents both the theoretical basis for the method as well as how it can be practically applied. >

A mutual exclusion algorithm for a distributed network of autonomous nodes

Abstract: Mutual exclusion is treated in distributed autonomous environments. The most important property of the autonomous network treated here is its membership variability, that is, frequency occurrence of entries of new nodes and exits of old nodes. Thus, when the network is large-scale, it is not possible for each node to keep up the information of all other nodes. The authors have previously designed a mutual exclusion algorithm of the single shared resource case for distributed environments of autonomous nodes, based on the Chandy-Misra protocol for Dining Philosopher (diners) problems (K. M. Chandy and J. Misra, 1984). Mutual exclusion of multiple shared resource cases is considered. The condition that no more than k nodes can use the shared resource is given. Since the acyclic graph model used in the model can be represented by a marked graph model, this model is used in analysis. >

Adaptive Channel Allocation in Cellular Networks With Multi-User Platforms

Abstract: This paper proposes a hardware solution to the efficient utilization of cellular networks with single-and multi-terminal platforms. In such networks, a mobile platform (e.g., an airplane) can carry more than one wireless terminal. A good utilization of available channels as a shared resource is important for quality and efficient communications in the network. In this paper, we propose the Integrated Channel Manager (ICM), an architecture for fast adaptive channel allocation. It is an integrated controller connected to the system bus within the network switch. Its main advantage is a fast allocation of available channels when a request for a call initialization or a hand-off exists. Its efficiency is achieved via channel allocation functions supported by a hardware with high degree of parallelism. The ICM supports both single and multiple hand-offs. It allows an efficient rejection of a call when the call cannot be supported. Thus, it reduces the processing overhead for rejected calls.

Adaptive resource sharing for satellite TDMA

Abstract: A method used to improve the link quality of a satellite TDMA network using adaptive resource sharing (ARS) is presented. The TDMA network considered is an experimental 20/30 GHz satellite network operated via the satellite DFS Kopernikus. ARS provides a means to distribute a common resource within the network. The common resource in a TDMA system is an additional time slot. This spare time is used for lowering the code rate and/or the data rate. This results in a lower bit error rate (BER) and a better link quality. Another resource used is the uplink transmit power to compensate for uplink fades. The paper describes the ARS strategy and the uplink power control (ULPC) implemented in the experimental 20/30 GHz TDMA satellite network.

The Business Information Network: Improving European enterprise through resource sharing

Abstract: The UK Business Information Network was formed in 1990 as an independent self-financing co-operative of public, government, and academic libraries committed to delivering quality products and services to their user communities. Promoted as a national resource for business people both within and outside the UK, the Network has subsequently been extended with the introduction of associate membership for commercial information suppliers. In1992 it was awarded formal status as the Business Information Panel of the UK Library and Information Co-operation Council (LINC) with a remit to review, encourage, and facilitate co-ordination of business information provision nationally across all sectors. Its current activities include production of a referral database/directory of expertise and resources; organization of seminars and workshops; negotiation of terms and conditions with suppliers; development of quality of service guidelines; and circulation of a regular newsletter. A recent initiative is the creation of an electronic mail forum using the Joint Academic Network (JANET) for business information specialists in university libraries to exchange views on issues of mutual concern. The UK Business Information Network has also established links with organizations and institutions in other countries, and has served as the model for the formation of an equivalent network in Denmark.

Resource sharing of real-time applications with other applications

Abstract: Most real-time applications run on dedicated system, to eliminate the uncertainty that may arise if other applications are running on the system. The resource requirement for the real-time application is determined on the basis of the system's ability to provide fault tolerance under the worst case execution time assumption. Costs of such systems will be better justified, if the real-time applications share the resources with other non real-time applications (such as, batch jobs), without compromising the real-time deadlines. Assuming a real-time application to consist of a set of optional and mandatory subtasks with time-critical precedence constraints among them, the problem of scheduling these subtasks on such a shared system so as to optimize the use of resources and execute time-critical applications with sufficient accuracy is addressed. >