ppxscal/embedding_network huggingface dataset:
A Technique for Adaptation to Available Resources on Clusters Independent of Synchronization Methods Used
Authors: Umit Rencuzogullari, Sandhya Dwarkadas
Venue: Proceedings of the 2002 International Conference on Parallel Processing (2002)

Clusters of Workstations (COW) offer high performance relative to their cost. Generally these clusters operate as autonomous systems running independent copies of the operating system, where access to machines is not controlled and all users enjoy the same access privileges. While these features are desirable and reduce operating costs, they create adverse effects on parallel applications running on these clusters. Load imbalances are common for parallel applications on COWs due to: 1) variable amount of load on nodes caused by an inherent lack of parallelism, 2) variable resource availability on nodes, and 3) independent schedulingdecisions made by the independent schedulers on each node. Our earlier study has shown that an approach combining static program analysis, dynamic load balancing, and scheduler cooperation is effective in countering the adverse effects mentioned above. In our current study, we investigate the scalability of our approach as the number of processors is increased. We further relax the requirement of global synchronization, avoiding the need to use barriersand allowing the use of any other synchronization primitives while still achieving dynamic load balancing. The use of alternative synchronization primitives avoids the inherent vulnerability of barriers to load imbalance. It also allows load balancing to take place at any point in the course of execution, rather than only at a synchronization point, potentially reducing the time the application runs imbalanced. Moreover, load readjustment decisions are made in a distributed fashion, thus preventing any need for processes to globally synchronize in order to redistribute load.
Embedded Zero Wavelet Coefficient Coding Method for FPGA Implementation of Video Codec in Real-Time Systems
Authors: Kazimierz Wiatr, Pawe Russek
Venue: Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00) (2000)

The issues of video coding based on exceptionally suitable for SHD format Shapiro EZW (Embedded Zero Wavelet) algorithm is discussed in this paper. The main aspect is a possibility of building a real time system, which is able to process the algorithm. Thus, a dedicated architecture for the purpose is concerned. The method presented below is based on EZW method modified such a way to simplify hardware architecture dedicated for its executing. Such a simplification allows using FPGA technology as a target platform for the system.The MISD (Multiple Instruction-stream Single Data-stream) architecture is proposed as a solution of the problem. The architecture is characterized by high-speed execution of the EZW algorithm. Simplicity and performance classify the algorithm for implementation in high capacity programmable FPGA structures. The presented paper is an author's contribution in world's development of custom computing machines - CCM.
Traceability and Modularity in Software Design
Authors: R. J. Wieringa
Venue: Proceedings of the 9th international workshop on Software specification and design (1998)

A software design specification consists of a number of documents that describe various aspect of the design at different levels of detail, that are linked in many ways. This paper shows how different designs may use different modularization criteria, and how documents describing these designs may be linked in a coherent way, even if the designs use techniques borrowed from structured as well as object-oriented analysis and design. Illustrations are taken from the meeting scheduler case study.
An Organization of Logic Deduction on the Basis of Sequents Fuzzy Calculus
Authors: Sergey V. Astanin
Venue: Proceedings of the 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS'02) (2002)

This paper presents an approach to modeling of reasoning on the base structured rules of thetransformation fuzzy formulas. Particularity of the approach consists in possibility of organizations logical conclusion in situational networks, describing behavior of dynamic systems and processes.
ELSNET Italian Corpus Sample
Authors: Ornella Corazzari, Monica Monachini
Venue:  (1995)

The sample of the corpus to be distributed within the framework of the ELSNET action and tagged according to the EAGLES recommendations (Monachini and Calzolari 1995) has been selected from a subset of the Italian Reference Corpus - henceforth IRC - (Bindi Monachini Orsolini 1991), available at ILC - Pisa. Selection parameters have been taken into account in order to extract the material from this subset of the IRC, which has 3.5 M of occurrences for distribution (Bindi, Monachini, Orsolini 1992).
Panel Discussion on Open ADS
Authors: Seiichi Shin
Venue: Proceedings of the The Fourth International Symposium on Autonomous Decentralized Systems (1999)

A new type of information and control system has been postulated recently, in which the customer satisfaction of individual has much more importance. The trend has come about through a user business process reengineering for meeting the variable customized requirements adaptively and promptly, which has required the information processing and real-time control with extreme efficiency and flexibility. The recent customer-driven manufacturing system is one of typical examples. Such system is expected to consist of open components such as not only work stations(WS), personal computers(PC) and open networks like Ethernet but also controllers, intelligent devices and field networks.The network protocols based on ADS concept have been already adopted in some organizations for the standard of open manufacturing system, which has made it possible to realize the information and control systems of real industry world. 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
Perfect Enough: Carly Fiorina and the Reinvention of Hewlett-Packard
Authors: George Anders
Venue:  (2003)

