ppxscal/embedding_network huggingface dataset:
Reducing Design Complexity of the Load/Store Queue
Authors: Il Park, Chong Liang Ooi, T. N. Vijaykumar
Venue: Proceedings of the 36th annual IEEE/ACM International Symposium on Microarchitecture (2003)

With faster CPU clocks and wider pipelines, all relevantmicroarchitecture components should scale accordingly.There have been many proposals for scaling the issue queue,register file, and cache hierarchy. However, nothing has beendone for scaling the load/store queue, despite the increasingpressure on the load/store queue in terms of capacity andsearch bandwidth. The load/store queue is a CAM structurewhich holds in-flight memory instructions and supportssimultaneous searches to honor memory dependencies andmemory consistency models. Therefore, it is difficult to scalethe load/store queue.In this study, we introduce novel techniques to scale theload/store queue. We propose two techniques, store-loadpair predictor and load buffer, to reduce the search bandwidthrequirement; and one technique, segmentation, toscale the size. We show that a load/store queue using ourpredictor and load buffer needs only one port to outperforma conventional two-ported load/store queue. Compared tothe same base case, segmentation alone achieves speedupsof 5% for integer benchmarks and 19% for floating pointbenchmarks. A one-ported load/store queue using all of ourtechniques improves performance on average by 6% and23%, and up to 15% and 59%, for integer and floating-pointbenchmarks, respectively, over a two-ported conventionalload/store queue.
Why Transition Coding for Power Minimization of On-Chip Buses Does Not Work
Authors: Claudia Kretzschmar, André K. Nieuwland, Dietmar Müller
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

Encoding techniques which minimize the self- or coupling activity of buses are often proposed to reduce power dissipation on system buses. In this paper, we investigate the efficiency of several coding schemes for on-chip buses with respect to overall power dissipation. The power of the codec systems was estimated by power simulations with the lay-outs and related to the savings on the bus. We derived an expression for the energy efficiency of the codecs as a function of bus length (capacitive load). Despite the fact that adaptive schemes could obtain up to 40% savings, the bus lengths required to reduce the overall power consumptionare not realistic for on-chip buses.
Seamless User-Level Handoff in Ubiquitous Multimedia Service Delivery
Authors: Yi Cui, Klara Nahrstedt, Dongyan Xu
Venue: Multimedia Tools and Applications (2004)

Advancing mobile computing technologies are enabling &ldquo;ubiquitous personal computing environment&rdquo;. In this paper, we focus on an important problem in such environment: user mobility. In the case of user mobility, a user is free to access his/her personalized service at anytime, anywhere, through any possible mobile/fixed devices. Providing mobility support in this scenario poses a series of challenges. The most essential problem is to preserve the user's access to the same service despite changes of the accessing host or service provider. Existing system-level mobility solutions are insufficient to address this issue since it is not aware of the application semantics. On the other hand, making each application to be mobility-aware will greatly increase the development overhead. We argue that the middleware layer is the best place to address this problem. On one hand, it is aware of application semantics. On the other hand, by building application-neutral mobility functions in the middleware layer, we eliminate the need to make each application mobility-aware. In this paper, we design a middleware framework to support user mobility in the ubiquitous computing environment. Its major mobility functions include user-level handoff management and service instantiation across heterogeneous computing platforms. We validate the major mobility functions using our prototype middleware system, and test them on two multimedia applications (Mobile Video Player and Mobile Audio Player). To maximally approximate the real-world user-mobility scenario, we have conducted experiments on a variety of computing platforms and communication paradigms, ranging from T1-connected high-end PC to handheld devices with wireless networks. The results show that our middleware framework is able to provide efficient user mobility support in the heterogeneous computing environment.
Kinetic energy fix for low internal energy flows
Authors: X. Y. Hu, B. C. Khoo
Venue: Journal of Computational Physics (2004)

When the kinetic energy of a flow is dominant, numerical schemes employed can encounter difficulties due to negative internal energy. A case study with several commonly used conservative schemes (MUSCL, ENO, WENO and CE/SE) shows that high order schemes may have less ability to preserve positive internal energy (MUSCL and CE/SE), or present less accurate results (WENO and ENO) when the internal energy to kinetic energy ratio is low. By analyzing the positivity property for second-order conservative schemes with large fixed CFL number conditions for time step restriction, this paper proposes the energy consistency conditions for second-order Riemann-solver type schemes and CE/SE method. According to the said energy consistency conditions, a kinetic energy fix method which limits the magnitude of kinetic energy relative to the total energy is introduced. The numerical examples show that the kinetic energy fixed CE/SE method produces reasonable results and keeps positive internal energy for flows with very low internal energy even when a vacuum occurs.
Linking Organizational Knowledge Management Drivers to Knowledge Management Performance: An Exploratory Study
Authors: Sung-Ho Yu, Young-Gul Kim, Min-Yong Kim
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 8 - Volume 8 (2004)

