the conventional load representation method expressing a load as queue length has a weakness in that it does not reflect execution characteristics of processes. To solve the inaccuracy of this conventional method of l...
详细信息
ISBN:
(纸本)0780318625
the conventional load representation method expressing a load as queue length has a weakness in that it does not reflect execution characteristics of processes. To solve the inaccuracy of this conventional method of load representation, we propose the weighted load representation method which assigns graded weights to processes based on the execution characteristics of processes. the proposed method uses history information obtained during process scheduling. In order to derive the upper bound and the lower bound of the load in a node, the finite population queuing model is used. We devise heuristics for adaptive load sharing using the proposed representation method and derived upper and lower bounds. Simulation results show that GRRs of weight functions log i and i are improved 2.37-3.14 times compared with no load sharing and 14-24% as many as GRRs of the conventional load representation method.< >
Presents a computerized procedure for the assessment of distribution system planning. the proposed procedure was developed on a personal computer and is good for a designated area where multiple existing substations a...
详细信息
ISBN:
(纸本)0780318625
Presents a computerized procedure for the assessment of distribution system planning. the proposed procedure was developed on a personal computer and is good for a designated area where multiple existing substations and multiple potential sites are considered. this procedure employs load flow analysis and considers the constraints of voltage drops and line flows. Various options are provided to satisfy the load. Losses and costs are evaluated for each case. An example is shown for a designated area and a target year, where the number of new feeders, transformers, substations and associated costs and losses were found for each option. the presented procedure could be deemed as a short-range planning method.< >
Ray tracing is one of the computer graphics techniques used to render high quality images. Unfortunately, the ray tracing of complex scenes can require large amounts of CPU time, making the technique impractical for e...
详细信息
Ray tracing is one of the computer graphics techniques used to render high quality images. Unfortunately, the ray tracing of complex scenes can require large amounts of CPU time, making the technique impractical for everyday use. Since the ray tracing calculations that determine the values of individual pixels are independent, this appears to be an easy problem to parallelize, and parallel algorithms have been proposed. However, pixel computation times can vary significantly, and naive attempts at parallelization give poor speedup due to the load imbalance between the processors. the key to achieving high parallel efficiency is to ensure that the computational load is evenly balanced. In this paper, we propose two new load balancing schemes and evaluate their performance for ray tracing on parallel processors. We term the new methods 'local distributed control' (LDC) and 'global distributed control' (GDC). Our new strategies are complementary: GDC performs forms well for high computational complexity images and LDC works well for low computational complexity images.< >
A topic that is currently inspiring a lot of research is parallel (distributed) computation of transitive closure queries. In the disconnection set approach has been introduced as an effective strategy for such a comp...
详细信息
ISBN:
(纸本)0818635703
A topic that is currently inspiring a lot of research is parallel (distributed) computation of transitive closure queries. In the disconnection set approach has been introduced as an effective strategy for such a computation. It involves reformulating a transitive closure query on a relation into a number of transitive closure queries on smaller fragments;these queries can then execute independently on the fragments, without need for communication and without computingthe same tuples at more than one processor. Now that effective strategies as just mentioned have been developed, the next problem is that of developing adequate data fragmentation strategies for these approaches. this is a difficult problem, but of paramount importance to the success of these approaches. We discuss the issues that influence data fragmentation. We present a number of algorithms, each focusing on one of the important issues. We discuss the pros and cons of the algorithms, and we give some results of applying the algorithms to different types of graphs. this last aspect shows to what respect the algorithms indeed conform to the goals we set out.
this paper presents a brief overview of a notional airborne application scenario that requires both multilevel security and real-time processing. It was used to guide decisions related to formation of the security pol...
详细信息
this paper presents a brief overview of a notional airborne application scenario that requires both multilevel security and real-time processing. It was used to guide decisions related to formation of the security policy interpretation, the operating system interface, and the system services design for a multilevel secure real-time distributed operating system (MLS RT DOS) called Secure Alpha. We compare secure and nonsecure application designs for the scenario to assess the effects of MLS RT DOS security features on the structure of the application. the comparison reveals that the security features make real-time scheduling and the construction of robust applications more difficult for this scenario.< >
In 1988, MIT9;s central computing organization, Information Systems, created a Network Services department. their mission was to enhance and maintain MITnet, the campuii network, and to develop and implement produc...
详细信息
In trying to construct and maintain a useful and comprehensive on-line help system that organizes all the material available in a heterogenous distributed UNIX-based environment, our documentation group encountered th...
Emergent computation in the form of geometric learning is central to the development of motor and perceptual systems in biological organisms and promises to have a similar impact on emerging technologies including rob...
Emergent computation in the form of geometric learning is central to the development of motor and perceptual systems in biological organisms and promises to have a similar impact on emerging technologies including robotics, vision, speech, and graphics. this paper examines some of the trade-offs involved in different implementation strategies, focusing on the tasks of learning discrete classifications and smooth nonlinear mappings. the trade-offs between local and global representations are discussed, a spectrum of distributed network implementations are examined, and an important source of computational inefficiency is identified. Efficient algorithms based on k -d trees and the Delaunay triangulation are presented and the relevance to biological networks is discussed. Finally, extensions of boththe tasks and the implementations are given.
the author reports on issues of development support for distributed applications, that is applications intended to run cooperatively on a distributed system. Emphasis is put on the issues arising from the distributed ...
详细信息
ISBN:
(纸本)0818620307
the author reports on issues of development support for distributed applications, that is applications intended to run cooperatively on a distributed system. Emphasis is put on the issues arising from the distributed nature of such software and on the use of object-oriented techniques. the author bases his discussion on the experiences gained withthe development of two experimental software engineering environments (each including a dedicated distributed programming language). the first software engineering environment, called DESIGN, includes a distributed extension to C, called DC. DESIGN is operational and is currently used to develop sample distributed applications. A second project, DOCASE, introduces the object-oriented paradigm into the approaches discussed. DOCASE is based on a design-oriented language called DODL and is still under construction.< >
the focus of this work is on a particular class of unstable global states: the states with no in-transit message. A characterization of these states and their interest are given, along withthe principles of their det...
详细信息
ISBN:
(纸本)0818620307
the focus of this work is on a particular class of unstable global states: the states with no in-transit message. A characterization of these states and their interest are given, along withthe principles of their detection. As detecting these states requires a network traversal, choosing a particular implementation of this traversal gives one instance from a family of algorithms. the algorithm based on a virtual Hamiltonian cycle (a ring traversal) is presented and proved to be correct. the exposition of the principles and of the ring algorithm is done in an analytic way: algorithmic techniques are given separately (markers, message counting, network traversal) to lay down the snapshot definition properties.
暂无评论