ppxscal/embedding_network huggingface dataset:
Improved virtual queueing and dynamic EPD techniques for TCP over ATM
Authors: Yuan Wu, Kai-Yeung Siu, Wenge Ren
Venue: Proceedings of the 1997 International Conference on Network Protocols (ICNP '97) (1997)

It is known that TCP throughput can degrade significantly over UBR service in a congested ATM network, and the early packet discard (EPD) technique has been proposed to improve the performance. However, recent studies show that EPD cannot ensure fairness among competing VCs in a congested network, but the degree of fairness can be improved using various forms of fair buffer allocation techniques. Based upon the work by H.Y. Tzeng and K.Y. Siu (1996), we propose an improved scheme that utilizes only a single shared FIFO queue for all VCs and admits simple implementation for high speed ATM networks. Our scheme achieves nearly perfect fairness of throughput among multiple TCP connections, comparable to the expensive per-VC queuing technique. Analytical and simulation results are presented to show the validity of this new scheme and significant improvement in performance as compared with existing fair buffer allocation techniques for TCP over ATM.
Dynamic Server Selection using Bandwidth Probing in Wide-Area Networks
Authors: Robert Carter, Mark Crovella
Venue:  (1996)

Abstract Replication is a commonly proposed solution to problems of scale associated with distributed services. However, when a service is replicated, each client must be assigned a server. Prior work has generally assumed that assignment to be static. In contrast, we propose dynamic server selection, and show that it enables application-level congestion avoidance. To make dynamic server selection practical, we demonstrate the use of three tools. In addition to direct measurements of round-trip latency, we introduce and validate two new tools: bprobe, which estimates the maximum possible bandwidth along a given path; and cprobe, which estimates the current congestion along a path. Using these tools we demonstrate dynamic server selection and compare it to previous static approaches. We show that dynamic server selection consistently outperforms static policies by as much as 50%. Furthermore, we demonstrate the importance of each of our tools in performing dynamic server selection.
Broadcast Disks: Data Management for Asymmetric Communication Environments
Authors: Swarup Acharya, Rafael Alonso, Michael Franklin, Stanley Zdonik
Venue:  (1994)

This paper proposes the use of repetitive broadcast as a way of augmenting the memory hierarchy of clients in an asymmetric communication environment. We describe a new technique called ``Broadcast Disks'''' for structuring the broadcast in a way that provides improved performance for non-uniformly accessed data. The Broadcast Disk superimposes multiple disks spinning at different speeds on a single broadcast channel --- in effect creating an arbitrarily fine-grained memory hierarchy. In addition to proposing and defining the mechanism, a main result of this work is that exploiting the potential of the broadcast structure requires a re-evaluation of basic cache management policies. We examine several ``pure'''' cache management policies and develop and measure implementable approximations to these policies. These results and others are presented in a set of simulation studies that substantiates the basic idea and develops some of the intuitions required to design a particular broadcast program.
Clock Instability and Its Effect on Time Intervals in Performance Studies
Authors: A M Dietz, Schlatter C Ellis, Frank C Starmer
Venue:  (1995)

Workstations in a local area network environment must provide a time service that is synchronized with the other clocks on the LAN. To stay synchronized, computers on a network exchange information about the time via a time service protocol and adjust their own clock accordingly. These adjustments make the system clocks unstable (or tick unevenly). Unstable clocks introduce errors in the measurement of intervals as is done in performance studies, workload characterization, and serialization of distributed events. In this paper, we first present techniques for detecting clock instabilities in a LAN environment. We describe sources of instability of Sun and DEC workstations clocks on three levels: hardware, kernel, and network time service. Next, we discuss approaches to stabilizing clocks, and to collecting data correctly in spite of them. We describe how to build a performance clock in UNIX that is independent of the native system clock, and how to apply the Central Limit Theorem to compute confidence intervals for repeated measurements.
Merging and Sorting Networks with the Topology of the Omega Network
Authors: Gianfranco Bilardi
Venue:  (1987)

We consider a class of comparator networks obtained from the omega permutation network by replacing each switch with a comparator exchanger of arbitrary direction. These networks are all isomorphic to each other, have merging capabilities, and can be used as building blocks of sorting networks in ways different from the standard merge-sort scheme. It is shown that the bitonic merger and the balanced merger are members of the class. These two networks were not previously known to be isomorphic.
Visual Basic .NET Developer's Handbook, 1 edition
Authors: Evangelos Petroutsos, Kevin Hough, Mark Ridgeway
Venue:  (2002)

:Perhaps you've had a taste of .NET programming and are hungry for more advanced coverage of the new Visual Basic. Or perhaps you've mastered VB6 and are ready to move to the .NET framework and the capabilities of Visual Basic .NET. Either way, Visual Basic .NET Developer's Handbook gives you what you want, and need. If your goals involve web programming, this book offers detailed instruction that will help you achieve them. You'll learn to use Visual Basic .NET to build and deploy XML-based Web services, create ASP.NET-based web applications, and implement support for mobile devices. As you progress, you'll master some of the trickier aspects of form design, solve tough database connectivity challenges, and secure your applications with built-in .NET features. If you're a Windows programmer who knows VB6 inside and out, you'll find many compelling reasons for making the shift to VB .NET. This book provides the specialized coverage you need to do it quickly and effectively. You'll learn how the newest Visual Basic lets you build dramatically better Windows applications. You may cringe at the thought of mastering a new file I/O methodology, for example, but wait until you see all that streams has to offer, beginning with faster data access. And, you'll also learn new, more-effective approaches to building custom Windows services and controls. Visual Basic .NET is at the forefront of the convergence of Windows and web programming. Whatever your focus, whatever your career path, Visual Basic .NET Developer's Handbook is the resource best suited to helping you navigate this convergence -- skillfully and successfully.
Verification of Embedded Phase-Locked Loops
Venue: Proceedings of the 2nd International Symposium on Quality Electronic Design (2001)

With the increasing use of Phase-locked loops (PLLs) embedded in FPGAs, ASICs, and Systems-On-Chip (SOC), there is a growing need for methods to verify their operation. This paper describes a general and organized list that includes tests for lock, jitter, stability, and modulation response. The list is offered as a guide to the verification and testing of an embedded PLL. For that reason it is presented in such a way as to allow the reader to determine the extent to which the verification will be carried out. The tests are covered from the easiest to the most complicated to perform, with the amount of information gathered increasing along with the complexity of the test. The paper also discusses the difference between observing a stand-alone PLL and an embedded PLL. 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
Programmable Systolic Arrays
Authors: Richard P Hughey
Venue:  (1991)

Systolic arrays can solve computationally intensive problems many times faster than traditional computers or supercomputers. Because VLSI systems require many months to design, simulate, fabricate, and test, research has turned to programmable systolic arrays. This thesis introduces a general, programmable systolic array architecture: the Systolic Shared Register (SSR) architecture. The Systolic Shared Register architecture preserves the simple communication of single-purpose systolic arrays while providing a fully programmable systolic co-processor. To test the SSR architecture, I designed, simulated, and had fabricated the Brown Systolic Array. B-SYS is an 8-bit SSR machine: each 16-element register bank in the linear array is shared between two functional units, providing simple and efficient systolic communication. The 85\,000-transistor chip worked on first fabrication and a 10-chip, 470-element prototype array performs sequence comparison over 80 times faster than its Intel 80386 host. A custom-designed board could magnify this to over 600 times faster for a 10-chip co-processor. A 32-chip \mbox{B-SYS} system could process over three billion 8-bit operations every second. Although the SSR paradigm stands by itself, it is instructive to simultaneously consider programming methods and applications. This thesis describes the principle of software fault detection for the automatic generation of fault-tolerant programs, an efficient alternative to rigid hardware methods. Additionally, this thesis introduces the New Systolic Language; NSL is a programming language for systolic co-processors based on data stream computation. With the aid of NSL, several systolic applications are examined in detail, in particular sequence comparison problems from the Human Genome Project. A comparison of \mbox{B-SYS} to existing parallel machines reveals its unequivocal superiority in its targeted area.
Class Conditional Density Estimation Using Mixtures with Constrained Component Sharing
Authors: Michalis K. Titsias, Aristidis Likas
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2003)