Despite the active interest in managing organizational knowledge as a strategic resource, most organizations do not yet understand the challenges involved in implementing knowledge management initiatives. Much of the knowledge management literature has been either conceptual or based on individual implementation cases. This study aimed at identifying the several key drivers for developing organizational knowledge management capability and examining their relationships with knowledge management performance. Using data collectedfrom the 66 Korean firms, the study found that knowledge management drivers such as learning orientation, knowledge sharing intention, knowledge management system quality, reward, and knowledge management team activity were significantly related to the organizational knowledge management performance -- knowledge quality and userknowledge satisfaction. The study also found that the knowledge management stage of an organization moderates the relationship between some of the knowledge management drivers and knowledge management performance variables.
Constraint solving and preference activation for interactive design
Authors: Claudio Lottaz, Ruth Stalker, Ian Smith
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (1998)

This article contains a description of a constraint solver that determines complete solution spaces. These spaces are defined by sets of constraints in continuous variables. Interactive design is supported through improvements to existing algorithms that have increased system performance. In addition, heuristics for activating the best set of preferred constraints for a design task are presented, and two ways are proposed for interactively exploring design alternatives. IDIOM is an application framework that has successfully tested these algorithms for interactive apartment layout design.
A brief history of NTP time: memoirs of an Internet timekeeper
Authors: David L. Mills
Venue: ACM SIGCOMM Computer Communication Review (2003)

This paper traces the origins and evolution of the Network Time Protocol (NTP) over two decades of continuous operation. The technology has been continuously improved from hundreds of milliseconds in the rowdy Internet of the early 1980s to tens of nanoseconds in the Internet of the new century. It includes a blend of history lessons, technology milestones and series of experiments that shape, define and record the early history of the Internet and NTP.This narrative is decidedly personal, since the job description for an Internet timekeeper is highly individualized and invites very few applicants. There is no attempt here to present a comprehensive tutorial, only a almanac of personal observations, eclectic minutiae and fireside chat. Many souls have contributed to the technology, some of which are individually acknowledged in this paper, the rest too numerous left to write their own memoirs.
A system for fast, full-text entry for small electronic devices
Authors: Saied B. Nesbat
Venue: Proceedings of the 5th international conference on Multimodal interfaces (2003)

A novel text entry system designed based on the ubiquitous 12-button telephone keypad and its adaptation for a soft keypad are presented. This system can be used to enter full text (letters + numbers + special characters) on devices where the number of keys or the keyboard area is limited. Letter-frequency data is used for assigning letters to the positions of a 3x3 matrix on keys, enhancing the entry of the most frequent Letters performed by a double-click. Less frequent letters and characters are entered based on a 3x3 adjacency matrix using an unambiguous, two-keystroke scheme. The same technique is applied to a virtual or soft keyboard layout so letters and characters are entered with taps or slides on an 11-button keypad. Based on the application of Fitts' law, this system is determined to be 67% faster than the QWERTY soft keyboard and 31% faster than the multi-tap text entry system commonly used on cell phones today. The system presented in this paper is implemented and runs on Palm OS PDAs, replacing the built-in QWERTY keyboard and Graffiti recognition systems of these PDAs.
A Scalable Interconnection Network Architecture for Petaflops Computing
Authors: Constantine Katsinis, Bahram Nabet
Venue: The Journal of Supercomputing (2004)

Extrapolating technology advances in the near future, a computer architecture capable of petaflops performance will likely be based on a collection of processing nodes interconnected by a high-performance network. One possible organization would consist of thousands of inexpensive, low-power symmetric multiprocessor (SMP) nodes. Each node will inject data into the interconnection network at a very large rate and consequently, the interconnect scheme is one of the most crucial design issues affecting system performance. This paper describes the 2D simultaneous optical multiprocessor exchange bus (2D SOME-Bus) which has the potential to become the basis of a high-end computer architecture capable of petaflops performance. It consists of N horizontal, N vertical 1D SOME-Bus networks, and N2 nodes. Each node is connected to one horizontal and one vertical 1D SOME-Bus. Each of N nodes connected to one 1D SOME-Bus has a dedicated broadcast channel and an input channel interface based on an array of N receivers monitoring all N channels and allowing multiple simultaneous broadcasts. In the 2D SOME-Bus, messages being broadcast on one Bus can be broadcast in a cut-through manner on one or more Buses in the other dimension. This paper describes the optoelectronic devices and technology which make the 2D SOME-Bus possible, and the network interface organization. It also presents simulation results which compare the performance of the 2D SOME-Bus, the 1D SOME-Bus, the crossbar and the torus under the message-passing paradigm.
Fragmental Optimization on the 2-Machine Bicriteria Flowshop Scheduling Problem
Authors: Gaofeng Huang, Andrew Lim
Venue: Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (2003)

