Dynamic Instruction Scheduling For Microprocessors Having Out Of Order Execution

Dynamic Instruction Scheduling is very much needed for fast working of multiprocessor and reduction of overhead by the processor. The Instruction scheduling logic mainly depends on associative searching of the entries to the dynamic wakeup instructions for the execution. We also describes the scheduler concept which also the concern for scalability and complexity of the multiprocessor. We have different Dynamic Instruction Scheduling Logic highlighting the objectives, goals, advantages and challenges facing during scheduling logic like energy issues and complexity issues as well as full description of dynamic instruction Scheduling logic. In this paper, we will be presented in a comprehensive analysis to reschedule the execution order of instructions for improve the performance of microprocessor. General Terms: Design, Performance, Measurement Keywords: Dynamic Instruction Scheduling, Instruction Grouping, Issue Queue

A Spatial-Epistemic Logic for Reasoning about Security Protocols

Reasoning about security properties involves reasoning about where the information of a system is located, and how it evolves over time. While most security analysis techniques need to cope with some notions of information locality and knowledge propagation, usually they do not provide a general language for expressing arbitrary properties involving local knowledge and knowledge transfer. Building on this observation, we introduce a framework for security protocol analysis based on dynamic spatial logic specifications. Our computational model is a variant of existing pi-calculi, while specifications are expressed in a dynamic spatial logic extended with an epistemic operator. We present the syntax and semantics of the model and logic, and discuss the expressiveness of the approach, showing it complete for passive attackers. We also prove that generic Dolev-Yao attackers may be mechanically determined for any deterministic finite protocol, and discuss how this result may be used to reason about security properties of open systems. We also present a model-checking algorithm for our logic, which has been implemented as an extension to the SLMC system.Comment: In Proceedings SecCo 2010, arXiv:1102.516

"Hysteresis in Dynamic General Equilibrium Models with Cash-in-Advance Constraints"

In this paper, we investigate equilibrium cycles in dynamic general equilibrium models with cash-in-advance constraints. Our findings are two-fold. First, in such models, if an equilibrium cycle exists, then there also exists a continuum of equilibrium cycles in its neighborhood. Second, the limit cycle, to which a dynamic path converges, varies continuously according to the initial distribution of the money holdings. Thus, temporary shocks that affect the initial distribution have permanent effects in such models; that is, such models exhibit hysteresis. Furthermore, we also explore the logic behind the results.

The dynamic logic of stating and asking

Inquisitive dynamic epistemic logic (IDEL) extends standard public announcement logic incorporating ideas from inquisitive semantics. In IDEL, the standard public announcement action can be extended to a more general public utterance action, which may involve a statement or a question. While uttering a statement has the effect of a standard announcement, uttering a question typically leads to new issues being raised. In this paper, we investigate the logic of this general public utterance action. We find striking commonalities, and some differences, with standard public announcement logic. We show that dynamic modalities admit a set of reduction axioms, which allow us to turn any formula of IDEL into an equivalent formula of static inquisitive epistemic logic. This leads us to establish several complete axiomatizations of IDEL, corresponding to known axiomatizations of public announcement logic

The dynamic logic of stating and asking

Inquisitive dynamic epistemic logic (IDEL) extends standard public announcement logic incorporating ideas from inquisitive semantics. In IDEL, the standard public announcement action can be extended to a more general public utterance action, which may involve a statement or a question. While uttering a statement has the effect of a standard announcement, uttering a question typically leads to new issues being raised. In this paper, we investigate the logic of this general public utterance action. We find striking commonalities, and some differences, with standard public announcement logic. We show that dynamic modalities admit a set of reduction axioms, which allow us to turn any formula of IDEL into an equivalent formula of static inquisitive epistemic logic. This leads us to establish several complete axiomatizations of IDEL, corresponding to known axiomatizations of public announcement logic