We propose a generative mixture model classifier that allows for the class conditional densities to be represented by mixtures having certain subsets of their components shared or common among classes. We argue that, when the total number of mixture components is kept fixed, the most efficient classification model is obtained by appropriately determining the sharing of components among class conditional densities. In order to discover such an efficient model, a training method is derived based on the EM algorithm that automatically adjusts component sharing. We provide experimental results with good classification performance.
A Case For Grid Computing On Virtual Machines
Authors: Renato J. Figueiredo, Peter A. Dinda, José A. B. Fortes
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

We advocate a novel approach to grid computing thatis based on a combination of "classic" operating systemlevel virtual machines (VMs) and middleware mechanismsto manage VMs in a distributed environment. The abstractionis that of dynamically instantiated and mobile VMs thatare a combination of traditional OS processes (the VM monitors)and files (the VM state). We give qualitative argumentsthat justify our approach in terms of security, isolation,customization, legacy support and resource control,and we show quantitative results that demonstrate the feasibilityof our approach from a performance perspective. Finally,we describe the middleware challenges implied by theapproach and an architecture for grid computing using virtualmachines.
High performance support for OO traversals in monet
Authors: Peter A. Boncz, Fred Kwakkel, Martin L. Kersten
Venue:  (1995)

In this paper we discuss how Monet, a novel multimodel database system, can be used to efficiently support OODB applications. We show how Monet''s offbeat view on key issues in database architecture provides both challenges and opportunities in building a high-performance ODMG-compliant programming system on top of it. In particular, we show how an OO datamodel can be mapped onto Monet''s decomposed storage scheme, and how OO queries are translated into an algebraic language. A generic model for specifying OO class-attribute traversals is presented, that permits the OODB to algebraicly optimize and parallelize their execution. The complete OO7 benchmark has been implemented to measure the success of our approach. The results show that Monet achieves minimally the performance published for the fastest OODBs on the market place today.
OPL++: A Modeling Layer for Constraint Programming Libraries
Authors: Laurent Michel, Pascal Van Hentenryck
Venue:  (2000)