The 2-machine bicriteria flowshop scheduling problem F2\left\| {(\sum C_i } \right./C_{\max }) is studied in this paper, which minimizes the total flow time subject to the makespan of the schedule being minimum. This problem is known to be strongly NP-hard, and several heuristic algorithms have been proposed to solve it. In this paper, we present a new approach, which we named Fragmental Optimization (FO), that combines the Dynamic Programming and local search strategies. Extensive experimentation shows that our FO algorithm outperforms existing heuristics and provides solutions that are very close to the optimal.
Tiny instruction caches for low power embedded systems
Authors: Ann Gordon-Ross, Susan Cotterell, Frank Vahid
Venue: ACM Transactions on Embedded Computing Systems (TECS) (2003)

Instruction caches have traditionally been used to improve software performance. Recently, several tiny instruction cache designs, including filter caches and dynamic loop caches, have been proposed to instead reduce software power. We propose several new tiny instruction cache designs, including preloaded loop caches, and one-level and two-level hybrid dynamic/preloaded loop caches. We evaluate the existing and proposed designs on embedded system software benchmarks from both the Powerstone and MediaBench suites, on two different processor architectures, for a variety of different technologies. We show on average that filter caching achieves the best instruction fetch energy reductions of 60--80&percnt;, but at the cost of about 20&percnt; performance degradation, which could also affect overall energy savings. We show that dynamic loop caching gives good instruction fetch energy savings of about 30&percnt;, but that if a designer is able to profile a program, preloaded loop caching can more than double the savings. We describe automated methods for quickly determining the best loop cache configuration, methods useful in a core-based design flow.
Powers of geometric intersection graphs and dispersion algorithms
Authors: Geir Agnarsson, Peter Damaschke, Magnús M. Halldórsson
Venue: Discrete Applied Mathematics (2003)