:"Fresh from her triumph at Lucent, Carly Fiorina took command of Hewlett-Packard in July 1999. Ever since, there has been worldwide fascination with her eventual destiny. She was venturing further than any woman previously had into traditional men's territory. This wasn't just the engineer's realm of bits and bytes; this was the guys' world of beer blasts, rolled-up shirt sleeves, and deer-hunting trips to the founders' ranch." "Could Fiorina use her charismatic salesmanship, earthy wit, and iron will to rescue a $40 billion company from a painful period of decline? If she failed, would her missteps destroy Hewlett-Packard, the revered computer and printer company that helped create Silicon Valley?" Perfect Enough is the definitive account of the most dangerous year in Carly Fiorina's life, chronicling her daredevil bid to remake HP with a record-shattering $20 billion acquisition of archrival Compaq Computer. Not since the late 1980s - when Wall Street operatives battled over the fate of RJR Nabisco - has a takeover drama so decisively moved beyond the business pages to become an enduring passage in American history.
An Experimental Investigation of the Potential of BLF-driven Scheduling of Real-time Threads
Authors: K. Kim, Y. Kim
Venue: Proceedings of the 2nd IEEE International Conference on Engineering of Complex Computer Systems (1996)

Resource allocation in complex real-time computer systems (RTCSs) cannot be adequately handled by straightforward extensions of the CPU and peripheral device scheduling techniques used in non-RTCSs. Rather, all the resources including CPUs, peripheral devices, communication channels, etc. should be handled in an integrated manner. As an idealistic framework we laid out a globally optimal resource allocation methodology based on the benefit loss function (BLF), which includes both static resource allocation and design of dynamic resource allocation algorithms. As a small experimental part of this research we also designed and implemented a BLF-driven thread scheduler (CPU scheduler) on Solaris 2.3. This experiment showed that existing processor scheduling approaches were not competitive against a quickly developed BLF-driven scheduling approach with respect to minimizing the total benefit loss. Therefore, the BLF-driven resource allocation approach opens doors for many new worthwhile research efforts.
Randomized Byzantine Agreement
Authors: Kenneth J. Perry
Venue:  (1984)

A randomized model of distributed computation was presented in [Rabin83]. This model admits a solution to the Byzantine Agreement Problem for systems of $n$ asynchronous processes where no more than $t$ are faulty. The algorithm described in [Rabin83] produces agreement in an expected number of rounds whish is a small constant independent of $n$ and $t$. Using the same model, we present an algorithm of similar complexity which is able to tolerate a greater proportion of malicious processes. The algorithm is also applicable, with minor changes, to systems of synchronous processes.
Characterizing Parallel File-Access Patterns on a Large-Scale Multiprocessor
Authors: Apratim Purakayastha, Schlatter C Ellis, David Kotz, Nils Nieuwejaar, Michael Best
Venue:  (1994)

Rapid increases in the computational speeds of multiprocessors have not been matched by corresponding performance enhancements in the I/O subsystem. To satisfy the large and growing I/O requirements of some parallel scientific applications, we need parallel file systems that can provide high-bandwidth and high-volume data transfer between the I/O subsystem and thousands of processors. Design of such high-performance parallel file systems depends on a thorough grasp of the expected workload. So far there have been no comprehensive usage studies of multiprocessor file systems. Our CHARISMA project intends to fill this void. The first results from our study involve an iPSC/860 at NASA Ames. This paper presents results from a different platform, the CM-5 at the National Center for Supercomputing Applications. The CHARISMA studies are unique because we collect information about every individual read and write request and about the entire mix of applications running on the machines. The results of our trace analysis lead to recommendations for parallel file system design. First, the file system should support efficient concurrent access to many files, and I/O requests from many jobs under varying load condit ions. Second, it must efficiently manage large files kept open for long periods. Third, it should expect to see small requests, predominantly sequential access patterns, application-wide synchronous access, no concurrent file-sharing between jobs, appreciable byte and block sharing between processes within jobs, and strong interprocess locality. Finally, the trace data suggest that node-level write caches and collective I/O request interfaces may be useful in certain environments.
Analysis of delay performance of ATM signaling link
Authors: K. Kant
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 3)-Volume - Volume 3 (1995)

The paper presents an analytic model to explore the delay performance of SSCOP (service specific connection oriented protocol), which is a signaling protocol for establishing and removing B-ISDN connections in a switched virtual circuit (SVC) ATM network. A comparison with simulation shows that the analytic model works very well in spite of many complexities of the protocol. Such a model is invaluable for choosing appropriate protocol parameters, setting delay requirements, and for studying error monitoring algorithms for ATM signaling links.
Exploiting Redundancy for Timeliness in TCP Boston
Authors: Azer Bestavros, Gitae Kim
Venue:  (1997)

