ppxscal/embedding_network huggingface dataset:
Utilization-Based Admission Control for Scalable Real-Time Communication
Authors: Byung-Kyu Choi, Dong Xuan, Riccardo Bettati, Wei Zhao, Chengzhi Li
Venue: Real-Time Systems (2003)

We propose a utilization-based schedulability and admission control mechanism for distributed systems with workload aggregation to achieve scalability. We use the differentiated services (&comp;diffserv) architecture to describe and illustrate our approach. Scalability of admission control is achieved by determining off-line safe levels of server utilization. Scalability during the connection lifetimes is provided by the aggregation mechanisms (for example, class-based scheduling) provided by the &comp;diffserv architecture. Our evaluations show that our system&rsquo;s admission probabilities are very close to those of significantly more expensive approaches, which do not allow for workload aggregation. At the same time, admission control overhead during flow establishment is very low.
Scheduling for Embedded Real-Time Systems
Authors: Felice Balarin, Luciano Lavagno, Praveen Murthy, Alberto Sangiovanni-vincentelli
Venue: IEEE Design Test (1998)

Embedded systems are loosely defined as electronic subsystems immersed in a larger physical system (e.g., a car, an airplane, a washing machine, a cellular phone) that implement a given functionality (i.e. a set of tasks) using one or more software-programmable device (e.g. a microcontroller, a Digital Signal Processor). Hence implementing the given functionality in an embedded system involves the partitioning of the tasks into hardware and software components. Since the software has to be executed on a limited set of processing units and several embedded systems are safety critical, deciding the execution sequence for the tasks on the processing units (scheduling) is an important problem to guarantee that the embedded system functions correctly.In this article we review several approaches to software scheduling for real-time embedded computing. In particular, we illustrate scheduling methods for reactive systems (her, the main concern is the speed of response to different inputs from the environment) and for Digital Signal Processing systems (the main concern is the efficient utilization of the processor(s), in the presence of a semi-regular stream of inputs).Given the characteristics of embedded systems, we focus on the scheduling validation problem that aims at answering the question whether a given schedule is guaranteed to satisfy a given set of constraints (deadlines, throughput, and so on).
The Hybrid Field-Programmable Architecture
Authors: Alireza Kaviani, Stephen Brown
Venue: IEEE Design Test (1999)

This paper proposes a new field-programmable architecture that is a combination of two existing technologies: Field- Programmable Gate Arrays (FPGAs) based on LookUp Tables (LUTs), and Complex Programmable Logic Devices based on PLA-like blocks. The methodology used for development of the new architecture, called Hybrid FPGA, is based on analysis of a large set of benchmark circuits, in which we determine what types of logic resources best match the needs of the circuits. The proposed Hybrid FPGA is evaluated by technology mapping a set of circuits into the new architecture and estimating the total chip area needed and the depth for each circuit, compared to the area and depth that would be required if only LUTs were available. Our results indicate that on average LUT-based FPGAs need 78% more area than the Hybrid, while providing roughly the same depth for the circuits. Also, we show that it is possible to optimize the circuits for depth, such that the critical path of the circuits implemented in the new architecture is significantly shorter than the critical path when they are mapped to LUT-based FPGAs.
Warm Start and ε-Subgradients in a Cutting Plane Scheme
Authors: J. Gondizo, J.-P Vial
Venue: Computational Optimization and Applications (1999)

This paper addresses the issues involved with an interior point-based decomposition applied to the solution of linear programs with a block-angular structure. Unlike classical decomposition schemes that use the simplex method to solve subproblems, the approach presented in this paper employs a primal-dual infeasible interior point method. The above-mentioned algorithm offers a perfect measure of the distance to optimality, which is exploited to terminate the algorithm earlier (with a rather loose optimality tolerance) and to generate &epsi;-subgradients. In the decomposition scheme, subproblems are sequentially solved for varying objective functions. It is essential to be able to exploit the optimal solution of the previous problem when solving a subsequent one (with a modified objective). A warm start routine is described that deals with this problem. The proposed approach has been implemented within the context of two optimization codes freely available for research use: the Analytic Center Cutting Plane Method (ACCPM)&mdash;interior point based decomposition algorithm and the Higher Order Primal-Dual Method (HOPDM)&mdash;general purpose interior point LP solver. Computational results are given to illustrate the potential advantages of the approach applied to the solution of very large structured linear programs.
Dynamic Frame Dropping for Bandwidth Control in MPEG Streaming System
Authors: Hojung Cha, Jaehak Oh, Rhan Ha
Venue: Multimedia Tools and Applications (2003)

