ppxscal/embedding_network huggingface dataset:
Improved AntNet routing
Authors: Benjamín Barán
Venue: Workshop on Data communication in Latin America and the Caribbean (2001)

Abstract-AntNet is a new algorithm for packet routing in communication networks. In AntNet, a group of mobile agents (artificial ants) build paths between pair of nodes, exploring the network concurrently and exchanging data to update routing tables. This work, based in a previous work of the author [3], analyzes AntNet algorithms and proposes improvements, comparing their performance with respect to the original AntNet and other commericial algorithms. Simulation results indicate a better throughput of the improved proposals. So, AntNet and its variant here proposed are promising options for routing in large public networks such as Interet.
Reduction of compilation costs through language contraction
Authors: Mary Shaw
Venue: Communications of the ACM (1974)

Programming languages tailored to particular groups of users can often be constructed by removing unwanted features from a general purpose language. This paper describes the use of simulation techniques to predict the savings in compilation cost achievable by such an approach. The results suggest a function which describes the effect of changes in the power of a language on the compilation cost of an algorithm expressed in that language: when features not actually used by the algorithm are removed from the language, the cost of compiling the algorithm decreases moderately, but when features that are needed are removed, the compilation cost increases sharply.
Hardware and Compiler-Directed Cache Coherence in Large-Scale Multiprocessors: Design Considerations and Performance Study
Authors: Lynn Choi, Pen-Chung Yew
Venue: IEEE Transactions on Parallel and Distributed Systems (2000)

In this paper, we study a hardware-supported, compiler-directed (HSCD) cache coherence scheme, which can be implemented on a large-scale multiprocessor using off-the-shelf microprocessors, such as the Cray T3D. The scheme can be adapted to various cache organizations, including multiword cache lines and byte-addressable architectures. Several system related issues, including critical sections, interthread communication, and task migration have also been addressed. The cost of the required hardware support is minimal and proportional to the cache size. The necessary compiler algorithms, including intra- and interprocedural array data flow analysis, have been implemented on the Polaris parallelizing compiler [34]. From our simulation study using the Perfect Club benchmarks [5], we found that in spite of the conservative analysis made by the compiler, for four of six benchmark programs tested, the proposed HSCD scheme outperforms the full-map hardware directory scheme up to 70 percent while the hardware scheme outperforms the HSCD scheme in the remaining two applications up to 89 percent. Given its comparable performance and reduced hardware cost, the proposed scheme can be a viable alternative for large-scale multiprocessors such as the Cray T3D, which rely on users to maintain data coherence.
A dataflow specification for system level synthesis of 3D graphics applications
Authors: Chanik Park, Sungchan Kim, Soonhoi Ha
Venue: Proceedings of the 2001 Asia and South Pacific Design Automation Conference (2001)

3D graphics is becoming an important application area together with multimedia applications. The dynamic behavior of 3D graphics application brings new challenges for system level specification and synthesis methodologies. Although existing dataflow models are successfully used for DSP system design, they are not sufficient to deal with 3D graphics algorithms since they lack in global state management and dynamic behavior handling. In this paper, we propose an extended synchronous piggybacked dataflow model with dynamic constructs for representing 3D graphics algorithm. We also present implementation techniques for software and hardware synthesis from the specification. With a simple 3D graphics pipeline, we show the novelty and usefulness of the proposed specification model.
Testing the Local Interconnect Resources of SRAM-Based FPGA's
Authors: M. Renovell, J. M. Portal, J. Figueras, Y. Zorian
Venue: Journal of Electronic Testing: Theory and Applications (2000)

This paper addresses the problem of testing the configurable modules used in the local interconnect of SRAM-based FPGAs. First, it is demonstrated that a n address bit Configurable Interface Multiplexer requires N &equals; 2n test configurations considering a stuck-at as well as a functional fault model. Second, a logic cell with a set of k input Configurable Interface Modules with n address bits is analyzed and it is proven that the set of CIMs can be tested in parallel making the number of required test configurations equal to N &equals; 2n. Third, it is shown that the complete circuit i.e. a m &times; m array of sets of k Configurable Interface Multiplexers with n address bits can be tested with only N &equals; 2n test configurations using the XOR tree and shift register structures.
Sets of Type (a, b) From Subgroups of &Gamma;L(1, pR)
Authors: Nicholas Hamilton, Tim Penttila
Venue: Journal of Algebraic Combinatorics: An International Journal (2001)

In this paper i>k-sets of type (i>a, i>b) with respect to hyperplanes are constructed in finite projective spaces using powers of Singer cycles. These are then used to construct further examples of sets of type (i>a, i>b) using various disjoint sets. The parameters of the associated strongly regular graphs are also calculated. The construction technique is then related to work of Foulser and Kallaher classifying rank three subgroups of i>A&Gamma;i>L(1, i>pR). It is shown that the sets of type (i>a, i>b) arising from the Foulser and Kallaher construction in the case of projective spaces are isomorphic to some of those constructed in the present paper.
GPRS and UMTS release 2000 A11-IP option
Authors: Jonne Soininen
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (2000)

