ppxscal/embedding_network huggingface dataset:
Speculative Sequential Consistency with Little Custom Storage
Authors: Chris Gniady, Babak Falsafi
Venue: Proceedings of the 2002 International Conference on Parallel Architectures and Compilation Techniques (2002)

This paper proposes SC++lite, a sequentially-consistent system that relaxes memory order speculatively to bridge the performance gap among memory consistency models. Prior proposals to speculatively relax memory order require large custom on-chip storage to maintain a history of speculative processor and memory state while memory order is relaxed. SC++lite uses the memory hierarchy to store the speculative history, providing a scalable path for speculative SC systems across a wide range of applications and system latencies. We use cycle-accurate simulation of shared-memory multiprocessors to show that SC++lite can fully relax memory order while virtually obviating the need for custom on-chip storage. Moreover,while demand for storage increases significantly with larger memory latencies, SC++lite's ability to relax memory order remains insensitive to memory latency. An SC++lite system can improve performance over a base SC system by 28% with only 2KB of custom storage in a system with 16 processors. In contrast, speculative SC systems with custom storage require 51KB of storage to improve performance by 31% over a base SC system.
Business-to-Employee Cooperation Support through Online Job Interviews
Authors: Georgios A. Dafoulas, Adamantia G. Pateli, Mike Turega
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

The Internet has emerged as a viable and reliable tool for recruiting. Using the Internet and e-Business applications, companies and applicants can reach one another faster and easier. This convenience has resulted in significant challenges for Human Resource departments. First-generation automation tools made the initial step toward addressing these challenges. Early systems provided the ability to collect resumes online. However, they failed to solve hiring process problems and provide meaningful workflow. Within this scope, this paper proposes online interviews as a tool that allows recruiters to gather structured interview information and assess cultural fit, while at the same time streamlining the interview process and reducing interview biases. Online interviews cannot replace the traditional face-to-faceinterviews, but can definitely provide the means to help recruiters and hiring managers with interviewing challenges.
Joining Forces in Solving Large-Scale Quadratic Assignment Problems in Parallel
Authors: Adrian Brüngger, Ambros Marzetta, Jens Clausen, Michael Perregaard
Venue: Proceedings of the 11th International Symposium on Parallel Processing (1997)

Program libraries are one way to make the cooperation between specialists from various fields successful: the separation of application-specific knowledge from application independent tasks ensures portability, maintenance, extensibility, and flexibility. This paper demonstrates the success in combining problem-specific knowledge for the quadratic assignment problem (QAP) with the raw computing power offered by contemporary parallel hardware by using the library of parallel search algorithms ZRAM. The solutions of 10 previously unsolved large standard test-instances of the QAP are presented.
Flexible Workflow Management in the OPENflow System
Authors: J. J. Halliday, S. K. Shrivastava, S. M. Wheater
Venue: Proceedings of the 5th IEEE International Conference on Enterprise Distributed Object Computing (2001)

Abstract: Workflow management systems are required to provide flexible ways of managing workflows as the business processes they represent frequently require changes over time. Provision of flexibility features in workflow management systems is very much a research issue as workflow systems in use today have been found lacking in such features. Two approaches to achieving flexibility in workflows have been identified, namely flexibility by selection and flexibility by adaptation. Flexibility by selection is achieved by ensuring that there are a number of execution paths through the workflow process, such that key decision making points are well represented. This allows the appropriate path to be selected on a per-instance basis to take account of the prevailing circumstances. Flexibility by adaptation permits dynamic changes to workflows to include one or more new execution paths. This paper describes how flexibility is supported in the OPENflow distributed workflow system. In particular, it describes high level tool support for performing dynamic changes to a workflow. In OPENflow, dynamic reconfiguration mechanisms have been provided by making use of atomic transactions to add and remove one or more tasks and to allow the addition and removal of dependencies between tasks from a running workflow. Use of transactions ensures that changes are carried out atomically with respect to normal processing. An example application is described to illustrate flexible workflow management.
Combining Structure Search and Content Search for Online Courses
Authors: Carsten Lecon, Silke Seehusen
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

In order to allow flexible searching in online courses, both structure information and content information has to be considered. Consequently, an appropriate data model, an index structure and a query model which combine structure search and content search is required. The development process of an online course has to support the generation of this data, i.e. it has to separate and provide these two kinds of information. We give an overview of works concerning the development processes of online courses and of appropriated data models. Then we propose our development process, and introduce a data model and a query model which fulfills the requirements mentioned above by mapping the structure information on attributes.
Faster Simulation of Timed Petri Nets Via Distributed Simulation
Authors: Devendra Kumar, Amit Kohli, Venkatasubramaniam Narayanswamy
Venue: Proceedings of the 21st International Computer Software and Applications Conference (1997)