In a network environment where the available bandwidth changes dynamically, it is desirable for a streaming system to control the media quality in an adaptive way according to the dynamics of underlying network resource. This paper presents the implementation of a real-time MPEG filtering system which uses the concept of dynamic frame-drop. The filtering system drops video frames in a controlled way and reconstructs a valid MPEG system stream in real-time. The system consists of a sequence of filtering modules and each module is carefully designed to maintain the synchronization characteristics of real-time streaming. A special effort is given to the correct implementation of video and audio synchronization after frame-drop. The experiments show that the implemented system produces a valid MPEG system stream after filtering as well as the media bandwidth of a filtered stream is dynamically controlled by a given frame-drop policy.
Reducing and Vectorizing Procedures for Telescoping Languages
Authors: Arun Chauhan, Ken Kennedy
Venue: International Journal of Parallel Programming (2002)

At Rice University, we have undertaken a project to construct a framework for generating high-level problem solving languages that can achieve high performance on a variety of platforms. The underlying strategy, called telescoping languages, builds problem-solving systems from domain-specific libraries and scripting languages by extensively preanalyzing libraries to produce a precompiler that optimizes library calls within the scripts as if they were primitives in the underlying language. Our study of applications written in Matlab by the signal processing group at Rice University has identified a collection of old and new optimizations that show promise for this particular domain. Two promising new optimizations are procedure vectorization and procedure strength reduction. By transforming these programs, at source level, according to the strategies described in this paper, we were able to achieve speedups ranging from a factor of 1.1 to 1.6 over the entire applications&mdash;with speedups for individual functions as high as 3.3.
Globalization by Chunking: A Quantitative Approach
Authors: Audris Mockus, David M. Weiss
Venue: IEEE Software (2001)

Business needs often require software development to be distributed over many sites, often in different countries and continents. The authors introduce a quantitative method to assess the extent of the coordination problem in such environments by identifying tightly coupled work items, or chunks, that span several sites. They then propose a method to distribute the work among sites to minimize the need for coordination. The method distinguishes among parts of software that are not tightly coupled with each other by analyzing the work items that are recorded in software change management systems. The authors use this quantitative analysis to define a process for identifying chunks that are candidates to be moved to different sites for development.
Performance Analysis and Scheduling of Stochastic Fork-Join Jobs in a Multicomputer System
Authors: A. Kumar, R. Shorey
Venue: IEEE Transactions on Parallel and Distributed Systems (1993)

The authors model a parallel processing system comprising several homogeneouscomputers interconnected by a communication network. Jobs arriving to this system havea linear fork-join structure. Each fork of the job gives rise to a random number of tasksthat can be processed independently on any of the computers. Since exact analysis offork-join models is known to be intractable, the authors resort to obtaining analyticalbounds to the mean job response time of the fork-join job. For jobs with a single fork-joinand, probabilistic allocation of tasks of the job to the N processors, they obtain upperand lower bounds to the mean job response time. Upper bounds are obtained using theconcept of associated random variables and are found to be a good approximation to themean job response time. A simple lower bound is obtained by neglecting queueing delays. They also find two lower bounds that include queueing delays. For multiple fork-join jobs, they study an approximation based on associated random variables. Finally, two versions of the join-the-shortest-queue (JSQ) allocation policy (i.e., JSQ by batch and JSQ by task) are studied and compared, via simulations and diffusion limits.
The Combining DAG: A Technique for Parallel Data Flow Analysis
Authors: R. Kramer, R. Gupta, M. L. Soffa
Venue: IEEE Transactions on Parallel and Distributed Systems (1994)

