15084848
ASIP Instruction Encoding for Energy and Area Reduction
Application-specific VLIW processors provide an energy and area efficient solution for high-performance embedded applications. One significant design issue is that the long instruction word required to express the instruction parallelism represents a significant cause of energy dissipation. We present an application- tailored instruction encoding solution that modifies the instruction architecture to minimize the instruction word width. We demonstrate the effectiveness of our solution across a range of benchmarks, resulting in average energy savings of 20% and an average area reduction of 18%, with no performance penalty.
2332594
Automated data cache placement for embedded VLIW ASIPs
Memory bandwidth issues present a formidable bottleneck to accelerating embedded applications, particularly data bandwidth for multiple-issue VLIW processors. Providing an efficient ASIP data cache solution requires that the cache design be tailored to the target application. Multiple caches or caches with multiple ports allow simultaneous parallel access to data, alleviating the bandwidth problem if data is placed effectively. We present a solution that greatly simplifies the creation of targeted caches and automates the process of explicitly allocating individual memory access to caches and banks. The effectiveness of our solution is demonstrated with experimental results.
15082629
Co-processor synthesis: a new methodology for embedded software acceleration
This paper introduces co-processor synthesis - a methodology that provides design benefits by implementing hardware co-processors directly from embedded software. The paper examines the design benefits in this new approach vs. behavioral synthesis and configurable processor methodologies.
29618653
An Algorithm for Calculating the Availability and Mean Time to Restore for Communication Through a Network
Abstract This paper presents algorithms for approximate calculation of the availability, Mean Time To Failure (MTTF) and Mean Time To Restore (MTTR) for communication through a network, as experienced by a certain origin-destination pair. The approximations should lead to quite minor errors, and in the case of the availability algorithm bounds on these errors are computed. The availability algorithm is similar to earlier algorithms [2], but the algorithm for calculating MTTF and MTTR is new as far as the authors are aware. In addition to presenting the calculation methods, a theory which predicts the computation time for the availability algorithm is developed and verified by comparison with the results of trials. The computation time for any algorithm for network availability must be expected to rise exponentially with the size of the network, but it has been found that in real networks, the values of network parameters are such that quite large networks can be analysed by the algorithm presented in this paper.
19675613
Near Optimal Unconditionally Secure Authentication
An efficient unconditionally secure authentication scheme with arbitration is presented which is also secure against attacks by the arbiter. Arguments are presented that suggest this scheme is almost optimal with respect to codeword lengths, and when many messages are sent the amount of key data per message approaches, at worst, 1/3 more than the best possible. An improved unconditionally secure authentication scheme without arbitration is also briefly presented.
12238212
Taking a RaSP to Enterprise Stakeholder Dissonance
We present a model based approach to the resolution of conflict between the many stakeholders involved in large scale information system deployment and use. The work is based on the authors experience of more than $20B of outsourcing contracts. The approach, rapid scenario planning (RaSP) yields concrete evidence of the underlying assumptions that drive design and deployment, as well as critical insights into systems and business dynamics. Social and long term management and governance benefits are also obvious. Our implementation of the methodology is supported by specific tools, however equivalent general purpose tools can be used to support this methodology.
16320765
Small World Dynamics and The Process of Knowledge Diffusion: The Case of The Metropolitan Area of Greater Santiago De Chile
This paper aims to understand some of the mechanisms which dominate the phenomenon of knowledge diffusion in the process that is called â€˜interactive learningâ€™. We examine how knowledge spreads in a network in which agents have â€˜face-to-faceâ€™ learning interactions. We define a social network structured as a graph consisting of agents (vertices) and connections (edges) and situated on a grid which resembles the geographical characteristics of the metropolitan area of Greater Santiago de Chile. The target of this simulation is to test whether knowledge diffuses homogeneously or whether it follows some biased path generating geographical divergence between a core area and a periphery. We also investigate the efficiency of our â€˜preferenceâ€™ model of agent decision-making and show that this system evolves towards a small-world type network.
13532105
Reconstructing degree sequences from k-vertex-deleted subgraphs
Abstract Let k ⩾3 be an integer. We show that the degree sequences of all sufficiently large graphs are determined by their k -vertex-deleted subgraphs. In particular, this is shown for all graphs on at least f ( k ) vertices, where f ( k ) is a certain function which is asymptotic to ke .