In an earlier work, we presented an approach towards the distributed simulation of Timed Petri Nets. This approach is based on some major changes to Chandy and Misra's null message based scheme. These changes were required because the well known distributed simulation schemes for discrete event systems do not directly apply to Timed Petri Nets due to non-autonomous nature of place nodes in these systems. Moreover, our scheme incorporated several ideas to increase the degree of concurrency and to reduce the number of overhead messages in distributed simulation. In this paper, we provide several algorithmic details to implement the above approach. The specific model of Timed Petri Nets that we assume here was also presented by us in the same earlier work.
Backup Path Allocation Based on a Correlated Link Failure Probability Model in Overlay Networks
Authors: Weidong Cui, Ion Stoica, Randy H. Katz
Venue: Proceedings of the 10th IEEE International Conference on Network Protocols (2002)

Communication reliability is a desired property in computer networks. One key technology to increase the reliability of a communication path is to provision a disjoint backup path. One of the main challenges in implementing this technique is that two paths that are disjoint at the IP or overlay layer may share the same physical links. As a result, although we may select a disjoint backup path at the overlay layer, one physical link failure may cause the failure of both the primary and the backup paths.In this paper, we propose a solution to address this problem. The main idea is to take into account the correlated link failure at the overlay layer. More precisely, our goal is to find a route for the backup path to minimize the joint path failure probability between the primary and the backup paths. To demonstrate the feasibility of our approach, we perform extensive evaluations under both single and double link failure models. Our results show that, in terms ofrobustness, our approach is near optimal and is up to 60% better than no backup path reservation and is up to 30% better than using the traditional shortest disjoint path algorithm to select the backup path.
Compiling process algebraic specifications into timed automata
Authors: Carl K. Chang, Yi-Te Tseng, Ugo Buy
Venue: Proceedings of the 21st International Computer Software and Applications Conference (1997)

The authors present LTP (Language of Timed Processes), a process-algebra-based specification language, for the specification of real-time applications. In addition to timing requirements involving the execution time of individual computations, LTP can specify timing constraints that are associated with process descriptions: periodic constraints and sporadic constraints. Periodic processes (e.g. sensors) are usually time-driven; sporadic processes are usually event-driven. In LTP common real-time constraints such as delays, deadlines, and timeouts can be modeled conveniently. They specifically introduce a new construct for modeling periodic behavior, which is quite common in real-time applications. They validate LTP specifications by translating from LTP to a kind of timed automata that is amenable to well-known model checking techniques. Although the models of LTP specifications, commonly known as timed transition systems, are usually infinite because of the presence of time, the translation results in a finite representation by which automatic verification is possible.
A Parallel Algorithm for Text Inference
Authors: Sanda M. Harabagiu, Dan I. Moldovan
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

In this paper we describe a highly parallel method for extracting inferences from text. The method is based on a marker-propagation algorithm that establishes semantic paths between knowledge base concepts. The paper presents the structure of the system, the marker-propagation algorithm, and results that show a large degree of parallelism.
ConC++: A Concurrent C++
Authors: Bangqing Li, Baowen Xu, Hongji Yang, William Cheng-Chung Chu
Venue: 24th International Computer Software and Applications Conference (2000)

In this paper we propose a programming language known as ConC++, which is extended from C++ to support multithread and concurrent programming using concurrent classes and protected classes. A concurrent class has an active function, which executes immediately when an object is instantiated. A protected class encapsulates a group of data and operations on them and it is used to implement synchronization and mutual exclusion among objects of concurrent classes, with centralized object concurrency control. The approach achieves object autonomous, decreases context switches and deadlocks and improves program performance.
Efficient Multicast Algorithms in All-Port Wormhole-Routed Hypercubes
Authors: Vivek Halwan, Füsun Özgüner
Venue: Proceedings of the international Conference on Parallel Processing (1997)

This paper presents several recursive heuristic methods for multicasting in all-port dimension-ordered wormhole-routed hypercubes. The methods described are stepwise contention-free and are primarily designed to reduce the number of communication steps. Experiments show that the number of steps can be significantly reduced compared to depth contention-free solutions previously described. These methods are also shown to be source-controlled depth contention-free and can be considered a generalization of the broadcast method described in \cite{kn:HoICPP94}, which is the most efficient method known.
An efficient scheme for complete exchange in 2D tori
Authors: Yu-Chee Tseng, Sandeep K. S. Gupta, Dhabaleswar K. Panda
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

