Conference Paper

An Event Logic Architecture for CIRCAL Algorithms.

October 1995

Source
DBLP

Conference: The Seventh IASTED International Conference on Parallel and Distributed Computing and Systems
At: Washington, D. C

Authors:

Khaled Elleithy

University of Bridgeport

Alaaeldin A Amin

King Fahd University of Petroleum and Minerals

Mapping CIRCAL based algorithms to event logic

Article

Full-text available

Dec 1996
KUWAIT J SCI ENG

In this paper a new approach fro implementing CIRCAL algorithm using event logic is presented. A high- level description of an algorithm is expressed in CIRCAL, a formal parallel hardware description language. The approach employs a transition signaling convention and a request-acknowledgment protocol under the bundled data model. The mapping approach is a syntax-directed one that will parse various CIRCAL constructs to their corresponding event logic. The mapping methodology is illustrated by an example.

ResearchGate has not been able to resolve any references for this publication.

Article

Architecting and implementing distributed Web applications using the graph‐oriented approach

July 2003 · Software Practice and Experience

This paper presents a graph-oriented framework, called WebGOP, for architecture modeling and programming of Web-based distributed applications. WebGOP is based on the graph-oriented programming (GOP) model, under which the components of a distributed program are configured as a logical graph and implemented using a set of operations defined over the graph. WebGOP reshapes GOP with a reflective ... [Show full abstract] object-oriented design, which provides powerful architectural support in the World Wide Web environment. In WebGOP, the architecture graph is reified as an explicit object which itself is distributed over the network, providing a graph-oriented context for the execution of distributed applications. The programmer can specialize the type of graph to represent a particular architecture style tailored for an application. WebGOP also has built-in support for flexible and dynamic architectures, including both planned and unplanned dynamic reconfiguration of distributed applications. We describe the WebGOP framework, a prototypical implementation of the framework on top of SOAP, and a performance evaluation of the prototype. The prototype demonstrated the feasibility of our approach. Results of the performance evaluation showed that the overhead introduced by WebGOP over SOAP is reasonable and acceptable.

Article

A Proof of Security of a Mesh Security Architecture

January 1970

The IEEE 802.11s standard is tasked to provide ways of establishing and securing a wireless mesh network. One proposal establishes a Mesh Security Architecture (MSA), with an interesting key hierarchy and full pro- tocol deflnitions. This paper proves the correctness and security of the MSA proposal and its correspond- ing protocols. We also propose and prove the security of an additional ... [Show full abstract] protocol (an abbreviated handshake) which ofiers a substantial e-ciency improvement in certain instances. To prove the entire architecture se- cure, we utilize Protocol Composition Logic (PCL) to prove each protocol secure. From that basis, we can show the protocols compose securely to prove the en- tire architecture. We also contribute some novel con- cepts to PCL, to allow us to prove the security of the overall architecture.

Article

Logic and behavior validation of C4ISR architecture description

February 2005

For the product concordance of the architecture description, a method for analyzing and validating the model concordance using executable model is presented. The executable model is derived from the activity model, rule model and data model that are generated in the development of C4ISR architecture. The simulation execution sequence and running results of the executable model are compared with ... [Show full abstract] operation scenario and dynamic model to analyze and evaluate the logic and behavior of the C4ISR architecture. An example of interceptor air-defense operation is used to illustrate this process.

Conference Paper

A Logical Basis for the Specification of Reconfigurable Component-Based Systems.

January 2003

We present a logic and a prototypical specification language for specifying and reasoning about component-based systems with sup- port for dynamic, i.e., run-time, architectural reconfiguration. We present the logic, an adaptation of an existing one proposed for specifying reac- tive systems, and some results that demonstrate its suitability for the specification of reconfigurable systems. We ... [Show full abstract] then explicate how the specification language can be used to specify a reconfigurable (sub)system via layers defining component templates, association/connector templates and a layer specifying reconfiguration operations used to dynamically change the system architecture. We also illustrate the expressive power and proof capabilities of the logic.

Article

Full-text available

Querying Documents using Content, Structure and Properties

November 2000 · Journal of Intelligent Information Systems

Much information is nowadays stored electronically in document bases. Users retrieve information from these document bases by browsing and querying. While a large number of tools are available nowadays, not much work has been done on tools that support queries involving all the characteristics of documents as well as the use of domain knowledge during the search for information. In this paper we ... [Show full abstract] propose a query language that allows for querying documents using content information, information about the logical structure of the documents as well as information about properties of the documents. Domain knowledge is taken into account during the search as well. We also present an architecture for a system supporting such a language and we describe a prototype implementation together with test results.