As the number of available multiprocessors increases, so does the importance of providing software support for these systems, including parallel compilers. Data flow analysis, an important component of software tools, may be computed many times during the compilation of a program, especially when compiling for a multiprocessor. Althoughconverting a sequential data flow algorithm to a parallel algorithm can present someopportunities for computing data flow in parallel, more parallelism can be exposed by thedevelopment of new parallel data flow algorithms. We present a technique that computesrapid data flow problems in parallel and thus is applicable for commonly used classicaldata flow problems, including reaching definitions, reachable uses, available expressions,and very busy expressions. Unlike previous techniques, our technique exploits theinherent parallelism in the data flow computation that occurs across independent paths,within linear paths, and in paths through loops of a control flow graph. The technique first changes cyclic structures in a control flow graph to acyclic structures and then builds a combining directed acyclic graph (DAG) that represents the paths through the control flow graph needed to compute data flow. Data flow is then computed using two passesover the DAG by computing the data flow for the nodes on each level of the DAG inparallel. We also present experimental results comparing the performance of our algorithm with a sequential algorithm and a parallelized sequential algorithm.
Bundle Methods in Stochastic Optimal Power Management: A Disaggregated Approach Using Preconditioners
Authors: Léonard Bacaud, Claude Lemaréchal, Arnaud Renaud, Claudia Sagastizábal
Venue: Computational Optimization and Applications (2001)

A specialized variant of bundle methods suitable for large-scale problems with separable objective is presented. The method is applied to the resolution of a stochastic unit-commitment problem solved by Lagrangian relaxation. The model includes hydro- as well as thermal-powered plants. Uncertainties lie in the demand, which evolves in time according to a tree of scenarios. Dual variables are preconditioned by using probabilities associated to nodes in the tree The approach is illustrated by numerical results, obtained on a model of the French production mix over a time horizon of 10 days and 1 month.
Regularity results for some 1-homogeneous functionals
Authors: Matteo Novaga, Emanuele Paolini
Venue: Nonlinear Analysis: Real World Applications (2002)

We consider local minimizers for a class of 1-homogeneous integral functionals defined on BVloc(Ω), with Ω ⊆ R2. Under general assumptions on the functional, we prove that the boundary of the subgraph of such minimizers is (locally) a lipschitz graph in a suitable direction. The proof of this statement relies on a regularity result holding for boundaries in R2 which minimize an anisotropic perimeter. This result is applied to the boundary of sublevel sets of a minimizer u ∈ BVloc(Ω).We also provide an example which shows that such regularity result is optimal.
A Simple Method for Calculating the Financial Balance of a Hospital, Based on Proportional Dividing
Authors: Toshio Makie, Miho Miyazaki, Shinji Kobayashi, Takeharu Yamanaka, Naoko Kinukawa, Eisuke Hanada, Yoshiaki Nose
Venue: Journal of Medical Systems (2002)

It is necessary to estimate financial status to determine hospital management policy. The costs and revenues (financial balance) of each hospital division are one good index. However, it is difficult to calculate the financial balance for each division, since clinics and central services are intricately involved with each other. There are no reports on a pragmatic method for calculating the financial balance. We devised a simple method based on proportional dividing. Consequently, one individual was able to complete the calculation for our hospital, which consists of 1300 beds and 23 clinics, without using the central hospital computer system.
A Hybrid Neural Network Model for Solving Optimization Problems
Authors: K. T. Sun, H. C. Fu
Venue: IEEE Transactions on Computers (1993)

