Sciweavers

723 search results - page 2 / 145
» Reducing the complexity of the issue logic
Sort
View
ISCA
2011
IEEE
271views Hardware» more  ISCA 2011»
12 years 9 months ago
CRIB: consolidated rename, issue, and bypass
Conventional high-performance processors utilize register renaming and complex broadcast-based scheduling logic to steer instructions into a small number of heavily-pipelined exec...
Erika Gunadi, Mikko H. Lipasti
ISLPED
2005
ACM
150views Hardware» more  ISLPED 2005»
13 years 10 months ago
Instruction packing: reducing power and delay of the dynamic scheduling logic
The instruction scheduling logic used in modern superscalar microprocessors often relies on associative searching of the issue queue entries to dynamically wakeup instructions for...
Joseph J. Sharkey, Dmitry V. Ponomarev, Kanad Ghos...
FUIN
2007
134views more  FUIN 2007»
13 years 5 months ago
Complexity Issues in Multiagent Logics
Abstract. Our previous research presents a methodology of cooperative problem solving for beliefdesire-intention (BDI) systems, based on a complete formal theory called TEAMLOG. Th...
Marcin Dziubinski, Rineke Verbrugge, Barbara Dunin...
ATAL
2007
Springer
13 years 11 months ago
Reducing the complexity of logics for multiagent systems
Marcin Dziubinski, Rineke Verbrugge, Barbara Dunin...
DDECS
2009
IEEE
202views Hardware» more  DDECS 2009»
13 years 12 months ago
Asynchronous two-level logic of reduced cost
— We propose a novel synthesis method of a dual-rail asynchronous two-level logic of reduced cost. It is based on a model that operates under so called modified weak constraints....
Igor Lemberski, Petr Fiser