This article will describe to the reader the Universal Mobile Telecommunications System (UMTS) packet switched architecture and the UMTS release currently under specification --- Release 2000. The article will discuss the relevant features of the Release 1999 architecture in order to give the reader the background knowledge to understand the Release 2000 IP Multimedia architecture. Aspects of the Release 2000 are described in greater detail when the topic is especially interesting and revolutionary. For instance, why and how the Third Generation Partnership Project (3GPP) ended up mandating the Internet Protocol version 6.
Benchmarking Java against C and Fortran for scientific applications
Authors: J. M. Bull, L. A. Smith, L. Pottage, R. Freeman
Venue: Proceedings of the 2001 joint ACM-ISCOPE conference on Java Grande (2001)

Increasing interest is being shown in the use of Java for scientific applications. The Java Grande benchmark suite [4] was designed with such applications primarily in mind. The perceived lack of performance of Java still deters many potential users, despite recent advances in just-in-time (JIT) and adaptive compilers. There are however few benchmark results available comparing Java to more traditional languages such as C and Fortran. To address this issue, a subset of the Java Grande Benchmarks have been re-written in C and Fortran allowing direct performance comparisons between the three languages. The performance of a range of Java execution environments, C and Fortran compilers have been tested across a number of platforms using the suite. These demonstrate that on some platforms (notably Intel Pentium) the performance gap is now quite small.
Designing presentations for on-demand viewing
Authors: Liwei He, Jonathan Grudin, Anoop Gupta
Venue: Proceedings of the 2000 ACM conference on Computer supported cooperative work (2000)

Increasingly often, presentations are given before a live audience, while simultaneously being viewed remotely and recorded for subsequent viewing on-demand over the Web. How should video presentations be designed for web access? How is video accessed and used online? Does optimal design for live and on-demand audiences conflict? We examined detailed behavior patterns of more than 9000 on-demand users of a large corpus of professionally prepared presentations. We find that as many people access these talks on-demand as attend live. Online access patterns differ markedly from live attendance. People watch less overall and skip to different parts of a talk. Speakers designing presentations for viewing on-demand should emphasize key points early in the talk and early within each slide, use slide titles that reveal the talk structure and are meaningful outside the flow of the talk. In some cases the recommendations conflict with optimal design for live audiences. The results also provide guidance in developing tools for on-demand multimedia authoring and use.
Competitive auctions and digital goods
Authors: Andrew V. Goldberg, Jason D. Hartline, Andrew Wright
Venue: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms (2001)

We study a class of single round, sealed bid auctions for items in unlimited supply such as digital goods. We focus on auctions that are truthful and competitive. Truthful auctions encourage bidders to bid their utility; competitive auctions yield revenue within a constant factor of the revenue for optimal fixed pricing. We show that for any truthful auction, even a multi-price auction, the expected revenue does not exceed that for optimal fixed pricing. We also give a bound on how far the revenue for optimal fixed pricing can be from the total market utility. We show that several randomized auctions are truthful and competitive under certain assumptions, and that no truthful deterministic auction is competitive. We present simulation results which confirm that our auctions compare favorably to fixed pricing. Some of our results extend to bounded supply markets, for which we also get truthful and competitive auctions.
Designing a flexible services-based architecture for Internet applications
Authors: Vijay Mehra, Richard K. Walker, Jeffrey S. Brashear, Mohan Tavorath
Venue: Addendum to the 2000 proceedings of the conference on Object-oriented programming, systems, languages, and applications (Addendum) (2000)

This article describes a flexible architecture for developing services-based business applications that use component-based architectural services to demarcate the application into various tiers that enable the decoupling of each layer, both logically and physically. This provides the speed and flexibility needed to embrace new product ideas, channels, and markets.
The instrumentation of multics
Authors: Jerome H. Saltzer, John W. Gintell
Venue: Communications of the ACM (1970)

An array of measuring tools devised to aid in the implementation of a prototype computer utility is discussed. These tools include special hardware clocks and data channels, general purpose programmed probing and recording tools, and specialized measurement facilities. Some particular measurements of interest in a system which combines demand paging with multiprogamming are described in detail. Where appropriate, insight into effectiveness (or lack thereof) of individual tools is provided.
Effective site finding using link anchor information
Authors: Nick Craswell, David Hawking, Stephen Robertson
Venue: Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval (2001)

