ppxscal/embedding_network huggingface dataset:
Comparing Gang Scheduling with Dynamic Space Sharing on Symmetric Multiprocessors Using Automatic Self-Allocating Threads (ASAT)
Authors: Charles Severance, Richard J. Enbody
Venue: Proceedings of the 11th International Symposium on Parallel Processing (1997)

This work considers the best way to handle a diverse mix of multi-threaded and single-threaded jobs running on a single Symmetric Parallel Processing system. The traditional approaches to this problem are free scheduling, gang scheduling, or space sharing. This paper examines a less common technique called dynamic space sharing. One approach to dynamic space sharing, Automatic Self Allocating Threads (ASAT), is compared to all of the traditional approaches to scheduling a mixed load of jobs. Performance results for ASAT scheduling, gang scheduling, and free scheduling are presented. ASAT scheduling is shown to be the superior approach to mixing multi-threaded work with single threaded work.
Extracting Text from WWW Images
Authors: Jiangying Zhou, Daniel P. Lopresti
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

In this paper, we examine the problem of locating and extracting text from in-line images of World Wide Web pages. We described a text detection algorithm which is based on color clustering and connected component analysis. The algorithm first quantizes the color space of the input image into a number of color classes using a parameter-free clustering procedure. It then identifies text-like connected components in each color class based on their shapes. Finally, a post-processing procedure aligns text-like components into textlines. The experimental results show that our text extraction algorithm works well on a variety of test images.
A method of extracting curvature features and its application to handwritten character recognition
Authors: K. T. Miura, R. Sato, S. Mori
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

Proposes an orthodox method of extracting curvature features based on a curve fitting approximation. It enables us to obtain analog values of curvatures of a given curve. This means that a so-called gray zone between two categories can be identified and also that very shallow concavities can be detected. For this purpose, cubic B-splines are obtained using a least squares method with natural conditions at the end-points. The method was tested on synthesized noisy data sets such as 2/spl rarr/Z, 4/spl rarr/9 and 1/spl rarr/3. The results are so good that the method can be used to obtain analog features as intended. Demonstrative experimental results are shown for the data set for 1/spl rarr/3.
Effectiveness of Loss Labeling in Improving TCP Performance in Wired/Wireless Networks
Authors: Dhiman Barman, Ibrahim Matta
Venue: Proceedings of the 10th IEEE International Conference on Network Protocols (2002)

The current congestion-oriented design of TCP hinders its ability to perform well in hybrid wireless/wired networks. We propose a new improvement on TCP NewReno (NewReno-FF) using a new loss labeling technique to discriminate wireless from congestion losses. The proposed technique is based on the estimation of average and variance of the round triptime using a filter, called Flip Flop filter, that is augmented with history information. We show the comparative performance of TCP NewReno, NewReno-FF, and TCP Westwood through extensive simulations. We study the fundamental gains and limits using TCP NewReno with varying Loss Labeling accuracy (NewReno-LL) as a benchmark. Lastly our investigation opens up important research directions. First, there is a need for a finer grained classification of losses (even within congestion and wireless losses) for TCP in heterogeneous networks. Second, it is essential to develop an appropriate control strategy for recovery after the correct classification of a packet loss.
Efficient Sorting and Routing on Reconfigurable Meshes Using Restricted Bus Length
Authors: Manfred Kunde, Kay Guertzig
Venue: Proceedings of the 11th International Symposium on Parallel Processing (1997)

Sorting and balanced routing problems for synchronous mesh-like processor networks with reconfigurable buses are considered. Induced by the argument that broadcasting along buses of arbitrary length within unit time seems rather non-realistic, we consider basic problems on reconfigurable meshes that can be solved efficiently even with restricted bus length.It is shown that on r-dimensional reconfigurable meshes of side length n with bus length bounded to a constant l the h-h sorting and routing problem can be solved within hn+o(hrn) steps in any case and in hn/2+o(hrn) steps with high probability, provided that hl >= 4r. This result is due to a data concentration method that is explained in the paper and it will hold even for certain very light loadings, i.e. with significantly less than one elements per processor on average. Extensions to two-dimensional reconfigurable meshes with diagonal links are considered.
PEPPER-a timing driven early floorplanner
Authors: Vinod Narayananan, David LaPotin, Rajesh Gupta, Gopal Vijayan
Venue: Proceedings of the 1995 International Conference on Computer Design: VLSI in Computers and Processors (1995)

