this paper documents the design and implementation of a quality of service (QoS) negotiation procedure for distributed multimedia (MM) presentational applications, such as news-on-demand. the negotiation procedure des...
详细信息
this paper documents the design and implementation of a quality of service (QoS) negotiation procedure for distributed multimedia (MM) presentational applications, such as news-on-demand. the negotiation procedure described here is an instantiation of the general framework for QoS negotiation which was developed earlier. the proposal differs in many respects withthe negotiation functions provided by existing approaches. Firstly, the negotiation process uses an optimization approach to find a configuration of system components which supports the user requirements. Secondly, the negotiation process supports the negotiation of a MM document and not only a single monomedia object. thirdly, the QoS negotiation takes into account the cost to the user. Finally, the negotiation process may be used to support automatic adaptation to react to QoS degradations, without intervention by the user/application.
the information retrieval systems on a wide area distributed network, such as the World-Wide Web(WWW), become popular among the extremely large number of users. the caching proxy has an important role on these systems...
详细信息
the information retrieval systems on a wide area distributed network, such as the World-Wide Web(WWW), become popular among the extremely large number of users. the caching proxy has an important role on these systems for improving their accessibility and serviceability. the caching proxy mechanism is discussed in this paper as follows: First, the role and structure of the caching proxy are explained, and two major problems of existing systems are pointed out. Our solution to overcome these problems is proposed next. Changing a file size, by controlling a quality level of cached multimedia data, is proposed as a measure to overcome one problem. As a solution to the other problem, making a cluster among neighboring caching proxies, using hyperlink information, is proposed. Finally, an improved caching proxy mechanism based upon these ideas is shown.
this paper proposes a framework for the systematic design of directory-based distributed applications. We evaluate a space of directory designs using our framework. We present a case study consisting of design, implem...
详细信息
this paper proposes a framework for the systematic design of directory-based distributed applications. We evaluate a space of directory designs using our framework. We present a case study consisting of design, implementation and analysis of directories for a multicast application. Our framework is based on a model that extends the formal concept of process knowledge in distributed systems. this concept is used informally in phrases such as 'process p knows when it is in state s that process q is active.' We show that this definition of knowledge is too strong for many distributed applications, including directory design. We propose a weaker concept: estimation. We describe the meaning of phrases of the form: 'process p in state s estimates with probability 0.9 that process q is active.' We specify directory design as an optimization problem withthe objective function of maximizing estimation probabilities, and with constraints on the amount of bandwidth, computation and storage used. We show how this specification helps in a systematic analysis of alternative directory designs.
Considers a parallel triangular solver on a distributed-memory MIMD computer. three task partitioning methods are discussed, with both task assignment and task scheduling. their estimated times are provided by using a...
详细信息
ISBN:
(纸本)9780818675829
Considers a parallel triangular solver on a distributed-memory MIMD computer. three task partitioning methods are discussed, with both task assignment and task scheduling. their estimated times are provided by using a performance model and a parallel performance evaluation methodology. the optimal task granularities are deduced by the analysis of their performance. Experiences on a transputer-based multicomputer are given.
the rise of explicit parallel programming involves new problems: lack of structure for parallel algorithms and the ad hoc development of parallel algorithms. We use skeletons to characterize and design parallel algori...
详细信息
ISBN:
(纸本)0818675829
the rise of explicit parallel programming involves new problems: lack of structure for parallel algorithms and the ad hoc development of parallel algorithms. We use skeletons to characterize and design parallel algorithms and define a process to refine the designs step by step into programs. the paper introduces a high level library on top of MPI which is derived from the skeleton concept to achieve better programmability and obtain portability. We conclude with a CFD application to demonstrate our idea.
In order to use networks of workstations in parallel processing applications, several schemes have been devised to allow processes on different, possibly heterogeneous, platforms to communicate with one another. the M...
详细信息
In order to use networks of workstations in parallel processing applications, several schemes have been devised to allow processes on different, possibly heterogeneous, platforms to communicate with one another. the Message-Passing Interface (MPI) is one such scheme that allows for message-passing across different architectures. the MPI specification does not make provisions for the migration of a process between machines. this paper describes the work required to modify, an MPI implementation to allow for task migration. It also describes "Hector", our heterogeneous computing task allocator that is used to migrate tasks automatically and improve the overall performance of a parallel program.
Dedicated cluster parallel computers (DCPCs) are emerging as low-cost high performance environments for many important applications in science and engineering. A significant class of applications that perform well on ...
详细信息
Dedicated cluster parallel computers (DCPCs) are emerging as low-cost high performance environments for many important applications in science and engineering. A significant class of applications that perform well on a DCPC are coarse-grain applications that involve large amounts of file I/O. Current research in parallel file systems for distributed systems is providing a mechanism for adapting these applications to the DCPC environment. We present the parallel Virtual File System (PVFS), a system that provides disk striping across multiple nodes in a distributedparallel computer and file partitioning among tasks in a parallel program. PVFS is unique among similar systems in that it uses a stream-based approach that represents each file access with a single set of request parameters and decouples the number of network messages from details of the file striping and partitioning. PVFS also provides support for efficient collective file accesses and allows overlapping file partitions. We present results of early performance experiments that show PVFS achieves excellent speedups in accessing moderately sized file segments.
We present Skil, an imperative language enhanced with higher order functions and currying, as well as with a polymorphic type system. the high level of Skil allows the integration of algorithmic skeletons, i.e. of hig...
详细信息
ISBN:
(纸本)9780818675829
We present Skil, an imperative language enhanced with higher order functions and currying, as well as with a polymorphic type system. the high level of Skil allows the integration of algorithmic skeletons, i.e. of higher order functions representing parallel computation patterns. At the same time, the language can be efficiently implemented. After describing a series of skeletons which work withdistributed arrays, we give two examples of parallel programs implemented on the basis of skeletons, namely shortest paths in graphs and Gaussian elimination. Run time measurements show that we approach the efficiency of message passing C up to a factor between 1 and 2.5.
In this paper, we discuss the runtime support required for the parallelization of unstructured data-parallel applications on nonuniform and adaptive environments. the approach presented is reasonably general and is ap...
详细信息
In this paper, we discuss the runtime support required for the parallelization of unstructured data-parallel applications on nonuniform and adaptive environments. the approach presented is reasonably general and is applicable to a wide variety of regular as well as irregular applications. We present performance results for the solution of an unstructured mesh on a cluster of heterogeneous workstations.
One of most serious problems plaguing the World Wide Web today is that of broken hypertext links, which are a major annoyance to browsing users and also a cause of tarnished reputation and possible loss of opportunity...
详细信息
One of most serious problems plaguing the World Wide Web today is that of broken hypertext links, which are a major annoyance to browsing users and also a cause of tarnished reputation and possible loss of opportunity for information providers. the root of the problem lies in the current Web architecture's lack of support for referential integrity. this paper presents a model for the provision of referential integrity for Web resources which supports resource migration and tolerates site and communication failures. the approach is object-oriented, highly flexible, completely distributed, and does not require any global administration. An attractive feature of our design is the provision of a lightweight mechanism which provides referential integrity, and which may be customised on a per resource basis to provide increased fault-tolerance and performance. Our system follows an evolutionary approach, supporting parallel operation withthe existing Web, allowing users to gain the additional benefits of referential integrity while allowing continued access through trusted software components.
暂无评论