ppxscal/embedding_network huggingface dataset:
Profile-based dynamic voltage and frequency scaling for a multiple clock domain microprocessor
Authors: Grigorios Magklis, Michael L. Scott, Greg Semeraro, David H. Albonesi, Steven Dropsho
Venue: Proceedings of the 30th annual international symposium on Computer architecture (2003)

A Multiple Clock Domain (MCD) processor addresses the challenges of clock distribution and power dissipation by dividing a chip into several (coarse-grained) clock domains, allowing frequency and voltage to be reduced in domains that are not currently on the application's critical path. Given a reconfiguration mechanism capable of choosing appropriate times and values for voltage/frequency scaling, an MCD processor has the potential to achieve significant energy savings with low performance degradation.Early work on MCD processors evaluated the potential for energy savings by manually inserting reconfiguration instructions into applications, or by employing an oracle driven by off-line analysis of (identical) prior program runs. Subsequent work developed a hardware-based on-line mechanism that averages 75--85% of the energy-delay improvement achieved via off-line analysis.In this paper we consider the automatic insertion of reconfiguration instructions into applications, using profile-driven binary rewriting. Profile-based reconfiguration introduces the need for "training runs" prior to production use of a given application, but avoids the hardware complexity of on-line reconfiguration. It also has the potential to yield significantly greater energy savings. Experimental results (training on small data sets and then running on larger, alternative data sets) indicate that the profile-driven approach is more stable than hardware-based reconfiguration, and yields virtually all of the energy-delay improvement achieved via off-line analysis.
Implementing Interactive Configuration Management for Distributed Systems
Authors: Halldor Fosse, Morris Sloman
Venue: Proceedings of the 3rd International Conference on Configurable Distributed Systems (1996)

This paper describes an environment for interactive configuration management of software for distributed applications and services. Configuration management involves creating the components which form a distributed system; allocating these components to physical nodes and binding the interfaces of the components to each other or to existing services. Components and their required and provided interfaces are represented and accessible in the system-wide domain structure. We describe a graphical configuration environment, based on the Darwin configuration language, which is used to create the required configurations and maintain the configuration structure as part of the overall systems management infrastructure. The paper describes a simple example to show how a system can be initially constructed and subsequently reconfigured at run-time without shutting down the system.
Object-Oriented Middleware Infrastructure for Distributed Augmented Reality
Authors: Eiji Tokunaga, Andrej van der Zee, Makoto Kurahashi, Masahiro Nemoto, Tatsuo Nakajima
Venue: Proceedings of the Sixth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2003)