Conference Paper

Conflicting Client Decision Logics in Procuring Architectural Service

January 2012

Article

Selective eager execution on the PolyPath architecture

June 1998 · ACM SIGARCH Computer Architecture News

Control-flow misprediction penalties are a major impediment to high performance in wide-issue superscalar processors. In this paper we present Selective Eager Execution (SEE), an execution model to overcome mis-speculation penalties by executing both paths after diffident branches. We present the micro-architecture of the PolyPath processor, which is an extension of an aggressive superscalar, ... [Show full abstract] out-of-order architecture. The PolyPath architecture uses a novel instruction tagging and register renaming mechanism to execute instructions from multiple paths simultaneously in the same processor pipeline, while retaining maximum resource availability for single-path code sequences.Results of our execution-driven, pipeline-level simulations show that SEE can improve performance by as much as 36% for the go benchmark, and an average of 14% on SPECint95, when compared to a normal superscalar, out-of-order, speculative execution, monopath processor. Moreover, our architectural model is both elegant and practical to implement, using a small amount of additional state and control logic.

Article

Mechanism for Multi-XML Documents Correlating Validation and its Implementation

November 2009

When an application manages multiple XML documents, the references between them need to be validated before any further operation. In this paper, we present a general validating mechanism based on a model which describes references between two or more XML documents as directed graphs. A formal system is presented and we prove that the correlating validation of many-to-many XML documents could be ... [Show full abstract] simplified as several correlating validations of one-to-many XML documents. By the means of adding correlating validation logic into the Xerces2-Java components architecture, we develop a parser prototype. Experiments show that the mechanism is a proper solution for multi-XML documents correlating validation.

Conference Paper

Emerging research device roadmap and perspectives

May 2014

An Chen

The challenges in CMOS scaling have motivated research on a wide range of emerging devices, to extend the life of CMOS or to explore beyond-CMOS applications. The Emerging Research Device (ERD) chapter in ITRS systematically tracks and assesses numerous novel device options for both memory and logic applications. Most emerging devices explored so far are more suitable to augment CMOS than to ... [Show full abstract] replace CMOS. To truly utilize the unique characteristics of emerging devices, a system approach with device-design co-optimization needs to be adopted. Novel architectures may find promising opportunities in the beyond-CMOS domain.

Conference Paper

Mixing fixed and reconfigurable logic for array processing

May 1996

This paper describes the architecture of the MIX system that was designed to investigate the trade-off between the use of reconfigurable and fixed logic. The calculation of the dot-product of two vectors of 32 bit floating point numbers, that forms the basis of array processing in many engineering applications, is used as the basic algorithm for the investigation. The results indicate that fixed ... [Show full abstract] logic is more suited for floating point units and memories while reconfigurable logic is useful for implementing control logic providing significant flexibility. It was also found that the additional delay in reconfigurable logic can effectively overlap with the operating time of the fixed logic subsystems. The advantage of reconfigurability of the control is therefore combined with the high bandwidth properties of the fixed logic

Conference Paper

Register Isolation for Synthesizable Register Files

September 2004 · Lecture Notes in Computer Science

In this paper, a low power synthesizable register file architecture is presented. The register file is modeled on register-transfer level (RTL). It is suitable for technology independent IP-core and processor models. The data inputs of all registers of the register file are connected to a data bus. Similar to operand isolation for combinational logic blocks we use blocking logic in order to ... [Show full abstract] isolate registers from transitions on the data bus. The registers are divided into groups and blocking logic is inserted for each group. Even if no spurious transitions occur on the data bus, the power dissipation of the register file can be reduced applying this register file architecture.

Article

Full-text available

An Asynchronous FPGA Block with Its Tech-Mapping Algorithm Dedicated to Security Applications

January 2013 · International Journal of Reconfigurable Computing

This paper presents an FPGA tech-mapping algorithm dedicated to security applications. The objective is to implement—on a full-custom asynchronous FPGA—secured functions that need to be robust against side-channel attacks (SCAs). The paper briefly describes the architecture of this FPGA that has been designed and prototyped in CMOS 65 nm to target various styles of asynchronous logic including ... [Show full abstract] 2-phase and 4-phase communication protocols and 1-of-n data encoding. This programmable architecture is designed to be electrically balanced in order to fit the security requirements. It allows fair comparisons between different styles of asynchronous implementations. In order to illustrate the FPGA flexibility and security, a case study has been implemented in 2-phase and 4-phase Quasi-Delay-Insensitive (QDI) logic.