TL;DR: In this paper, the authors present a theoretical account of computing work and use it to explain a number of observed phenomena, such as: how people knowingly use false data to obtain desired analytical results by tricking their systems. How organizations come to rely upon complex, critical computer systems despite significant, recurrent, known errors and inaccurate data.
Abstract: Most computing serves as a resource or tool to support other work: performing complex analyses for engineering projects, preparing documents, or sending electronic mail using office automation equipment, etc. To improve the character, quality, and ease of computing work, we must understand how automated systems actually are integrated into the work they support. How do people actually adapt to computing as a resource? How do they deal with the unreliability in hardware, software, or operations; data inaccuracy; system changes; poor documentation; inappropriate designs; etc.; which are present in almost every computing milieu, even where computing is widely used and considered highly successful? This paper presents some results of a detailed empirical study of routine computer use in several organizations. We present a theoretical account of computing work and use it to explain a number of observed phenomena, such as:How people knowingly use “false” data to obtain desired analytical results by tricking their systems. How organizations come to rely upon complex, critical computer systems despite significant, recurrent, known errors and inaccurate data. How people work around inadequate computing systems by using manual or duplicate systems, rather than changing their systems via maintenance or enhancement. In addition, the framework for analyzing computing and routine work presented here proves useful for representing and reasoning about activity in multiactor systems in general, and in understanding how better to integrate organizations of people and computers in which work is coordinated.
TL;DR: In this article, a task allocation model that allocates application tasks among processors in distributed computing systems satisfying minimum interprocessor communication cost, balanced utilization of each processor, and all engineering application requirements is presented.
Abstract: This paper presents a task allocation model that allocates application tasks among processors in distributed computing systems satisfying: 1) minimum interprocessor communication cost, 2) balanced utilization of each processor, and 3) all engineering application requirements.
TL;DR: In order to secure reliable operation of the monitoring infrastructure, two distributed service applications named Perfmon and Servmon are developed which monitors operational state of components in a distributed hardware & software system and reacts on detected problems.
Abstract: As part of our network monitoring activities, we deployed extensive monitoring systems in our network CESNET2 and in the European academic network GN2 [1]. These systems use active, passive and infrastructure monitoring. They combine multiple tools and monitoring architectures. The infrastructure consists of many hardware and software components. These include PC servers, monitoring cards, operating systems, drivers, libraries, middleware and application software. In such a complex distributed infrastructure, component failures are inevitable. It can be due to hardware failure, resource exhaustion, unexpected network changes, or even software bugs, which unfortunately happen. In order to secure reliable operation of our monitoring infrastructure, we have developed two distributed service applications named Perfmon and Servmon. Perfmon monitors operational state of components in a distributed hardware & software system and reacts on detected problems. Servmon monitors resource consumption. In this report we describe architecture of these two applications in more detail.
TL;DR: General models and objective function explained in this paper can be treated as basic platform for research in this area of task allocation and the characteristics of DDBS like distributed data, distributed operations from query tree and result file are mentioned as tools to be taken in this field of research.
Abstract: Summary Task allocation in Distributed computing systems (DCS) is an important research problem . When resource to be shared in DCS is a database that system is classified as Distributed database system(DDBS) . In DDBS systems Data & operation allocation are both closely interrelated & highly dependent on each other. Here it is represented along with model of allocation and development of such a model in general .DCS & DDBS are compared in this paper with reference to task allocation Models , Algorithms, Issues and Tools . General models and objective function explained in this paper can be treated as basic platform for research in this area of task allocation. Major issues in DCS have been explored by research in this area so far, while in DDBS the main issues are high lighted in this paper. The characteristics of DDBS like distributed data, distributed operations from query tree and result file are mentioned as tools to be taken in this field of research. An objective function can be derived by modifying the terms present in general model ,which inturn depend on characteristics of the system concerned ex. Distributed computing system ,distributed database system ,parallel system & multiprocessors etc.
TL;DR: Six papers in this issue represent some of the most active areas in distributed computing; four of the papers deal with asynchronous circuits, one with data flow computing, and one with systolic arrays, which span quite a spectrum as far level of theory and potential applications are concerned.
Abstract: The selection of papers in the first few issues of this journal will probably determine to a large extent what areas of study are included under the heading of Distributed Computing. It is important for our readers to realize that many interesting problems properly fall under this heading, but deal neither with communications networks nor distributed databases. Likewise, if our subject is to remain a fertile area for research, it is important to encourage prospective authors who may wonder if our journal is the appropriate place to publish a paper on a somewhat offbeat but relevant topic. With these goals in mind I suggested to Mohamed Gouda that we should organize a special issue on hardware design. The six papers that we have inclu~ied in this issue represent some of the most active areas in that discipline; four of the papers deal with asynchronous circuits, one with data flow computing, and one with systolic arrays. The papers span quite a spectrum as far level of theory and potential applications are concerned. Some deal with new and practical hardware structures, some address fundamental semantical issues, and some propose new methods for implementing algorithms in hardware. However, in my opinion, all expose exciting problems of common interest to researchers both areas. The first four papers deal with asynchronous circuits. Here the relationship with distributed computing is clear and immediate. In order to ensure that an asynchronous circuit works properly, it is necessary to consider very carefully all assumptions regarding the delays of signals exchanged between various circuit components; ideally the circuit should function correctly regardless of the delays associated with wires or individual circuit components. The advantages of using asynchro-