Link-based ranking methods have been described in the literature and applied in commercial Web search engines. However, according to recent TREC experiments, they are no better than traditional content-based methods. We conduct a different type of experiment, in which the task is to find the main entry point of a specific Web site. In our experiments, ranking based on link anchor text is twice as effective as ranking based on document content, even though both methods used the same BM25 formula. We obtained these results using two sets of 100 queries on a 18.5 million document set and another set of 100 on a 0.4 million document set. This site finding effectiveness begins to explain why many search engines have adopted link methods. It also opens a rich new area for effectiveness improvement, where traditional methods fail.
Data Locality Exploitation in the Decomposition of Regular Domain Problems
Authors: Manuel Prieto, Ignacio M. Llorente, Francisco Tirado
Venue: IEEE Transactions on Parallel and Distributed Systems (2000)

The aim of this paper is to study the effect of local memory hierarchy and communication network exploitation on message sending and the influence of this effect on the decomposition of regular applications. In particular, we have considered two different parallel computers, a Cray T3E-900 and an SGI Origin 2000. In both systems, the bandwidth reduction due to non-unit-stride memory access is quite significant and could be more important than the reduction due to contention in the network. These conclusions affect the choice of optimal decompositions for regular domains problems. Thus, although traditional 3D decompositions lead to lower inherent communication-to-computation ratios and could exploit more efficiently the interconnection network, lower dimensional decompositions are found to be more efficient due to the data decomposition effects on the spatial locality of the messages to be communicated. This increasing importance of local optimisations has also been shown using a well-known communication-computation overlapping technique which increases execution time, instead of reducing it as we could expect, due to poor cache memory exploitation.
Scalable and flexible cosimulation of SoC designs with heterogeneous multi-processor target architectures
Authors: Patrice Gerin, Sungjoo Yoo, Gabriela Nicolescu, Ahmed A. Jerraya
Venue: Proceedings of the 2001 Asia and South Pacific Design Automation Conference (2001)

In this paper, we present a cosimulation environment that provides modularity, scalability, and flexibility in cosimulation of SoC designs with heterogeneous multi-processor target architectures. Our cosimulation environment is based on an object-oriented simulation environment, SystemC. Exploiting the object orientation in SystemC representation, we achieve modularity and scalability of cosimulation by developing modular cosimulation interfaces. The object orientation also enables mixed-level cosimulation to be easily implemented thereby the designer can have flexibility in trade off between simulation performance and accuracy. Experiments with an IS-95 CDMA cellular phone system design show the effectiveness of the cosimulation environment.
Looking ahead of real time in Hybrid component networks
Authors: Kaixin Xu, Mineo Takai, Jay Martin, Rajive Bagrodia
Venue: Proceedings of the fifteenth workshop on Parallel and distributed simulation (2001)

While network simulation is a widely used technique for developing, testing and evaluating network protocols and applications, it is difficult and time-consuming to develop detailed models of the entire protocol stack and the application that is being evaluated. Hybrid component networks combine simulation models of protocols and applications with physical implementations of other protocols and/or applications, which can alleviate modeling complexity and build accurate models. However, hybrid component networks require that the simulated components execute faster than real time. Parallel simulation techniques can greatly improve the performance of hybrid component networks and facilitate evaluation of larger networks than would feasible only with sequential execution. In parallel simulation, one of the most important properties to be exploited from the simulation is &ldquo;lookahead,&rdquo; but none of the previous studies has exploited the lookahead from the physical implementation of protocols or applications. We have developed Virtual Socket Interface (VSI), which exploits real time lookahead from the interactions between operational applications and simulated networks in GloMoSim [1], a parallel discrete event network simulator. This paper presents the implementation of VSI with the notion of real time lookahead and evaluates VSI for typical wireless ad hoc network scenarios. The results of the study demonstrate that the parallel simulation with the real time lookahead greatly enhances the capability of hybrid component networks.
A note on best one-sided approximations
Authors: David L. Phillips
Venue: Communications of the ACM (1971)

In this note we consider the relationship between best approximations and best one-sided approximations for three different measures of goodness of fit. For these measures simple relationships exist between best approximations and best one-sided approximations. In particular it is shown that a best approximation and best one-sided approximation differ only by a multiplicative constant when the measure is the uniform norm of the relative error. In this case problems involving best one-sided approximations can be reduced to problems involving best approximations. The result is especially significant if one wants to numerically determine a best one-sided approximation, since algorithms exist for numerically determining best approximations when the measure is the uniform norm of the relative error (see, for example, [1]).
HP Certified: HP-UX system administration
Authors: Rafeeq Ur Rehman
Venue:  (2000)

