Sciweavers

50 search results - page 4 / 10
» Strict Sequential P-completeness
Sort
View
ECAL
2001
Springer
14 years 1 days ago
Evolving Multi-agent Networks in Structured Environments
A crucial feature of evolving natural systems is parallelism. The simultaneous and distributed application of rules (governed by e.g. biochemistry) is generally considered as the p...
Thomas Glotzmann, Holger Lange, Michael Hauhs, A. ...
CCECE
2006
IEEE
14 years 1 months ago
A Formal CSP Framework for Message-Passing HPC Programming
To help programmers of high-performance computing (HPC) systems avoid communication-related errors, we employ a formal process algebra, Communicating Sequential Processes (CSP), w...
John D. Carter, William B. Gardner
MICRO
2002
IEEE
100views Hardware» more  MICRO 2002»
14 years 14 days ago
Microarchitectural exploration with Liberty
To find the best designs, architects must rapidly simulate many design alternatives and have confidence in the results. Unfortunately, the most prevalent simulator construction ...
Manish Vachharajani, Neil Vachharajani, David A. P...
TCAD
1998
95views more  TCAD 1998»
13 years 7 months ago
A framework for comparing models of computation
—We give a denotational framework (a “meta model”) within which certain properties of models of computation can be compared. It describes concurrent processes in general term...
Edward A. Lee, Alberto L. Sangiovanni-Vincentelli
WDAG
2010
Springer
177views Algorithms» more  WDAG 2010»
13 years 5 months ago
Transactions as the Foundation of a Memory Consistency Model
We argue that traditional synchronization objects, such as locks, conditions, and atomic/volatile variables, should be defined in terms of transactions, rather than the other way ...
Luke Dalessandro, Michael L. Scott, Michael F. Spe...