A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Filters
uDIREC
2013
Proceedings of the 46th Annual IEEE/ACM International Symposium on Microarchitecture - MICRO-46
At its core, uDIREC employs a novel routing algorithm to find reliable and deadlock-free routes that utilize the still-functional links in the NoC. uDIREC places no restriction on topology, router architecture ...
Upon in-field transistor failures, uDIREC leverages a fine-resolution diagnosis mechanism to disable faulty components very sparingly. ...
can enable at least one deadlock-free route between them. ...
doi:10.1145/2540708.2540722
dblp:conf/micro/ParikhB13
fatcat:wxwh6oqx7ra3pbc25ui36uby44
MIMD synchronization on SIMT architectures
2016
2016 49th Annual IEEE/ACM International Symposium on Microarchitecture (MICRO)
condition make forward progress. 978-1-5090-3508-3/16/$31.00 ...
Finally, we propose an adaptive hardware reconvergence mechanism that supports MIMD synchronization without changing the application CFG, but which can leverage our compiler analysis to gain efficiency ...
Rogers, and the reviewers for their insightful feedback. ...
doi:10.1109/micro.2016.7783714
dblp:conf/micro/ElTantawyA16
fatcat:boartlf4yvft5cfi6odao3negu
Methods for fault tolerance in networks-on-chip
2013
ACM Computing Surveys
The article at hand reviews the failure mechanisms, fault models, diagnosis techniques, and fault-tolerance methods in on-chip networks, and surveys and summarizes the research of the last ten years. ...
It is structured along three communication layers: the data link, the network, and the transport layers. ...
Deadlock avoidance or recovery in presence of faults therefore has to be addressed. The new routing scheme originating from adaptation to a fault should preferably be guaranteed deadlock free. ...
doi:10.1145/2522968.2522976
fatcat:3t4b3rhbgbc2bphjevpkzlpm6u
Page 6355 of Mathematical Reviews Vol. , Issue 97J
[page]
1997
Mathematical Reviews
Paul, Making the original scoreboard mecha- nism deadlock free (92-99); Marco Cadoli, Francesco M. ...
This last lower bound is valid even if the system is supported by a time-out mechanism that prevents communcation ...
Turning Swift Policy-making into Deadlock and Delay
2006
European Union Politics
European Union Politics 7(3)
Steunenberg Turning Swift Policy-making into Deadlock ...
Both mechanisms are illustrated by two cases of decision-making on EU directives in The Netherlands: the cocoa and chocolate products directive and the laying hens directive. ...
About the author Bernard Steunenberg is a professor in the Department of Public Administration, Leiden University, PO Box 9555, 2300 RB Leiden, The Netherlands. ...
doi:10.1177/1465116506066258
fatcat:vcqspl57gnej3ckeqjl6v6o3xu
Experiences in Using SDL to Support the Design and Implementation of a Logical Link Layer Protocol
[chapter]
2005
Lecture Notes in Computer Science
We have used SDL to support the design and implementation of SLACP, a novel logical link layer protocol to enhance the performance of TCP over wireless WAN links. ...
The protocol was modeled in SDL and successive refinements of its design were carried out based on feedback obtained from using the validation facilities of Telelogic Tau 4.4 SDT. ...
The scoreboard data structure is used to implement the selective repeat mechanism. If the MAC buffer is not free the sender process keeps the data frame in its buffer. ...
doi:10.1007/11506843_13
fatcat:ovlmeayvefctvcxug6nsrljfki
Multi-Layer Test and Diagnosis for Dependable NoCs
2015
Proceedings of the 9th International Symposium on Networks-on-Chip - NOCS '15
On the one hand, all faulty components have to be isolated, and on the other hand, remaining fault-free functionalities have to be kept operational. ...
Studies ([4][15]) show that the incurred area and power overhead is not justified unless extremely high failure rates are assumed, and suggest the application of such techniques on higher layers instead ...
ACKNOWLEDGMENTS This work has been supported by the German Research Foundation (Deutsche Forschungsgemeinschaft -DFG) under grant WU 245/12-1 and RA 1889/4-1 (project ROCK). ...
doi:10.1145/2786572.2788708
dblp:conf/nocs/WunderlichR15
fatcat:zvlo6ygotra7vntppzscykshiu
Efficient online validation with delta execution
2009
Proceeding of the 14th international conference on Architectural support for programming languages and operating systems - ASPLOS '09
To allow more effective on-line patch validation, we propose a new mechanism, called delta execution, that is based on the observation that most patches are small. ∆ execution merges the two side-by-side ...
Whether to repair flaws or add features, software patches are released all the time. For instance, Microsoft releases patches monthly on "Patch Tuesday", the second Tuesday of the month [18]. ...
We now have two instances, one original running the original code with the original data, and one modified running (if applicable) modified code with modified data. ...
doi:10.1145/1508244.1508267
dblp:conf/asplos/TucekXZ09
fatcat:kegu3mohgzeabiwvyifyl6zfei
Efficient online validation with delta execution
2009
SIGPLAN notices
To allow more effective on-line patch validation, we propose a new mechanism, called delta execution, that is based on the observation that most patches are small. ∆ execution merges the two side-by-side ...
Whether to repair flaws or add features, software patches are released all the time. For instance, Microsoft releases patches monthly on "Patch Tuesday", the second Tuesday of the month [18]. ...
We now have two instances, one original running the original code with the original data, and one modified running (if applicable) modified code with modified data. ...
doi:10.1145/1508284.1508267
fatcat:524ahrcss5bzpjzgh676p7vn5i
Efficient online validation with delta execution
2009
SIGARCH Computer Architecture News
To allow more effective on-line patch validation, we propose a new mechanism, called delta execution, that is based on the observation that most patches are small. ∆ execution merges the two side-by-side ...
Whether to repair flaws or add features, software patches are released all the time. For instance, Microsoft releases patches monthly on "Patch Tuesday", the second Tuesday of the month [18]. ...
We now have two instances, one original running the original code with the original data, and one modified running (if applicable) modified code with modified data. ...
doi:10.1145/2528521.1508267
fatcat:6vsir7js7ffankzkkrkdtm7xxe
DOJ
2012
SIGPLAN notices
The DOJ compiler then analyzes the code to generate heap examiners that ensure the parallel execution preserves the behavior of the original sequential program. ...
In DOJ, a developer annotates code blocks as tasks to decouple these blocks from the parent execution thread. ...
Acknowledgments This research was supported by the National Science Foundation under grants CCF-0846195 and CCF-0725350. We would like to thank the anonymous reviewers for their helpful comments. ...
doi:10.1145/2370036.2145828
fatcat:gnymqcdr3rce5m5jmh5u5roc4u
The DOJ compiler then analyzes the code to generate heap examiners that ensure the parallel execution preserves the behavior of the original sequential program. ...
In DOJ, a developer annotates code blocks as tasks to decouple these blocks from the parent execution thread. ...
Acknowledgments This research was supported by the National Science Foundation under grants CCF-0846195 and CCF-0725350. We would like to thank the anonymous reviewers for their helpful comments. ...
doi:10.1145/2145816.2145828
dblp:conf/ppopp/EomYJD12
fatcat:5n6w4ythtjc5lktm7ew6oed2me
Chip multi-processor generator
2007
Proceedings - Design Automation Conference
and for making constant trips to visit us. ...
Somehow, Dan was able to take the arguably most difficult topics-cryptography and computer security-and make it understandable to mere humans like myself. vii A great and special thanks is extended to ...
When faced with the task of verifying SSM, we realized we can build on the work of [52] and [73] , to create a new approach to scoreboard design that makes the construction of a memory system scoreboard ...
doi:10.1145/1278480.1278544
dblp:conf/dac/SolomatnikovFQSKAWHH07
fatcat:r5cfnoxqarg5lghtnmqidi7wxy
Efficient dynamic scheduling through tag elimination
2002
SIGARCH Computer Architecture News
For instructions with multiple unavailable operands, we introduce a last-tag speculation mechanism that eliminates all remaining tag comparators except those for the last arriving input operand. ...
The performance of the scheduler can be improved by decreasing the number of tag comparisons necessary to schedule instructions. ...
We also thank all of the reviewers and our collegues for their insights and suggestions for strengthening our paper. ...
doi:10.1145/545214.545221
fatcat:ofgyx745knamjgtmwrzuo2r2wi
Driving informal institutional change: the European Parliament and the reform of the Economic and Monetary Union
2019
Journal of European Integration
We find that the urgency of decision-making and its distributional consequences influence the EP's chances of success. ...
With the Lisbon Treaty, the European Parliament (EP) obtained codecision rights in economic governance for the first time. ...
Acknowledgments Earlier versions of this article were presented at the workshop "The European Parliament in the new Europe: Institutional Power and policy influence?" ...
doi:10.1080/07036337.2019.1599373
fatcat:gaon4jgeqfarrgdysnbpxmhsme
« Previous
Showing results 1 — 15 out of 163 results