We study powers of certain geometric intersection graphs: interval graphs, m-trapezoid graphs and circular-arc graphs. We define the pseudo-product, (G, G') → G*G', of two graphs G and G' on the same set of vertices, and show that G,G' is contained in one of the three classes of graphs mentioned here above, if both G and G' are also in that class and fulfill certain conditions. This gives a new proof of the fact that these classes are closed under taking power; more importantly, we get efficient methods for computing the representation for Gk if k ≥ 1 is an integer and G belongs to one of these classes, with a given representation sorted by endpoints. We then use these results to give efficient algorithms for the k-independent set, dispersion and weighted dispersion problem on these classes of graphs, provided that their geometric representations are given.
Dynamic task allocation in multi-agent systems
Authors: Naga K. Krothapalli
Venue:  (2003)

The primary focus of this research is on the distributed allocation of dynamically arriving interdependent tasks to the agents of a heterogeneous multi-agent system in an uncertain environment. This dissertation consists of three parts. First, we develop a centralized task allocation model which explicitly considers the communication between the agents in coordinated problem solving. The tasks enter the system with certain payment and specific processing requirements. The agents are grouped into different types based on their processing capabilities. A task can only be processed by an appropriate agent. Processing of the tasks incurs certain operational cost on the multi-agent system resulting from processing and communication costs. The performance of an agent system is defined as the discounted sum of rewards over an infinite time horizon. We formulate the task assignment problem as a Markov decision problem and show that a stationary policy exists. An action elimination procedure is proposed that decreases the action space for each state. Moreover, a heuristic policy is proposed based on certain structural properties and is shown to perform close to 1% of the policy obtained from computational methods. The second part of the dissertation studies different distributed task allocation models and shows that distributed task allocation may be preferable over centralized task allocation despite their lower performance for the agent system. Each of these decision methods are evaluated based on the computational costs incurred in the decision making and the information exchange cost between the agents. The task allocation methods are classified into different scopes such as system level, group level, and individual level. For each level of scope, we consider both off-line and on-line decision procedures. The composite performance of each model is computed in order to evaluate cost effectiveness of a decision method. We show that centralized methods may not be preferred due to excessive decision costs involved. We also investigate the performance of multi-agent systems under partial information about other agents in the system. The third and final part of the dissertation investigates the effect of organizational structures on the performance of multi-agent systems. We study different organizational structures resulting from coalition formation between individual agents in the multi-agent systems. The coalitions are formed between agents to benefit from the increased state information. (Abstract shortened by UMI.)
Usable Access Control for the World Wide Web
Authors: Dirk Balfanz
Venue: Proceedings of the 19th Annual Computer Security Applications Conference (2003)

While publishing content on the World Wide Web hasmoved within reach of the non-technical mainstream, controllingaccess to published content still requires expertisein Web server configuration, public-key certification, and avariety of access control mechanisms. Lack of such expertisecan result in unnecessary exposure of content publishedby non-experts, or can force cautious non-experts to leavetheir content off-line. Recent research has focused on makingaccess control systems more flexible and powerful, butnot on making them easier to use. In this paper, we proposea usable access control systems for the World Wide Web, i.e.,a system that is easy to use both for content providers (whowant to protect their content from unauthorized access) and(authorized) content consumers (who want hassle-free accessto such protected content). Our system can be constructedwith judicious use of conventional building blocks,such as access control lists and public-key certificates. Wepoint out peculiarities in existing software that make it unnecessarilyhard to achieve our goal of usable access control,and assess the security provided by our usable system.
A new decomposition method for multilevel circuit design
Authors: D. Bochmann, F. Dresig, B. Steinbach
Venue: Proceedings of the conference on European design automation (1991)

This Paper presents a new methodology for the decomposition of Boolean functions, which is exclusively based on the utilization of function properties. The main point in this connection is the "groupability" of Boolean functions. The analysis of uncompletely specified functions is carried out by means of Boolean differential equations. Examples demonstrate the efficiency of the automatic implementation.
3-D virtual space creation system reflecting user's emotion by interactive evolutionary method
Authors: Hiroshi Kaino, Masafumi Hagiwara
Venue: Proceedings of the second international conference on Entertainment computing (2003)

In this paper, we propose a 3-D virtual space creation system reflecting user's emotion by interactive evolutionary method. In this system, a virtual space is created using Open GL. And users can walk through in the virtual space. Five kinds of emotions, happiness, sadness, anger, fear, and disgust, are treated. They are selected based on researches on emotion. Researches which create space corresponding to user's favorite emotions are difficult because techniques reflecting emotions in a 3-D space have not been established. Our system evolves space interactively using genetic algorithm (GA) to reflect user's emotion. This GA uses user's evaluation as fitness. This makes the followings possible: (1) direct reflection of user's emotion: (2) making the system simple because calculation of fitness function is not necessary. In GA, initial genes are very important. The proposed system determines initial genes using Kohonen's Self-Organizing Feature Map (SOFM). SOFM is used to interpolate a high dimensional parameter space by learning. The SOFM in the system has been learned by a preliminary experiments: people give emotions to many sample spaces. It has been confirmed by experiments that the proposed system can create spaces having high evaluation.
Dynamic Clustering for Acoustic Target Tracking in Wireless Sensor Networks
Authors: Wei-Peng Chen, Jennifer C. Hou, Lui Sha
Venue: Proceedings of the 11th IEEE International Conference on Network Protocols (2003)

In the paper, we devise and evaluate a fully decentralized, light-weight, dynamic clustering algorithm for target tracking. Instead of assuming the same role for all the sensors, we envision a hierarchical sensor network that is composed of (a) a static backbone of sparsely placed high-capability sensors which will assume the role of a cluster head (CH) upon triggered by certain signal events; and (b) moderately to densely populated low-end sensors whose function is to provide sensor information to CHs upon request. A cluster is formed and a CH becomes active, when the acoustic signal strength detected by the CH exceeds a pre-determined threshold. The active CH then broadcasts an information solicitation packet, asking sensors in its vicinity to join the cluster and provide their sensing information.We address and devise solution approaches (with the use of Voronoi diagram) to realize dynamic clustering: (I1) how CHs cooperate with one another to ensure that for the most of time only one CH (preferably the CH that is closest to the target) is active; (I2) when the activeCH solicits for sensor information, instead of having all the sensors in its vicinity reply, only a sufficient number of sensors respond with non-redundant, essential information to determine the target location; and (I3) both packets with which sensors respond to their CHs and packets that CHs report to subscribers do not incur significant collision. Through both probabilistic analysis and ns-2 simulation, we show with the use of Voronoi diagram, the CH that is usually closest to the target is (implicitly) selected as the leader and and that the proposed dynamic clustering algorithm effectively eliminates contention among sensors and renders more accurate estimates of target locations as a result of better quality data collected and less collision incurred.