The all-in-one authorized reference for HP certified, HP-UX system administration certification!If you are preparing for HP Certified, HP-UX System Administration certification, here's your all-in-one, authorized reference and preparation guide! The only preparation book approved by HP Education, HP Certified, HP-UX System Administration covers every exam objective in HP's three-part HP-UX System Administration exam (3HO-002). Best of all, this comprehensive book won't just help you prepare for the exam: it'll help you manage your systems for maximum efficiency today, tomorrow, and for years to come! Coverage includes all this, and more: UNIX and HP-UX fundamentals: installation, startup, logins, shells, processes, file systems, and more Managing users, groups, and accounts Security, auditing, performance management, and optimization HP-UX networking: configuring LAN devices, IP addresses, NFS, DNS, NIS, and more Printing, backup, storage management, kernel patches, peripherals, and more Essential shell programming and job automation techniques HP Certified: HP-UX System Administration contains detailed lists of exam objectives, summaries of key points and challenging review questions after every chapter, plus a complete sample exam. If you run HP-UX, this book is all you need to get certified. Even better, it's all you need to get results.
Automatic topology optimization for analog module generators
Authors: M. Wolf, U. Kleine
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

In this paper a new topology optimization feature of a module generator environment will be presented. The optimization is performed by removing redundant elements of objects already placed and by assessing different layout topologies of a module. This drastically reduces the length of the generator source code, because different topologies need no separate source code, but result automatically.
Creation and control of internal data bases under a Fortran programming environment
Authors: A. J. DeSalvio, J. G. Purdy, J. Rau
Venue: Communications of the ACM (1970)

A method is described for the definition of a user's COMMON structure and the automatic generation of the necessary COMMON, DIMENSION, EQUIVALENCE, and type declarations for each of the user's routines. The definition for the COMMON is contained in an easy to modify form, thus allowing the control of general communications of data between routines. The described system has been implemented on the IBM 7094, CDC 6000 series, and the IBM 360. The method has proved to be invaluable for the definition and control of COMMON in many large-scale programs.
A case of too much precision
Authors: Michael J. Synge
Venue: Communications of the ACM (1964)

I was so impressed and pleased by RDNUM, A. Hassitt's General-Purpose Input Routine [Comm. ACM 7, 6 (June 1964), 350-355], that I have transliterated it into FORTRAN II for the IBM 7094. In doing this I stumbled across solutions to a decimal-to-binary conversion problem that has long bugged FORTRAN. Let me hasten to say, before C. H. Weisert [Letter to the Editor, Comm. ACM 7, 5 (May 1964), 314] castigates me for discussing 7090 problems in your columns, that the matter discussed here is relevant to any machine conversion algorithm. 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
Realizing fault resilience in Web-server cluster
Authors: Chu-Sing Yang, Mon-Yen Luo
Venue: Proceedings of the 2000 ACM/IEEE conference on Supercomputing (CDROM) (2000)

Today, a successful Internet service is absolutely critical to be up 100 percent of the time. Server clustering is the most promising approach to meet this requirement. However, the existing Web server-clustering solutions merely can provide high availability derived from their redundancy nature, but offer no guarantee about fault resilience for the service. In this paper, we address this problem by implementing an innovative mechanism which enables a Web request to be smoothly migrated and recovered on another working node in the presence of server failure. We will show that request migration and recovery could be efficiently achieved in the manner of user transparency. The achieved capability of fault resilience is important and essential for a variety of critical services (e.g., E-commerce), which are increasingly widespread used. Our approach takes an important step toward providing a highly reliable Web service.
Abstractions of Random Finite-State Machines
Authors: Kostas N. Oikonomou
Venue: Formal Methods in System Design (2001)

Suppose that M is a large, complex finite-state system (fsm), and we want to construct a smaller model of it. A way of doing so, independent of any special properties that M might have, is to partition its states, inputs, and outputs into classes, collectively referred to as an abstraction. Since abstractions map many fsms into a non-deterministic machine defining an indistinguishability class, given a particular M, an optimal abstraction will minimize the size of this class. Algorithms for constructing such abstractions have been investigated in previous work.In this paper we are interested in large fsms generated by some random procedure, and want to find abstractions that minimize the expected size of an indistinguishability class. We establish various theoretical properties of abstractions optimal in an average sense, and also investigate experimentally how their characteristics change with the parameters governing the structure of the random machines.
Record linkage: making maximum use of the discriminating power of identifying information
Authors: Howard B. Newcombe, James M. Kennedy
Venue: Communications of the ACM (1962)

Special difficulties are encountered in devising reliable systems for searching and updating any large files of documents that must be identified primarily on the basis of names and other personal particulars. The underlying problem is that of making nearly maximum use of items of identifying information that are individually unreliable but that may collectively be of considerable discriminating power. Rules that can be applied generally to name retrieval systems have been developed In a methodological study of the linkage of vital and health records into family groupings for demographic research purposes. These rules are described, and the ways in which information utilization for matching may be optimized are discussed.