With increasing chip complexities and the requirement to reduce design time, early analysis is becoming increasingly important in the design of performance critical CMOS chips. As clock rates increase rapidly, interconnect delay consumes an appreciable portion of the chip cycle time, and the floorplan of the chip significantly affects its performance. This paper describes a system for early floorplan analysis of large designs. The floorplanner is designed to be used in the early stages of system design, to optimize performance, area and wireability targets before detailed implementation decisions are made. Most floorplanners which claim to optimize timing work only on a subset of paths during the floorplanning process. One novel feature of our floorplanner is that it performs static timing analysis during the floorplan optimization process, instead of working on a subset of the paths. The floorplanner incorporates various interactive and automatic floorplanning capabilities. The paper describes the floorplanning capabilities and algorithms as well as our experiences in using the tool.
A Log-Structured Organization for Tertiary Storage
Authors: Daniel Alexander Ford, Jussi Myllymaki
Venue: Proceedings of the Twelfth International Conference on Data Engineering (1996)

We present the design of a log-structured tertiary storage system (LTS). The advantage of this approach is that it allows the system to hide the details of juke-box robotics and media characteristics behind a uniform, random access, block-oriented interface. It also allows the system to avoid media mount operations for writes, giving write performance similar to that of secondary storage.
Software Maintainability Improvement: Integrating Standards and Models
Authors: William C. Chu, Chih-Wei Lu, Chih-Hung Chang, Yeh-Ching Chung, Yueh-Min Huang, Baowen Xu
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

Software standards are highly recommended because they promise faster and more efficient ways for software development with proven techniques and standard notations. Designers who adopt standards like UML and design patterns to construct models and designs in theprocesses of development suffer from a lack of communication and integration of various models and designs. Also, the problem of implicit inconsistency caused by making changes to components of the models and designs will significantly increase the cost and error for the process of maintenance. In this paper, an XML-based unified model is proposed to solve theproblems and to improve both software development and maintenance through unification and integration.
An Agent-Based Approach to Rapid Software Evolution Based on a Domain Model
Authors: S. J. Glover, Keith H. Bennett
Venue: Proceedings of the 1996 International Conference on Software Maintenance (1996)

In Simon Smith, Keith Bennett, and Cornelia Boldyreffs "Is Maintenance Ready for Evolution?", a proposal was made for constructing highly adaptable software based on an architecture that uses distributed agents. In this paper, a case study is described which follows this approach. The important contribution lies in developing a model of the application domain, in this case the relational database domain, which is then available for a domain agent to manipulate in developing strategies for changing the application software. The application domain is modelled as a set of entities related by constraints of different types. Domain adaptability is accomplished through both the creation of new entities and new constraints between entities. Why and how this approach is different from existing approaches to adapting databases is explained. Initial results have produced a domain model which makes explicit the potential points of adaptability in the domain being modelled, making it easier to adapt software. Additionally, the use of agent interaction protocols provides a basis for research into inter-operability between separate domains.
The PowerPC 603e microprocessor: an enhanced, low-power, superscalar microprocessor
Authors: Carlos Montemayor, Marie Sullivan, Jen-Tien Yen, Pete Wilson, Richard Evers, K. R. Kishore
Venue: Proceedings of the 1995 International Conference on Computer Design: VLSI in Computers and Processors (1995)

The PowerPC 603e microprocessor is a high performance, low cost, low power microprocessor designed for use in portable computers. The 603e is an enhanced version of the PowerPC 603 microprocessor and extends the performance range of the PowerPC microprocessor family of portable products. The enhancements include increasing the frequency to 100 MHZ doubling the on-chip instruction and data caches to 16 Kbytes each, increasing the cache associativity to 4-way set-associative, adding an extra integer unit, and increasing the throughput of stores and misaligned accesses. Three new bus modes are added to allow for more flexibility in system design. The estimated performance of the 603e at 100 MHz is 120 SPECint92 and 105 SPECfp92. The 603e is fabricated in the same 3.3 volt, 0.5 micron, four-level metal technology as the 603 and contains 2.6 million transistors. The die size is 98 mm/sup 2/. The typical power consumption of the 603e at 100 MHz is 3 watts. Like the 603, the 603e provides three software controllable power-down modes to further extend power saving capability.
Recognition of Printed Arabic Text Using Neural Networks
Authors: Adnan Amin, Wathiq Mansoor
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