A hybrid neural network model for solving optimization problems is proposed. An energy function which contains the constraints and cost criteria of an optimization problem is derived, and then the neural network is used to find the global minimum (or maximum) of the energy function, which corresponds to a solution of the optimization problem. The network contains two subnets: a constraint network and a goal network. The constraint network models the constraints of an optimization problem and computes the gradient (updating) value of each neuron such that the energy function monotonically converges to satisfy all constraints of the problem. The goal network points out the direction of convergence for finding an optimal value for the cost criteria. These two subnets ensure that the neural network finds feasible as well as optimal (or near-optimal) solutions. The traveling salesman problem and the Hamiltonian cycle problem are used to demonstrate the method.
An Availability Model for MIN-Based Multiprocessors
Authors: C. R. Das, P. Mohapatra, L. Tien, L. N. Bhuyan
Venue: IEEE Transactions on Parallel and Distributed Systems (1993)

System decomposition is a novel technique for modeling the dependability of complexsystems without constructing a single-level Markov Chain (MC). This is demonstrated inthis paper for the availability computation of a class of multiprocessors that uses 4*4switching elements for the multistage interconnection network (MIN). The availabilitymodel is known as task-based availability, where a system is considered operational aslong as the task requirements are satisfied. The authors develop two simple MC's for theprocessors and memories and solve them using a software package, called HARP. Theprobabilities of i processing elements (PE's) and j memory modules (MM's) working at any time t, denoted as Pi(t) and Pj(t), are obtained from their corresponding MC's. The effect of the MIN is captured in the model by finding the number of switches required for the connection of i PE's and j MM's. A third MC is then developed for the switches to find the probability that the MIN provides the required (i*j) connection. Multiplying this term with Pi(t) and Pj(t), the probability of an (i*j) working group is obtained. The methodology is generalized to model arbitrary as well as larger size systems. Transient and steady state availabilities are computed for a variety of MIN configurations and then validated through simulation.
Innovation delayed is innovation denied
Authors: Al Gore
Venue: Computer (1994)

A discussion is given on the information marketplace and the need to take advantage of the new technologies in these areas. In an era in which the Soviet Union has fallen and capitalism is ascendant in Eastern Europe, it should be no surprise that competition is about to reach even local telephone exchanges. Competitive access providers are increasingly providing interstate telephony service to businesses that were once the sole domain of local telephone companies. Cable companies are seeking authority to provide local telephone service, and a recent survey reports that a third of cable subscribers would be willing to subscribe to comparably priced telephone services provided by their cable company. New technologies offer the promise of competition. Competition in the local telephone exchanges is a fundamental component of competition in the information marketplace. Techniques and actions which must be done in order to compete successfully in the information marketplace are presented.
Reliability Estimation During Prototyping of Knowledge-Based Systems
Authors: Donald E. Brown, James J. Pomykalski
Venue: IEEE Transactions on Knowledge and Data Engineering (1995)

Many knowledge based systems are designed and built with little attention paid to the reliability of the output. In this paper, we present an approach, using partitioning of both the knowledge base and the input space, that allows for the measurement of the reliability during any program increment in a rapid prototyping development cycle. Before presenting the approach, we formalize the problem using concepts from general systems theory and then describe our three objectives: 1) measurement of the reliability of the knowledge-based system at the current program increment, 2) prediction of the reliability of the future system, and 3) support for design decisions.Finally, we apply our approach to a design-aiding knowledge-based system for the selection of materials under various climatic conditions. The design-aiding knowledge-based system is used by U.S. Army personnel in the development of equipment to be used by the U.S. Army in various regions of the world. We find that the current system, containing 40 rules, has a reliability of approximately 0.85. However, more importantly, we have discovered the rules that led to many of the failures.
Experience With Inspection in Ultralarge-Scale Development
Authors: Glen W. Russell
Venue: IEEE Software (1991)

The use of code inspection to detect errors in ultralarge software projects is discussed. In particular, quantitative results based on a 1988 study of inspection of 2.5 million lines of high-level code at Bell-Northern Research are presented. The data represent one of the largest published studies in the industry and confirm that code inspection is still one of the most efficient ways to remove software defects. How to introduce inspections in large-scale production environments successfully is described.
A Pipelined Interface for High Floating-Point Performance with Precise Exceptions
Authors: Sorin Iacobovici
Venue: IEEE Micro (1988)