Mathematical modeling and constraint programming languages have orthogonal strengths in stating combinatorial optimization problems. Modeling languages typically feature high-level set and algebraic notations, while constraint programming languages provide a rich constraint language and the ability to specify search procedures. This paper shows that many of the functionalities typically found in modeling languages can be integrated elegantly in constraint programming libraries without defining a specific language or preprocessor. In particular, it presents the design of OPL++, a C++ modeling layer for constraint programming that combines the salient features of both approaches. Of particular interest is the one-to-one correspondance between high-level models and OPL++ statements and the negligible overhead induced by the extensions.
INTRODUCING TRANSPARENT WEB CACHING IN A LOCAL AREA NETWORK
Authors: Laura Abba, Marina Buzzi, Damir Pobric, Massimo Ianigro
Venue:  (2000)

The term ''transparent web caching'' refers to cache technology in which web traffic is automatically intercepted and redirected toward one or more cache servers. The redirection of web data can be accomplished using L4 switches or routers. Being completely transparent to the user (no browser configuration is required) the service can be easily implemented and turns out to be scalable and fail-safe. This work presents the results of our experimental use of transparent caching technology in a simple network environment. We focus on the impact this technique could have on network performance, with all its benefits and problems, as well as its effects on end users. The analysis is based on data gathered in an operative network during a two-month period.
Defective Coloring of Toroidal Graphs and Graphs of Bounded Genus
Authors: Lenore Cowen, Wayne Goddard
Venue:  (1995)

A graph is (k,d)-colorable if one can color the vertices with k colors such that no vertex is adjacent to more than d vertices of the same color. In this paper we investigate the existence of such colorings in surfaces. It is shown that a toroidal graph is (3,2)- and (5,1)-colorable, and that a graph of genus g is (X(g) /(d+1) + 4,d)-colorable, where X(g) is the maximum chromatic number of a graph embeddable on the surface of genus g.
Several Remarks on Non-Boolean Functions over Boolean Algebras
Authors: Dan A. Simovici
Venue: Proceedings of the 33rd International Symposium on Multiple-Valued Logic (2003)

We investigate charactizations of n-argument Booleanfunctions in the class of functions defined on Boolean algebrasand we extend our previous results centered around theapproximation of non-Boolean functions by Boolean functions.We also generalize of the notions of upper and lowersemi-Boolean functions to the case of n-variable functions.
The Delaunay Constrained Triangulation: The Delaunay Stable Algorithms
Authors: J. G. Planès
Venue: Proceedings of the 1999 International Conference on Information Visualisation (1999)

The Delaunay triangulation is well known for its use in geometric design. A derived version of this structure, the Delaunay constrained triangulation, takes into account the triangular mesh problem in presence of rectilinear constraints.The Delaunay constrained triangulation is very useful for CAD, topography and mapping and in finite elements analysis. This technique is still developing. We present a taxonomy of this geometric structure. First we describe the different tools used to introduce the problem. Then we introduce the different approaches highlighting various points of view of the problem.We will focus on the Delaunay stable methods presenting our researches on the subject. A Delaunay stable method preserves the Delaunay nature of the constrained triangulation. Each method is detailed by its algorithms, performances, and properties. For instance we show how these methods approximate the generalized Voronoï diagram of the configuration.Finally, we expose an application of our algorithms in maintaining at lowest cost the DEM realism during the resampling process. The Delaunay stable algorithms are used for 2.5D DEM design. The aim of this work is to demonstrate that the use of topographic constraints in a regular DEM without adding new points preserves the terrain shape. So the resulting DEM can be more easily interpreted because its realism is preserved and the mesh still owns all the Delaunay triangulation properties.
A Convergence Algorithm to Help Enhance the Performance of Distributed Systems on Large Networks
Authors: Allan K. Y. Wong, Joseph H. C. Wong
Venue: Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks (1999)

