Results 1 - 10 of 70,311

Using threads in interactive systems: A case study

by Carl Hauser, Christian Jacobi, Marvin Theimer, Brent Welch, Mark Weiser - SYMPOSIUM ON OPERATING SYSTEMS PRINCIPLES , 1993
"... We describe the results of examining two large research and commercial systems for the ways that they use threads. We used three methods: analysis of macroscopic thread statistics, analysis of the microsecond spacing between thread events, and reading the implementation code. We identify ten differe ..."
Abstract - Cited by 27 (0 self) - Add to MetaCart
We describe the results of examining two large research and commercial systems for the ways that they use threads. We used three methods: analysis of macroscopic thread statistics, analysis of the microsecond spacing between thread events, and reading the implementation code. We identify ten

A Case for End System Multicast

by Yang-hua Chu, Sanjay G. Rao, Srinivasan Seshan, Hui Zhang - in Proceedings of ACM Sigmetrics , 2000
"... Abstract — The conventional wisdom has been that IP is the natural protocol layer for implementing multicast related functionality. However, more than a decade after its initial proposal, IP Multicast is still plagued with concerns pertaining to scalability, network management, deployment and suppor ..."
Abstract - Cited by 1290 (24 self) - Add to MetaCart
-to-end delays than IP Multicast. In this paper, we study these performance concerns in the context of the Narada protocol. In Narada, end systems selforganize into an overlay structure using a fully distributed protocol. Further, end systems attempt to optimize the efficiency of the overlay by adapting

Multiobjective evolutionary algorithms: a comparative case study and the strength pareto approach

by Eckart Zitzler, Lothar Thiele - IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION , 1999
"... Evolutionary algorithms (EA’s) are often well-suited for optimization problems involving several, often conflicting objectives. Since 1985, various evolutionary approaches to multiobjective optimization have been developed that are capable of searching for multiple solutions concurrently in a singl ..."
Abstract - Cited by 813 (22 self) - Add to MetaCart
single run. However, the few comparative studies of different methods presented up to now remain mostly qualitative and are often restricted to a few approaches. In this paper, four multiobjective EA’s are compared quantitatively where an extended 0/1 knapsack problem is taken as a basis. Furthermore, we

A Set Of Principles For Conducting And Evaluating Interpretive Field Studies In Information Systems

by Heinz K. Klein, Michael D. Myers , 1999
"... This article discusses the conduct and evaluation of interpretive research in information systems. While the conventions for evaluating information systems case studies conducted according to the natural science model of social science are now widely accepted, this is not the case for interpretive f ..."
Abstract - Cited by 914 (6 self) - Add to MetaCart
field studies. A set of principles for the conduct and evaluation of interpretive field research in information systems is proposed, along with their philosophical rationale. The usefulness of the principles is illustrated by evaluating three published interpretive field studies drawn from

Eraser: a dynamic data race detector for multithreaded programs

by Stefan Savage, Michael Burrows, Greg Nelson, Patrick Sobalvarro, Thomas Anderson - ACM Transaction of Computer System , 1997
"... Multi-threaded programming is difficult and error prone. It is easy to make a mistake in synchronization that produces a data race, yet it can be extremely hard to locate this mistake during debugging. This paper describes a new tool, called Eraser, for dynamically detecting data races in lock-based ..."
Abstract - Cited by 688 (2 self) - Add to MetaCart
-based multi-threaded programs. Eraser uses binary rewriting techniques to monitor every shared memory reference and verify that consistent locking behavior is observed. We present several case studies, including undergraduate coursework and a multi-threaded Web search engine, that demonstrate

Kerberos: An Authentication Service for Open Network Systems

by Jennifer G. Steiner, Clifford Neuman, Jeffrey I. Schiller - IN USENIX CONFERENCE PROCEEDINGS , 1988
"... In an open network computing environment, a workstation cannot be trusted to identify its users correctly to network services. Kerberos provides an alternative approach whereby a trusted third-party authentication service is used to verify users’ identities. This paper gives an overview of the Kerb ..."
Abstract - Cited by 687 (12 self) - Add to MetaCart
, and administrator are described. Finally, the role of Kerberos in the larger Athena picture is given, along with a list of applications that presently use Kerberos for user authentication. We describe the addition of Kerberos authentication to the Sun Network File System as a case study for integrating Kerberos

A Methodology for Agent-Oriented Analysis and Design

by Michael Wooldridge , Nicholas R. Jennings, David Kinny , 1999
"... This paper presents a methodology for agent-oriented analysis and design. The methodology is general, in that it is applicable to a wide range of multi-agent systems, and comprehensive, in that it deals with both the macro-level (societal) and the micro-level (agent) aspects of systems. The methodol ..."
Abstract - Cited by 829 (12 self) - Add to MetaCart
. The methodology is founded on the view of a system as a computational organisation consisting of various interacting roles. We illustrate the methodology through a case study (an agent-based business process management system).

The Runge-Kutta discontinuous Galerkin method for conservation laws V: multidimensional systems

by Bernardo Cockburn , Chi-Wang Shu , 1997
"... This is the fifth paper in a series in which we construct and study the so-called Runge-Kutta Discontinuous Galerkin method for numerically solving hyperbolic conservation laws. In this paper, we extend the method to multidimensional nonlinear systems of conservation laws. The algorithms are describ ..."
Abstract - Cited by 508 (44 self) - Add to MetaCart
This is the fifth paper in a series in which we construct and study the so-called Runge-Kutta Discontinuous Galerkin method for numerically solving hyperbolic conservation laws. In this paper, we extend the method to multidimensional nonlinear systems of conservation laws. The algorithms

A Fast Algorithm for Particle Simulations

by L. Greengard, V. Rokhlin , 1987
"... this paper to the case where the potential (or force) at a point is a sum of pairwise An algorithm is presented for the rapid evaluation of the potential and force fields in systems involving large numbers of particles interactions. More specifically, we consider potentials of whose interactions a ..."
Abstract - Cited by 1152 (19 self) - Add to MetaCart
this paper to the case where the potential (or force) at a point is a sum of pairwise An algorithm is presented for the rapid evaluation of the potential and force fields in systems involving large numbers of particles interactions. More specifically, we consider potentials of whose interactions

Loopy belief propagation for approximate inference: An empirical study. In:

by Kevin P Murphy , Yair Weiss , Michael I Jordan - Proceedings of Uncertainty in AI, , 1999
"... Abstract Recently, researchers have demonstrated that "loopy belief propagation" -the use of Pearl's polytree algorithm in a Bayesian network with loops -can perform well in the context of error-correcting codes. The most dramatic instance of this is the near Shannon-limit performanc ..."
Abstract - Cited by 676 (15 self) - Add to MetaCart
convergence threshold of 10-4 , 98 out of 100 cases converged; when we lowered the threshold to 10-3 , all 100 cases converged. We also tried to avoid oscillations by using "momen tum"; replacing the messages that were sent at time t with a weighted average of the messages at times t and t-1
Results 1 - 10 of 70,311