The paper describes design and implementation of software infrastructure for building augmented reality applications for ubiquitous computing environments. Augmented reality is one of the most important techniques to achieve the vision of ubiquitous computing. Traditional toolkits for augmented reality provide the high level abstraction that makes it easy to build augmented reality applications. However, the applications programmers need to contemplate distribution and context-awareness that make the development of applications very hard, but they are necessary to build ubiquitous computing environments. Our infrastructure provides the high level abstraction and hides distribution and context-awareness from programmers. Therefore, the cost to develop augmented reality applications will be reduced dramatically by using our middleware infrastructure.
Preliminary Evaluation of a Binary Translation System for Multithreaded Processors
Authors: Kanemitsu Ootsu, Takashi Yokota, Takafumi Ono, Takanobu Baba
Venue: Proceedings of the International Workshop on Innovative Architecture for Future Generation High-Performance Processors and Systems (IWIA'02) (2002)

Thread level parallelism (TLP) is a key technology to coming generation of high performance processors. Although it provides higher processing capability, the loss of compatibility with existing processors is a crucial issue. This research is motivated by the following two points: (1) TLP requires multithread programming which is rather difficult for ordinary programmers, or complexed compilation technologies that can exploit multithread parallelism, and (2) existing binary codes should be executed efficiently on multithreaded processors. In this paper, we first propose a binary translation system, that translates existing binary codes to multithreaded ones and optimizes them dynamically during execution. The system inputs the original binary codes and translates them to internal RTL representation. It analyzes the structure of the programand applies multithreading to loop bodies in a thread pipelining manner. A pilot binary translator, that a part of the proposed system, was built for the sake of preliminary evaluation. Evaluation results illustrate effectiveness of the system.
Fixpoint Analysis of Type and Alias in AKL Programs
Authors: Thomas Sjöland, Dan Sahlin
Venue:  (1995)

We have defined and implemented a method for analysis of the CCP language AKL in the spirit of abstract interpretation that uses a static set of semantic equations which abstracts the concurrent execution of an AKL program. The method strictly separates the setting up of the equation system from the solving of the system with a fixpoint procedure. The computation strategies used, results for a number of test programs and the conclusions we draw from this experimental effort are reported. The software implementing the system described herein, is deliverable number D.WP.1.6.1.M2 in the ESPRIT project ParForce 6707.
Coordination models and languages
Authors: George A. Papadopoulos, Farhad Arbab
Venue:  (1998)

A new class of models, formalisms and mechanisms has recently evolved for describing concurrent and distributed computations based on the concept of ``coordination''''. The purpose of a coordination model and associated language is to provide a means of integrating a number of possibly heterogeneous components together, by interfacing with each component in such a way that the collective set forms a single application that can execute on and take advantage of parallel and distributed systems. In this chapter we initially define and present in sufficient detail the fundamental concepts of what constitutes a coordination model or language. We then go on to classify these models and languages as either ``data-driven'''' or ``control-driven'''' (also called ``process-'''' or ``task-oriented''''). Next, the main existing coordination models and languages are described in sufficient detail to let the reader appreciate their features and put them into perspective with respect to each other. The chapter ends with a discussion comparing the various models and some conclusions.
On Request Forwarding for Dynamic Web Caching Hierarchies
Authors: Cho-Yu Chiang, Yingjie Li, Ming T. Liu, Mervin E. Muller
Venue: Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000) (2000)

Based on Caching Neighborhood Protocol (CNP), we proposed a Web caching scheme featuring dynamic caching hierarchies as its underlying infrastructure [1]. Dynamic Web caching hierarchies consist of proxy servers building hierarchies on a per request basis, in contrast to static Web caching hierarchies that comprise proxy servers preconfigured into hierarchies. Concerns on overheads and efficiency in forwarding requests individually drove conventional Web caching schemes to use static Web caching hierarchies. Nevertheless, we showed that a Web caching scheme featuring dynamic caching hierarchies could be both efficient and effective in request forwarding.
Rational action in agent programs with prioritized goals
Authors: Sebastian Sardiña, Steven Shapiro
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

Agent theories and agent programs are two very different styles of specification of agent behavior. The former are declarative in nature, while the latter have an imperative flavor. In this paper, we combine ideas from both areas, yielding a powerful mode of agent specification that also gives the specifier a good deal of control over the complexity of the specified agent. In particular, we extend Shapiro et al.'s [16] agent theory to handle prioritized goals and then integrate it with the IndiGolog agent programming language. The result is a new IndiGolog construct that transforms a given nondeterministic, concurrent program $delta$ into a new program $delta'$ that can be described as a rational implementation of the original program, in the sense that $delta'$ is an implementation of $delta$, and furthermore, $delta'$ is the most rational of all implementations of $delta$ relative to a given set of prioritized goals and the agent's knowledge. With this construct, we can specify an agent that will attempt to achieve as many goals as possible in priority order even if the agent does not know of a plan that is guaranteed to achieve all the goals. In this case, the agent will select a plan that she thinks has the best chance of achieving the goals.
Prediction of Fault-proneness at Early Phase in Object-Oriented Development
Authors: Toshihiro Kamiya, Shinji Kusumoto, Katsuro Inoue
Venue: Proceedings of the 2nd IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (1999)

To analyze the complexity of object-oriented software, several metrics have been proposed. Among them, Chidamber and Kemerer's metrics are well-known ones as object-oriented metrics. Also, the effectiveness has been empirically evaluated from the viewpoints of estimating the fault-proneness of object-oriented software. In the evaluations, their metrics were applied to not design specification but the source code because some of them measure an inner complexity of a class, and such information can not be obtained until the algorithm and structure of the class are determined at the end of design phase. However, the estimation of the fault-proneness should be done in the early phase to effectively allocate effort for fixing the faults.This paper proposes a new method to estimate the fault-proneness of the class in the early phase, using several complexity metrics for object-oriented software. In the proposed method, we introduce four checkpoints into the analysis / design / implementation phase, and estimate the fault-prone classes using the applicable metrics at each checkpoint.
Non archimedean models of Lukasiewicz logic
Authors: A. Di Nola
Venue: Proceedings of the 26th International Symposium on Multiple-Valued Logic (1996)

We survey the theory of non-archimedean algebraic models (MV-algebra) of Lukasiewicz' infinite-valued sentential calculus.
Optical NMR Theory, Simulation, and Animation
Authors: M. W. Evans, C. Pelkie
Venue:  (1990)

The theory of optical NMR is introduced and developed with supercomputer simulation and animation. A powerful, circularly polarised, pulse of laser radiation magnetises an ensemble of atoms and molecules through the conjugate product of non-linear optical theory. This magnetization is shown theoretically to result in non-linear optical Zeeman splitting the "optical Zeeman effect," mediated by the orbital and spin electronic and nuclear quantum numbers through a new fundamental property, the "gyroptic ratio." When a circularly polarised laser is used in a conventional NMR spectrometer, the spectrum is split by Lande coupling leading to a new analytical technique, "optical NMR." This is potentially of widespread interest. The interaction of a circularly polarised laser with optically active (chiral or handed) molecules leads to electric polarisation, and the statistical dynamical origins of this effect are simulated and animated on the IBM 3090-6S and RS 6000 computers at the Cornell Theory Center. The animations reveal the nature of orientational cross correlations induced by the circularly polarized laser using a novel time lapse method to relate the statistical and actual (motion) correlations. These show the torque effect of the circularly polarised laser, which imparts net angular momentum whose motion reversal and parity inversion symmetries are the same as those of magnetisation.
Implementation of Two Approaches for the Reliable Multicast of Mobile Agents over Wireless Networks
Authors: Michel Barbeau
Venue: Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks (1999)

On a multi-access wireless network, it may be required to send a mobile agent (MA) that goes on every network node to set, for instance, the radio interface to a new frequency. It needs to be done on all nodes at the same time. Instead of forcing the origin node to dispatch a separate MA to every destination node, it is better to send a single MA to a multicast address and for the agent transfer service to deliver a copy of the MA to every member of an associated group of nodes. In this type of tasks, reliable delivery of the MA to every node is a must otherwise the full operation of the network may not be maintained. Although, wireless networks are often characterized by relatively high error rates.In this paper, we present the design and implementation, of an API comprising two modules for the reliable multicasting of MAs over wireless TCP/IP networks. The two approaches are described and compared in terms of the usage they make of the bandwidth of a 802.11 type of wireless local area network.
On parallelism of hyper-linking theorem proving: a preliminary report
Authors: Chih-Hung Wu, Shie-Jue Lee
Venue: Proceedings of the 1996 International Conference on Parallel and Distributed Systems (1996)

This paper exploits the parallelism of a hyper-linking based theorem prover. We analyze the unique properties of the the hyper-linking proof procedure and present the preliminary results. With respect to these properties four parallel strategies, phase-level, clause-level, literal-level, search level parallelism are designed for different implementation schemes of the prover. Results and analysis of the experiments on these parallel strategies are presented.
Speculative Concurrency Control for Real-Time Databases
Authors: Azer Bestavros
Venue:  (1993)

Abstract In this paper we examine a number of admission control and scheduling protocols for high-performance web servers based on a 2-phase policy for serving HTTP requests. The first ``registration'''' phase involves establishing the TCP connection for the HTTP request and parsing/iterpreting its arguments, whereas the second ``service'''' phase involves the service/transmission of data in response to the HTTP request. By introducing a delay between these two phases, we show that the performance of a web server could be improved significantly through the adoption of a number of scheduling policies that optimize the utilization of various system components (e.g. memory cache and I/O). In addition, to its premise for improving the performance of a single web server, the delineation between the registration and service phases of an HTTP request may be useful for load balancing purposes on clusters of web servers. We are investigating the use of such a mechanism as part of the Commonwealth testbed being developed at Boston University.
Analytic Central Path, Sensitivity Analysis and Parametric Linear Programming
Authors: A. G. Holder, J. F. Sturm, S. Zhang
Venue:  (1997)

In this paper we consider properties of the central path and the analytic center of the optimal face in the context of parametric linear programming. We first show that if the right-hand side vector of a standard linear program is perturbed, then the analytic center of the optimal face is one-side differentiable with respect to the perturbation parameter. In that case we also show that the whole analytic central path shifts in a uniform fashion. When the objective vector is perturbed, we show that the last part of the analytic central path is tangent to a central path defined on the optimal face of the original problem.
Adaptive Disk Spindown via Optimal Rent-to-Buy in Probabilistic Environments
Authors: Krishnan,  P, M P Long, Scott J Vitter
Venue:  (1995)

In the {single rent-to-buy decision} problem, without a priori knowledge of the amount of time a resource will be used we need to decide when to buy the resource, given that we can rent the resource for \$1 per unit time or buy it once and for all for \$$c$. In this paper we study algorithms that make a sequence of single rent-to-buy decisions, using the assumption that the resource use times are independently drawn from an unknown probability distribution. Our study of this rent-to-buy problem is motivated by important systems applications, specifically, problems arising from deciding when to spindown disks to conserve energy in mobile computers~[DKM, LKH, MDK], thread blocking decisions during lock acquisition in multiprocessor applications~[KLM], and virtual circuit holding times in IP-over-ATM networks~[KLP, SaK]. We develop a provably optimal and computationally efficient algorithm for the rent-to-buy problem and evaluate its practical merit for the disk spindown scenario via simulation studies. Our algorithm uses $O(\sqrt{t})$ time and space, and its expected cost for the $t$th resource use converges to optimal as $O(\sqrt{\log t/t})$, for any bounded probability distribution on the resource use times. Alternatively, using $O(1)$ time and space, the algorithm almost converges to optimal. We describe the results of simulating our algorithm for the disk spindown problem using disk access traces obtained from an HP workstation environment. We introduce the natural notion of {\em effective cost\/} which merges the effects of energy conservation and response time performance into one metric based on a user specified parameter~$a$, the relative importance of response time to energy conservation. (The buy cost~$c$ varies linearly with~$a$.) We observe that by varying~$a$, we can model the tradeoff between power and response time well. We also show that our algorithm is best in terms of effective cost for almost all values of~$a$, saving effective cost by 6--25\% over the optimal online algorithm in the competitive model~(i.e., the 2-competitive algorithm that spins down the disk after waiting~$c$ seconds). In addition, for small values of~$a$ (corresponding to when saving energy is critical), our algorithm when compared against the optimal online algorithm in the competitive model reduces excess energy by 17--60\%, and when compared against the 5~second threshold reduces excess energy by 6--42\%.
Pre-Fetching for Improved Core Interfacing
Authors: Roman Lysecky, Frank Vahid, Tony Givargis, Rilesh Patel
Venue: Proceedings of the 12th international symposium on System synthesis (1999)

Reuse of cores can reduce design time for systems-on-a-chip. Such reuse is dependent on being able to easily interface a core to any bus. To enable such interfacing, many propose separating a core's interface from its internals. However, this separation can lead to a performance penalty when reading a core's internal registers. We introduce pre-fetching, which is analogous to caching, as a technique to reduce or eliminate this performance penalty, involving a tradeoff with power and size. We describe the pre-fetching technique, classify different types of registers, describe our initial pre-fetching architectures and heuristics for certain classes of registers, and highlight experiments demonstrating the performance improvements and size/power tradeoffs.
The Completion Time of a Job on Multi-Mode Systems
Authors: G V Kulkarni, F V Nicola, S K Trivedi
Venue:  (1985)

In this paper we present a general model of the completion time of a single job on a computer system whose state changes according to a semi-Markov process with possibly infinite state-space. When the state of the system changes the job service is preempted. The job service is then resumed or restarted (with or without resampling) in the new state at, possibly, a different service rate. Different types of preemption disciplines are allowed in the model. Successive aggregation and transform techniques are used to obtain the Laplace Stieltjes Transform of the job completion time. We specialize to the case of Markovian structure-state process. We demonstrate the use of the techniques developed here by means of two applications. In the first we derive the distribution of the response time in an $M/M/1$ queueing system under the processor sharing discipline (PS). In the second we derive the distribution of the completion time of a job when executed on a system subject to mixed types of breakdowns and repair.
Cisco Network Security Little Black Book
Authors: Joe Harris
Venue:  (2002)

:With this concise, problem-solving guide, networking professionals will learn how to identify network security threats and implement uniform security throughout their networks, secure remote dial-in access with CiscoSecure ACS and Cisco IOS AAA features, protect Internet access on their perimeter routers with the CiscoSecure IOS firewall software, and implement secure VPNs using IPSec and Cisco Encryption Technology. Step-by-step instructions and immediate solutions will help administrators implement and update security defenses. Also, every configuration in this book was completely tested and perfected with actual Cisco routers. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Performance Evaluation of Distributed Algorithms for Mining Association Rules on Workstation Cluster
Authors: Tomohiro Shimomura, Susumu Shibusawa
Venue: Proceedings of the 2000 International Workshop on Parallel Processing (2000)

The mining of association rules is one of the database mining techniques used to extract useful information from large quantities of data. Finding association rules, however, requires that the transaction database be scanned repeatedly, and we need to handle very large amounts of transaction data. This requires an incredibly large amount of computation time. There have therefore been many attempts to speed-up database mining by using parallel computers. Recent improvements in the performance of PCs and workstations (WSs), and the recent dissemination of network technology have made parallel processing distributed within computer clusters an attractive alternative to parallel computers.In this paper we describe two new algorithms effective for parallel processing distributed in a WS cluster environment. One is an algorithm in which the size of data transmitted between WSs is smaller than that of the former algorithm. The other is an algorithm that reduces the number of scan processing at each node by dividing data and that uses shift operations for data communication. We have implemented these algorithms on a WS cluster and have evaluated their performance.