Abstract While ATM bandwidth-reservation techniques are able to offer the guarantees necessary for the delivery of real-time streams in many applications (e.g. live audio and video), they suffer from many disadvantages that make them inattractive (or impractical) for many others. These limitations coupled with the flexibility and popularity of TCP/IP as a best-effort transport protocol have prompted the network research community to propose and implement a number of techniques that adapt TCP/IP to the Available Bit Rate (ABR) and Unspecified Bit Rate (UBR) services in ATM network environments. This allows these environments to smoothly integrate (and make use of) currently available TCP-based applications and services without much (if any) modifications. However, recent studies have shown that TCP/IP, when implemented over ATM networks, is susceptible to serious performance limitations. In a recently completed study, we have unveiled a new transport protocol, TCP Boston, that turns ATM''s 53-byte cell-oriented switching architecture into an advantage for TCP/IP. In this paper, we demonstrate the real-time features of TCP Boston that allow communication bandwidth to be traded off for timeliness. We start with an overview of the protocol. Next, we analytically characterize the dynamic redundancy control features of TCP Boston. Next, We present detailed simulation results that show the superiority of our protocol when compared to other adaptations of TCP/IP over ATMs. In particular, we show that TCP Boston improves TCP/IP''s performance over ATMs for both network-centric metrics ({\em e.g.}, effective throughput and percent of missed deadlines) and real-time application-centric metrics (e.g., response time and jitter).
Teleoperation System for Real World Robots - Adaptive Robot Navigation Based on Sensor Fusion
Authors: Yoshikazu Arai, Jun Hakura
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems: Workshops (2000)

In this paper, we propose a teleoperation system with an autonomous robot, which is able to solve tasks even without a large load for the operator, and the system. Most teleoperation systems require skilled operators and expensive interfaces to solve tasks because they assume that the operator controls a robot completely. For these problems, we propose a teleoperation system, which consists of an operation system and an autonomous robot. The operation system has a man-machine interface and allows user to specify the working space and the tasks to be done. The autonomous robot follows the instruction from the operation system to solve the certain tasks. This paper focuses on navigation problems of the autonomous robot as an essential part of the proposed system. Namely, the autonomous robot should keep on the instructed paths in the real world to achieve a goal of the tasks. Our approach is based on a sensor fusion method based on the learning schemes, that is, the Self-Organizing Map (SOM) and the reinforcement learning. These learning schemes allow the system to be able to solve the tasks in the unreliable environment such as an outdoor. The computational simulations reveal effectiveness and robustness of the proposed method in the navigation problem.
Parallel Algorithms For Graph Problems (Thesis)
Authors: Panagiotis Metaxas
Venue:  (1992)

In this thesis we examine three problems in graph theory and propose efficient parallel algorithms for solving them. We also introduce a number of parallel algorithmic techniques.
Deterministic Simulations of PRAMs on Bounded Degree Networks
Authors: Kieran T. Herley, Gianfranco Bilardi
Venue:  (1988)

The problem of simulating a PRAM with $n$ processors and memory size $m \geq n$ on an $n$-node bounded degree network is considered. A scheme is presented which simulates an arbitrary PRAM step in $O ((\log n \log m)/\log \log n)$ time in the worst case on an expander-based network. By extending a previously established lower bound, it is shown that the proposed simulation is optimal whenever $\Omega (n^{1 + \epsilon}) \leq m \leq O(2^{(\log n)\alpha})$ for some $\epsilon < O$ and some $\alpha < O$.
The finite element approximation for minimal surfaces subject to the plateau problems
Authors: H. Gu
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

This paper talks about generating the minimal surfaces which are subject to the well-known Plateau problem. The differential form of the Plateau problem is defined at first and, its associated discrete schemes which reduced from the finite element methods could be practically solved by the numerical iteration methods like the Newton's iteration. The convergence property of the finite element solutions are proved by steps and some multi-grid algorithms have been implemented to speed up the computation. These new approximation methods will be applied to the project of generating the minimal surfaces on computer softwares later.
Self-Organizing File Cabinet
Authors: Dawn Lawrie
Venue:  (1997)

This thesis presents a self-organized file cabinet. This file cabinet uses electronic information to augment the physical world. By using a scanner to transform documents into electronic files, the self-organized file cabinet can index the documents on visual and textual information. The self-organized file cabinet helps the user find the documents at a later date. The focus of this thesis is on the design and evaluation of the self-organized file cabinet. User studies show that this tool is natural to use.
Implicit link analysis for small web search
Authors: Gui-Rong Xue, Hua-Jun Zeng, Zheng Chen, Wei-Ying Ma, Hong-Jiang Zhang, Chao-Jun Lu
Venue: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval (2003)