The main theme of this paper is the automatic recognition of Arabic printed text using an artificial neural networks in addition to conventional techniques. This approach has a number of advantages: it combines rule-based (structure) and classification tests; and feature extraction is inexpensive and execution time is independent of character font and size. The technique can be divided into three major steps: the first step is preprocessing in which the original image is transformed into binary image utilizing a 300 dpi scanner and then forming the connected component. Second, global features of the input Arabic word are then extracted such as number of subwords, number of peaks within the subword, number and position of the complementary character, etc...Finally, an artificial neural networks is used for character recognition. The algorithm was implemented on a powerful MS-DOS microcomputer and written in C.
Trace-driven Analysis of Migration-based Gang Scheduling Policies for Parallel Computers
Authors: Sanjeev Setia
Venue: Proceedings of the international Conference on Parallel Processing (1997)

Gang scheduling is a job scheduling policy for parallel computers that combines elements of space-sharing and time-sharing. In this paper, we analyze the performance of gang scheduling policies that allow the remapping of an executing job to a new set of processors. Most previously proposed gang-scheduling policies do not allow such job remapping under the assumption that it is prohibitively expensive. Through a detailed trace-driven simulation, we analyze the tradeoff between the benefits and overheads of such job relocation. Our results show that gang-scheduling policies that support such job relocation offer significant performance gains over
Selectivity of Awareness Components in Asynchronous CSCW Environments
Authors: José Maria N. David, Marcos R. S. Borges
Venue: Proceedings of the Seventh International Workshop on Groupware (2001)

Abstract: Several proposals are found in literature, seeking above all, to reduce the information overload imposed on the participants of a group. Some of them are based on the use of filters to select the information according to the users' history of accesses. However, in most cases the filtering mechanisms cannot be determined by the users, thus not allowing them to concentrate on sets of information of their interest. This work presents the main issues related to the problem of selectivity of awareness information in asynchronous environments for cooperative work. It describes some mechanisms to allow each user to set his own filtering profile, which best supports his current activities.
Implementation of parallel graph algorithms on a massively parallel SIMD computer with virtual processing
Authors: Tsan-sheng Hsu, Vijaya Ramachandran, Nathaniel Dean
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

We describe our implementation, with virtual processing, of several parallel graph algorithms on a 16,384-processor MasPar MP-1. We present extensive test data on our code.
The Exu Approach to Safe, Transparent and Lightweight Interoperability
Authors: Alan Kaplan, John Bubba, Jack C. Wileden
Venue: Proceedings of the 25th International Computer Software and Applications Conference on Invigorating Software Development (2001)

Exu is a new approach to automated support for safe, transparent and lightweight interoperability in multilanguage software systems. The approach is safe because it enforces appropriate type compatibility across language boundaries. It is transparent since it shields software developers from the details inherent in low-level language-based interoperability mechanisms. It is lightweight for developers because it eliminates tedious and error-prone coding (e.g., JNI) and lightweight at run-time since it does not unnecessarily incur the performance overhead of distributed, IDL-based approaches. The Exu approach exploits and extends the object-oriented concept of meta-object, encapsulating interoperability implementation in meta-classes so that developers can produce interoperating code by simply using meta-inheritance. In this paper, an example application of Exu to development of Java/C++ (i.e., multilanguage) programs illustrates the safety and transparency advantages of the approach. Comparing the performance of the Java/C++ programs produced by Exu to the same set of programs developed using IDL-based approaches provides preliminary evidence of the performance advantages of Exu.
Maintenance in Joint Software Development
Authors: Pierre Fernand Tiako
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

The need to combine several efforts in software development has become critical because of the software development requirements and geographically dispersed qualified human resources, background skills, working methods, and software tools among autonomous software enterprises ¿ joint software development. We know that the organization and the development of software depend largely on human initiatives. All human initiatives are subject to change and perpetual evolution. A variety of studies have contributed to highlight the problems arising from the change and the perpetual evolution of the software development. These studies revealed that the majority of the effort spent on the software process is spent on maintenance. To reduce the efforts of software maintenance in joint software development, it is therefore necessary to detect the features of software maintenance processes susceptible to be automatized. The software maintenance problems in joint software development are caused by the changes and perpetual evolutions at theorganizational level of an enterprise or at the software development level. The complex nature of changes and perpetual evolutions at the organizational and the development levels includes the following factors: the maintenance contracts among enterprises, the abilities todevelop, experiences and background in software development, methodologies of software development, tools available and localization of the organizations. In this paper I look into the new software maintenance problems in joint software development by geographically dispersed virtual enterprises.
An Optimal Algorithm for the Angle-Restricted All Nearest Neighbor Problem on the Reconfigurable
Authors: Koji Nakano, Stephan Olariu
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