All-to-all personalized communication, or complete exchange, is at the heart of numerous applications in parallel computing. An efficient complete exchange algorithm is proposed for square 2/sup n//spl times/2/sup n/ wormhole-routed tori. Previous work has only considered complete exchange algorithms for mesh networks. The proposed algorithm effectively uses the bisection bandwidth of a torus, which is twice that for an equal sized mesh, to achieve complete exchange in a time which is almost half of the (best known) complete exchange time on an equal sized mesh.
Knowledge-based Document Analysis
Authors: Karl-Hans Bläsius, Beate Grawemeyer, Isabel John, Norbert Kuhn
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

The performance of document analysis systems significantly depends on knowledge about the application domain that can be exploited in the analysis process. Typically one has to deal with different sources of knowledge like syntactic knowledge, semantic knowledge or strategic knowledge guiding the analysis process. We present a knowledge based document analysis system based on a knowledge representation language specially designed for document analysis tasks. It allows to model and to interpret structural knowledge about documents and knowledge about the analysis process declaratively in a common framework.
Issues in software component technology: position statement
Authors: Mehdi Jazayeri
Venue: Proceedings of the 21st International Computer Software and Applications Conference (1997)

The idea of building software from existing components is as old as the field of software engineering itself yet there are no accepted solutions. This problem is the key technical challenge in software engineering and deserves a concerted attack. While there are some hopeful signs on the horizon that show that the problem is being addressed, the problem remain difficult. I address some of the difficulties that we face.
Probabilistic Rotation: Scheduling Graphs with Uncertain Execution Time
Authors: Sissades Tongsima, Chantana Chantrapornchai, Edwin Hsing-Mean Sha, Nelson L. Passos
Venue: Proceedings of the international Conference on Parallel Processing (1997)

This paper proposes an algorithm called probabilistic rotation scheduling which takes advantage of loop pipelining to schedule tasks with uncertain times to a parallel processing system. These tasks normally occur when conditional instructions are employed and/or inputs of the tasks influence the computation time. We show that based on our loop scheduling algorithm the length of the resulting schedule can be guaranteed to be satisfied for a given probability. The experiments show that the resulting schedule length for a given probability of confidence can be significantly better than the schedules obtained by worst-case or average-case scenario.
A Nonparametric Density Model for Classification in a High Dimensional Space
Authors: Koji Tsuda, Michihiko Minoh
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

When the dimensionality of the feature space increases and takes beyond a certain point, the classification performance of a parametric classifier begins to deteriorate. This is because the number of parameters of the classifier depends on the dimensionality and gets too large in a high dimensional space. To obtain the density value at the point of interest without deriving the parameters, we propose a nonparametric Gaussian density model, where the sum of the log-density values at two points is described, without any parameter, by a function of the distance between the two points. The density value at the point of interest is estimated from the distance between the point and each of the training sample points using this model. We will empirically show that the density values estimated by the nonparametric model are more accurate than those by the parametric model in a high dimensional space. In a character recognition experiment, our nonparametric classifier achieved higher classification accuracy in comparison with the parametric classifier.
New Control Methods for the Realization of an Ultra-Large-Scale Cooperative Distributed System
Authors: Shinichiro Suda, Hayao Toyoma, Akihisa Handa, Kokichi Nakasaki
Venue: Proceedings of the 4th International conference on Enterprise Distributed Object Computing (2000)

Mission critical operations have a very high level of importance in that their interruption may cause social unrest or severe problems in corporate management operations. From this point of view, it is common to construct them by using mainframes with high reliability, high processing capacity and excellent continuity. We have met this need by developing an ultra-large-scale cooperative distributed system that realizes a mission criticality level equivalent to conventional systems, while at the same time achieving greatly reduced cost and meeting the development time frame of 2 years. We describe here a development example of creating an ultra-large-scale cooperative distributed system and the concepts and technologies related to the development process.
Experience with Parallel Computing on the AN2 Network
Authors: Daniel J. Scalesk, Michael Burrows, Chandramohan A. Thekkath
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