Current Web search engines generally impose link analysis-based re-ranking on web-page retrieval. However, the same techniques, when applied directly to small web search such as intranet and site search, cannot achieve the same performance because their link structures are different from the global Web. In this paper, we propose an approach to constructing implicit links by mining users' access patterns, and then apply a modified PageRank algorithm to re-rank web-pages for small web search. Our experimental results indicate that the proposed method outperforms content-based method by 16%, explicit link-based PageRank by 20% and DirectHit by 14%, respectively.
Towards the Semantic Web: Ontology-driven Knowledge Management
Authors: John Davies, Frank van Harmelen, Dieter Fensel
Venue:  (2002)

:"Towards the Semantic Web focuses on the application of Semantic Web technology and ontologies in particular to electronically available information to improve the quality of knowledge management in large and distributed organizations. Covering the key technologies for the next generation of the WWW, this book is a mixture of theory, tools and applications in an important area of WWW research." Aimed primarily at researchers and developers in the area of WWW-based knowledge management and information retrieval. It will also be a useful reference for students in computer science at the postgraduate level, academic and industrial researchers in the field, business managers who are aiming to increase the corporations' information infrastructure and industrial personnel who are tracking WWW technology developments in order to understand the business implications.
Constraint Selection and Deterministic Annealing
Authors: Alistair I. Mees, Cameron Tovey
Venue: Journal of Global Optimization (2003)

The deterministic annealing optimization method is related to homotopy methods of optimization, but is oriented towards global optimization: specifically, it tries to tune a penalty parameter, thought of as ``temperature'', in such a way as to reach a global optimum. Optimization by deterministic annealing is based on thermodynamics, in the same sense that simulated annealing is based on statistical mechanics. It is claimed to be very fast and effective, and is popular in significant engineering applications. The language used to describe it is usually that of statistical physics and there has been relatively little attention paid by the optimization community; this paper in part attempts to overcome this barrier by describing deterministic annealing in more familiar terms.The main contribution of this paper is to show explicitly that that constraints can be handled in the context of deterministic annealing by using constraint selection functions, a generalization of penalty and barrier functions. Constraint selection allows embedding of discrete problems into (non-convex) continuous problems.We also show how an idealized version of deterministic annealing can be understood in terms of bifurcation theory, which clarifies limitations of its convergence properties.
Super Recursive Baselines: A Family of New Interconnection Networks with High Performance/Cost Ratios
Authors: Guofeng Hou, Yulu Yang
Venue: Proceedings of the 2000 International Symposium on Parallel Architectures, Algorithms and Networks (2000)

Under the current condition of the VLSI technique, 8 X8switches used in MNs have the best performance/costratios. Based on Delta network, Baseline network andcurrent VLSI technique development level, this paper putsforward the idea of a new family of MNs using 8 X8switches which is called Super Recursive BaselineInterconnection Network (SRB), expounds its networktopological properties and routing techniques, makesperformance analysis in this network, and proves that ithas superior qualities in network pass rates, bandwidthsand performance/cost ratios, etc. Finally, this paper statesthat SRB is a family of Multistage InterconnectionNetwork simple in routing, superior in performance/costratio, and easy in expanding.
Automatic Failure Detection, Logging, and Recovery for High-Availability Java Servers
Authors: Reinhard Klemm, Navjot Singh
Venue: Proceedings of the 13th International Symposium on Software Reliability Engineering (2002)

Many systems and techniques exist for detecting appli-cation failures. However, previously known generic failure detectionsolutions are only of limited use for Java applications because they donot take into consideration the specifcs of the Java language and theJava execution environment. In this article, we present the application-independent Java Application Supervisor (JAS). JAS can automati-cally detect, log, and resolve avariety of execution problems and fail-ures in Java applications. In most cases, JAS requires neither modi-fications nor access to the source code of the supervised application.A set of simple user-specfied policies guides the failure detection, log-ging, and recovery process in JAS. A JAS configuration manager au-tomatically generates default policies from the bytecode of an applica-tion. The user can modify these default policies as needed. Our ex-perimental studies show that JAS typically incurs little execution timeand memory overhead for the target application. We describe an ex-periment with a Web proxy that exhibits reliability and performanceproblems under heavy load and demonstrate an increase in the rateof successful requests to the server by almost 33% and a decrease inthe average request processing time by approximately 22% when usingJAS. Index Terms: Availability, Failure Detection, Java, Logging, ObjectPersistence, Policies, Recovery, Server.