1 and r2, the Angle-Restricted All Nearest Neighborproblem (ARANN, for short) asks to compute for every point p in S the nearest point in S lying in the planar region bounded by two rays in the directions r1 and r2 emanating from p. The ARANN problem generalizes the well-known ANN problem and finds applications to pattern recognition, image processing, and computational morphology. Our main contribution is to present an algorithm that solves an arbitrary instance of size n of the ARANN problem in O(1) time on a reconfigurable mesh of size n x n. Our algorithm is optimal in the sense that O(n2) processors are necessary to solve the ARANN problem in O(1) time.
Applying Cascaded Feature Selection to SVM Text Categorization
Authors: Takeshi Masuyama, Hiroshi Nakagawa
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

This paper investigates the effect of a cascaded feature selection (CFS) in SVM text categorization. Unlike existing feature selections, our method (CFS) has two advantages. One can make use of the characteristic of each feature (word). Another is that unnecessary test documents for a category, which should be categorized into a negative set, can be removed in the first step. Compared with the method which does not apply CFS, our method achieved significant good performance especially about the categories which contain a small number of training documents.
Enterprise Modelling of Information Brokerage and Retailer Services
Authors: Ionel Tothezan, Eleutherios Athanassiou, Pierre Alzon, George T. Karetsos
Venue: Proceedings of the 1st International Conference on Enterprise Distributed Object Computing (1997)

This paper analyzes the Information Brokerage service business environment and proposes a suitable enterprise model. The model definition was made according to the ODP enterprise viewpoint syntax and semantics and provides a modular framework within which the various components of the system are functioning for supporting it's potential users in identifying and performing their tasks.The enterprise specification of the brokerage service starts from the definition of the actors involved in the service provisioning scenarios (End-Users, Brokerage Service Provider, Retailer, Content Providers, Information Service Providers, Network Providers), their respective domains , their roles and relationships. A set of Brokerage Service scenarios is presented using the concepts defined in the proposed model.
SIFA: A Scalable File System with Intelligent File Allocation
Authors: Hsiao-Ping Tsai, Jiun-Long Huang, Cheng-Ming Chao, Ming-Syan Chen, Cheen Liao
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

In this paper, we propose and evaluate a new NAS based system which is a consolidated file system in a network environment. The consolidated file system utilizes storage boxes cooperating as peers to provide all file system services, and presents itself to its NFS clients as a unified storage server. We have prototyped several key operations in this system. To provide more performance insights, we build a comprehensive system simulator and conduct extensive performance studies for the system via the simulator. This simulator has been run against a workload of a real Web server, and the system behavior of this workload is studied. In light of the experimental results, a consolidated file system is being implemented in full scale.
BRISK: A Portable and Flexible Distributed Instrumentation System
Authors: Aleksandar M. Bakic, Matt W. Mutka, Diane T. Rover
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

Researchers and practitioners in the area of parallel and distributed computing have been lacking a portable, flexible and robust distributed instrumentation system. We present the Baseline Reduced Instrumentation System Kernel (BRISK) that we have developed as a part of a real-time system instrumentation and performance visualization project. The design is based on a simple distributed instrumentation system model for flexibility and extensibility. The basic implementation poses minimalistic system requirements and achieves high performance. We show evaluations of BRISK using two distinct configurations: one emphasizes isolated simple performance metrics; and the other, BRISK's operation on distributed applications, its built-in clock synchronization and dynamic on-line sorting algorithms.
A New Flash Memory Management for Flash Storage System
Authors: Han-joon Kim, Sang-goo Lee
Venue: 23rd International Computer Software and Applications Conference (1999)

We propose a new way of managing flash memory space for flash memory-specific file systems based on log-structured file system. Flash memory has attractive features such as non-volatility, and fast I/O speed, but it also suffers from inability to update in place and limited usage cycles. These drawbacks require many changes to conventional storage (file) management techniques. Our focus is on lowering cleaning cost and evenly utilizing flash memory cells while maintaining a balance between the two often-conflicting goals. The cleaning efficiency is enhanced by dynamically separating cold data and non-cold data. The second goal, cycle-leveling is achieved to the degree where the maximum difference between erase cycles is below the error range of the hardware. Simulation results show that the proposed method has significant benefit over naive methods: maximum of 35% reduction in cleaning cost with even spreading writes across segments
Boundary Feature Extraction from Gray-Scale Document Images
Authors: Hirobumi Nishida
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

A novel method is presented for extracting closed boundaries of document components such as characters and symbols directly from gray-scale document images, based on the surface data structures along with structural features. The method is based on the simple model assuming that a closed boundary of document components can be approximated as a series of horizontal line segments and can be extracted by linking surface components with steep gradients which share commonly intersecting horizontal planes. The proposed algorithm is compared with some binarization algorithms, shown to be effective for improving recognition accuracy for very poor quality data.