Two options are presented that were considered for a pipelined interface between a central processing unit (CPU) and a floating-point coprocessor (FPU), along with the CPU recovery mechanisms that provide precise floating-point exceptions for each option. The first option supports parallel execution of both floating-point and integer instructions, while the second option pipelines only the execution of floating-point instructions. The use of the second option in National Semiconductor's 32532/32580 processor cluster because it offers high performance with significantly lower complexity. The 32532 microprocessor features a pipelined slave protocol that hides the CPU-FPU communication overhead for most floating-point instructions by pipelining their execution. A simple recovery mechanism implemented within the CPU maintains the precision of floating-point exceptions. As a result, the 32532 microprocessor supports very high floating point performance without sacrificing software compatibility with previous Series 32000 CPU-FPU clusters.
On Sort-Merge Algorithm for Band Joins
Authors: Hongjun Lu, Kian-Lee Tan
Venue: IEEE Transactions on Knowledge and Data Engineering (1995)

This correspondence proposes two ways to improve the sort-merge based band join algorithm. The techniques proposed address issues that have not been previously discussed: to choose a right relation as the inner relation to achieve better performance and to optimally allocate and adjust buffer allocations to make the algorithms robust to data skew and estimation errors.
ACM SIGACT news distributed computing column 9
Authors: Sergio Rajsbaum
Venue: ACM SIGACT News (2002)

The Distributed Computing Column covers the theory of systems that are composed of a number of interacting computing elements. These include problems of communication and networking, databases, distributed shared memory, multiprocessor architectures, operating systems, verification, internet, and the web.This issue consists of the paper "Incentives and Internet Computation" by Joan Feigenbaum and Scott Shenker. Many thanks to them for contributing to this issue.
Nonlinearity, local snd global avalanche characteristics of balanced Boolean functions
Authors: Pantelimon Stanica
Venue: Discrete Mathematics (2002)

For a Boolean function f, define Δf(α)= Σx f(x) f(x ⊕ α), f(x)= (-1)f(x), the absolute indicator Δf = maxα≠0|Δf(α)|, and the sum-of-squares indicator σf = Σα Δ2f(α). We construct a class of functions with good local avalanche characteristics, but bad global avalanche characteristics, namely we show that 22n(1 + p) ≤ σf ≤ 23n-2, Δf =2n, where p is the number of linear structures (with even Hamming weight) of the first half of a strict avalanche criterion balanced Boolean function f. We also derive some bounds for the nonlinearity of such functions. It improves upon the results of Son et al. (Inform. Process. Lett. 65 (3) (1998) 139) and Sung et al. (Inform. Process. Lett. 69 (1) (1999) 21). In our second result we construct a class of highly nonlinear balanced functions with good local and global avalanche characteristics. We show that for these functions, 22n+2 ≤ σf ≤ 22n+2+ε (ε = 0 for n even and ε = 1 for n odd).
Automatic Management of Sessions in Shared Spaces
Authors: Géraldine Texier Noël Plouzeau
Venue: The Journal of Supercomputing (2003)

In this paper we propose a session model suited for cooperative work in shared spaces such as virtual 3D spaces. Our session model aims at structuring interactions on shared objects, without requiring explicit session preparation. Sessions are rule driven: accessing objects triggers automatic session creation, deletion or merge. Automatic session management enhances the dynamics of cooperation: users are not constrained by predefined schemes and they can join and leave easily by accessing shared objects (e.g. editing documents, moving to locations in virtual spaces). Our session management model is well suited to coincidental encounters and cooperation in shared spaces. Moreover, sessions promote rules for shared access and help users to get a clear perception of the ongoing interactions. As cooperative applications are distributed by essence, maintaining data consistency is a difficult issue. Our session model helps to define groups of objects which can then be used by a distributed consistency management service. In this paper we detail our session model and its rules, together with an algorithm for automatic session management. We conclude with a scenario of an encounter in a virtual space.