The proposed convergence algorithm quickly and accurately predicts the mean message response time of a communication channel. From the predicted value the correct window size of the desired percentage of time-out tolerance in message transmission and response can be computed. A correct window size is a necessity for reducing excessive message retransmissions caused by time-outs. The convergence algorithm is particularly useful for enhancing the performance of time-critical distributed applications running on large networks such as the Internet. Prolonged delays in message response in these systems may lead to fatal errors. The discussion in this paper concentrates mainly on the theory and verification of the convergence algorithm. The simulation results have confirmed that the proposed algorithm is indeed a cost/effective solution for enhancing system performance. The simplicity of the convergence algorithm makes it worthwhile for practical implementation in real systems.
Extension Mechanisms in Montana
Authors: Danny Soroker, Michael Karasick, John Barton, David Streeter
Venue: Proceedings of the 8th Israeli Conference on Computer-Based Systems and Software Engineering (1997)

Montana is a new C++ programming environment being developed at IBM. Montana aims to improve the software development experience by providing rapid incremental builds, rapid complete builds, and a tightly integrated user interface driven from a single source of information. Montana uses a program representation (CodeStore) to achieve these aims, with compilation proceeding directly from the database. APIs for accessing information about programs from the CodeStore are also made available for tool builders. In this paper we focus on the extension mechanism in Montana, which enables integration of existing tools and creation of new sophisticated, tightly integrated tools.
Software Architectures for Shared Information Systems
Authors: Mary Shaw
Venue:  (1993)

Software systems design takes place at many levels. Different kinds of design elements, notations, and analyses distinguish these levels. At the software architecture level, designers combine subsystems into complete systems. This paper studies some of the common patterns, or idioms, that guide these configurations. Results from software architecture offer some insight into the problems of systems integration---the task of connecting individual, isolated, pre-existing software systems to provide coherent, distributed solutions to large problems. As computing has become more sophisticated, so too have the software structures used in the integration task. This paper reviews historical examples of shared information systems in three different applications whose requirements share some common features about collecting, manipulating, and preserving large bodies of complex information. These applications have similar architectural histories in which a succession of designs responds to new technologies and new requirements for flexible, highly dynamic responses. A common pattern, the "shared information system evolution pattern", appears in all three areas. 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
Static Pin Mapping and SOC Test Scheduling for Cores with Multiple Test Sets
Authors: Yu Huang, Wu-Tung Cheng, Chien-Chung Tsai, Nilanjan Mukherjee, Sudhakar M. Reddy
Venue: Proceedings of the 4th International Symposium on Quality Electronic Design (2003)

An algorithm for mapping coreterminals to System-On-a-Chip (SOC) I/O pinsand scheduling tests in order to achieve cost-efficientconcurrent test for core-based designs ispresented in this paper. In this work "static" pinmapping and test scheduling for concurrenttesting are studied for the case of multiple testsets for each core. The problem is formulated asa constrained two-dimensional bin-packingproblem. A heuristic algorithm is then proposedto determine a solution. The objectives drivingthis solution are geared towards reducing thetotal test application time of SOC and satisfyingthe test constraints such as limited number ofSOC pins and maximum peak power dissipationspecified by core integrators. Experimentalresults demonstrate the effectiveness of theproposed method.
The construction of cubic and quartic planar maps with prescribed face degrees
Authors: Gunnar Brinkmann, Thomas Harmuth, Oliver Heidemeier
Venue: Discrete Applied Mathematics (2003)

In this paper, the existence and availability of computer programs to constructively enumerate all simple connected cubic or quartic planar maps with prescribed number of vertices and face degrees is announced and results of the programs are presented. The underlying algorithms of the computer programs are described.
Segmenting Workstation Screen Images
Authors: Denis M. Serenyi
Venue:  (1996)

None. 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
Conflict, Queueing, and Deadlocks in Cooperative Transaction Hierarchies
Authors: Marian H. Nodine
Venue:  (1991)

Cooperative transaction hierarchies are a model for transactions on databases that support design applications. This model relaxes the atomicity constraint, allowing controlled interactions among different cooperative transactions. This work summarizes earlier work in [NSFZ90], and describes the nature of conflict and queueing in the context of that work. Since queueing can cause deadlocks, we discuss the nature of deadlocks in a cooperative transaction hierarchy, and propose an algorithm for deadlock detection. We give some pointers on how to resolve deadlocks. We also show that determining deadlock freedom, which would be preferable to deadlock detection, is co-NP-hard.