k Daniel J. Scalesk Michael Burrows, and Chandramohan A. ThekkathTechnology trends make it attractive to use workstations connected by a local area network as a multicomputing platform for parallel applications. Achieving acceptable application performance in such a workstation cluster using commodity components requires good support from system software and network hardware. This paper describes our experience with parallel programming in a workstation cluster and the implications for operating systems and network adaptor design. Our cluster consists entirely of commercially available hardware: 24 Alpha workstations connected by a 155 Mbits/s AN2 ATM network. We present results from running several parallel applications on this cluster. Our cluster demonstrates both excellent low-level communication performance and good overall application performance that compares favorably with dedicated multicomputers like the IBM SP2.
Interrupt-based hardware support for profiling memory system performance
Authors: Aaron Goldberg, John Trotter
Venue: Proceedings of the 1995 International Conference on Computer Design: VLSI in Computers and Processors (1995)

Fueled by higher clock rates and superscalar technologies, growth in processor speed continues to outpace improvement in memory system performance. Reflecting this trend, architects are developing increasingly complex memory hierarchies to mask the speed gap, compiler writers are adding locality enhancing transformations to better utilize complex memory hierarchies, and applications programmers are recoding their algorithms to exploit memory systems. All of these groups need empirical data on memory system behavior to guide their optimizations. This paper describes how to combine simple hardware support and sampling techniques to obtain such data without appreciably perturbing system performance. The idea is implemented in the Mprof prototype that profiles data stall cycles, first level cache misses, and second level misses on the Sun Sparc 10/41.
Building High-Assurance Systems Using COTS Components: Whether, Why, When and How?
Authors: Ray A. Paul, Ann T. Tai
Venue: The 4th IEEE International Symposium on High-Assurance Systems Engineering (1999)

The implementation of COTS-based high assurance is becoming a major challenge today when cost concern has led to increased use of COTS products for critical applications. On the other hand, vendors remain reluctant to incorporate fault tolerance features into COTS products because doing so is likely to increase development and production costs and thus weaken the market competitiveness of their products. Therefore, it is crucial for us to cope with the current state of COTS.This panel brings together the researchers and practitioners with expertise, experiences and insights on using COTS components to build high-assurance systems. The purpose of the panel is to foster debating, exchanging and integrating opinions, ideas and solutions from various perspective (e.g., COTS software versus COTS hardware, COTS for long-life deep-space systems versus COTS for highly-available communication applications). We specially solicitate different opinions on the following issues: Whether can we build high-assurance systems using COTS components? Why is it inappropriate or impossible to build high-assurance systems using COTS components? (If the answer to the first question is "No.") Why is it possible to use COTS components that are not designed for critical applications to build high-assurance systems? (If the answer to the first question is "Yes.") When (that is, under which circumstances and conditions) is it appropriate to use COTS components for high-assurance systems? How do we derive solutions to mitigate the problems and inadequacies of COTS products?Among the particular questions we intend to discuss are: 1. What are the evaluation criteria and tradeoff strategies for COTS product selection for high-assurance systems?2. Is it viable to influence the vendors to provide or enhance high-assurance properties for the future versions of their COTS products? What are the strategies?3. Which will be the most practical and effective basis for us to develop methodologies that mitigate the effects of design faults and/or inadequacies of COTS software: fault predication, fault containment, or adaptive fault tolerance4. Is it possible and practical to integrate the methods for mitigating the effects of the design faults/inadequacies of COTS software and hardware in a high-assurance system? And how, if the answer is positive?
Business Process Knowledge Modelling: Method and Tool
Authors: Giorgos Papavassiliou, Spyridon Ntioudis, Gregoris Mentzas, Andreas Abecker
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

The DECOR approach to Business Process Oriented Knowledge Management (BPOKM) is based upon an extended Business Process Modelling, including automatable knowledge retrieval activities, additional knowledge management tasks and sub-processes, and additional process variables used to instruct the latter two. In this paper we present the DECOR Business Process Modelling Method and a software tool to support it. The concepts are briefly illustrated with a use case from the social security sector.
A Data Model and Semantics of Objects with Dynamic Roles
Authors: Raymond K. Wong, H. Lewis Chau, Frederick H. Lochovsky
Venue: Proceedings of the Thirteenth International Conference on Data Engineering (1997)

Although the concept of roles is becoming a popular research issue in object-oriented databases and has been proven to be useful for dynamic and evolving applications, it has only been described conceptually in most of the previous work. Moreover, the important issues such as the semantics of roles (e.g., message passing) are seldom discussed. Furthermore, none of the previous work has investigated the idea of role player qualification, which models the fact that not every object is qualified to play a particular role. In this paper, we present a data model and the semantics of roles. We discuss each of the above issues and illustrate the ideas with examples. From these examples, we can easily see that the problems we discussed are fundamental and indeed exist in many complex applications.