A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
Filters
A fine-grained solution to the mutual exclusion problem
1993
Acta Informatica
Preserved Fulltext
We present a \ ne-grained" solution to the mutual exclusion problem. ...
In contrast to other ne-grained solutions that have appeared in the literature, processes in our solution do not busy-wait, but wait on one another only by executing await statements. ...
Acknowledgement: I w ould like to thank Mohamed Gouda, Leslie Lamport, Udaya Shankar, and Jae-Heon Yang for their comments on earlier drafts of this paper. ...
doi:10.1007/bf01179373
fatcat:c2vupwelzbcuhoak2eees5is7u
UML-based Approach to Specify Secured, Fine-grained Concurrent Access to Shared Resources
2007
Journal of Object Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
In this paper, we propose a UML-based approach to specify secured, fine-grained concurrent access to shared resources ensuring data integrity and security. ...
UML BASED APPORACH TO SPECIFY SECURED, FINE-GRAINED CONCURRENT ACCES TO SHARED VARIABLES 108 J OURNAL OF OBJECT TECHNOLOGY ...
The CDL* constructs provide (i) data integrity without resorting to unnecessary mutual exclusion, thus providing fine-grained concurrency (ii) dynamic resource management. ...
doi:10.5381/jot.2007.6.1.a3
fatcat:x5dpycalvzfzzh44nttohbkcmi
On the Role of Deterministic Fine-Grain Data Synchronization for Scientific Applications: A Revisit in the Emerging Many-Core Era
2007
2007 IEEE International Parallel and Distributed Processing Symposium
Preserved Fulltext
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.
Using detailed simulation on a simulator for the IBM 160-core Cyclops-64 chip architecture with the SSB extension, our experiments demonstrate significant performance advantage of using fine-grain data ...
It is critical that the read-after-write data dependencies in such programs should be implemented correctly and efficiently via fine-grain data synchronization. ...
Acknowledgement We would like to acknowledge the support from IBM, in particular, Monty Denneau, who is the architect of the IBM Cyclops-64 architecture, ETI, the Department of Defense, the Department ...
doi:10.1109/ipdps.2007.370680
dblp:conf/ipps/ZhuHG07a
fatcat:sdmeqcguynafjfyroyhspuenyy
On the Role of Deterministic Fine-Grain Data Synchronization for Scientific Applications: A Revisit in the Emerging Many-Core Era
2007
2007 IEEE International Parallel and Distributed Processing Symposium
Preserved Fulltext
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.
Using detailed simulation on a simulator for the IBM 160-core Cyclops-64 chip architecture with the SSB extension, our experiments demonstrate significant performance advantage of using fine-grain data ...
It is critical that the read-after-write data dependencies in such programs should be implemented correctly and efficiently via fine-grain data synchronization. ...
Acknowledgement We would like to acknowledge the support from IBM, in particular, Monty Denneau, who is the architect of the IBM Cyclops-64 architecture, ETI, the Department of Defense, the Department ...
doi:10.1109/ipdps.2007.370679
dblp:conf/ipps/ZhuHG07
fatcat:l45o5vmrofatljcrxtntx6y3wq
Designing irregular parallel algorithms with mutual exclusion and lock-free protocols
2006
Journal of Parallel and Distributed Computing
Preserved Fulltext
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.
In this paper, we focus on lock-free and mutual exclusion protocols for handling fine-grained synchronization. ...
Mutual exclusion and lock-free protocols have received a fair amount of attention in coordinating accesses to shared data structures from concurrent processes. ...
Parallel algorithms with fine-grained mutual exclusion locks Mutual exclusion provides an intuitive way for coordinating synchronization in a parallel program. ...
doi:10.1016/j.jpdc.2005.12.004
fatcat:hl5iyhbbobhehnnjvnjtlrr3hu
The granularity of waiting (extended Abstract)
[chapter]
1992
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
We consider two classes of such statements to have the same granularity i a n y statement of one class can be implemented without busy-waiting by using statements of the other class. ...
We examine the \granularity" of statements of the form \await B ! S", where B is a boolean expression over program variables and S is a multiple-assignment. ...
Fine-Grained Mutual Exclusion In this section, we present a solution to the mutual exclusion problem in which processes do not busywait and in which only single-reader, single-writer boolean variables ...
doi:10.1007/3-540-56188-9_21
fatcat:xsddm37w75be7m6arc7spvme5i
Label Relation Graphs Enhanced Hierarchical Residual Network for Hierarchical Multi-Granularity Classification
[article]
2022
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Other Versions
coarse-to-fine levels. ...
If the observed label is at the leaf level, the combinatorial loss further imposes the multi-class cross-entropy loss to increase the weight of fine-grained classification loss. ...
Softmax outputs imply mutually exclusive relations among fine-grained classes, which is consistent with the hierarchy constraint defined in the tree hierarchy. ...
arXiv:2201.03194v2
fatcat:vwnkqsqnhjbqbfqpszeyrwwilu
Experience with fine-grain synchronization in MIMD machines for preconditioned conjugate gradient
1993
Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming - PPOPP '93
Preserved Fulltext
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.
Our experiments indicate that fine-grain synchronization improves overall performance by a factor of 3.7 on 16 processors using the largest problem size we could simulate; we project that a significant ...
This paper discusses our experience with fine-grain synchronization for a variant of the preconditioned conjugate gradient method. ...
We would also like to acknowledge Norm Rubin [10] for inspiring us to use the MICCG3D application for our study. ...
doi:10.1145/155332.155352
dblp:conf/ppopp/YeungA93
fatcat:iimqw2y6hzbzzcflrlvesrjdcm
Experience with fine-grain synchronization in MIMD machines for preconditioned conjugate gradient
1993
SIGPLAN notices
Preserved Fulltext
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.
Our experiments indicate that fine-grain synchronization improves overall performance by a factor of 3.7 on 16 processors using the largest problem size we could simulate; we project that a significant ...
This paper discusses our experience with fine-grain synchronization for a variant of the preconditioned conjugate gradient method. ...
We would also like to acknowledge Norm Rubin [10] for inspiring us to use the MICCG3D application for our study. ...
doi:10.1145/173284.155352
fatcat:h6g2p6i3jndthgiwlmxhx25sii
Page 2848 of Mathematical Reviews Vol. , Issue 94e
[page]
1994
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Summary: “We present a ‘fine-grained’ solution to the mutual exclusion problem. ...
little specific information about the distribution beyond what is implied by our asymptotic results.”
94e:68047 68P15
Anderson, James H. (1-MD-C; College Park, MD)
A fine-grained solution to the mutual ...
A system-level approach to hardware reconfigurable systems
2005
Proceedings of the 2005 conference on Asia South Pacific design automation - ASP-DAC '05
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
This paper will provide a solution to the problem of design space exploration for such embedded systems of the next generation. ...
We will show the problems occurring while exploring the design space at the system-level, leading to new properties for valid implementations. ...
All these methods have in common that they assume dedicated fine grain resources. ...
doi:10.1145/1120725.1120853
dblp:conf/aspdac/HaubeltOGT05
fatcat:fso5gos32nfcjp3ix2cqhn5j6i
Extracting Facets from Lost Fine-Grained Categorizations in Dataspaces
[chapter]
2014
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In this paper we propose a semi-automatic approach to the extraction of facets for the fine-grained categorization of instances in dataspaces. ...
Once validated and refined by domain experts, the extracted facets provide a fine-grained classification of dataspace instances. ...
Facets can be used within a specific (global) taxonomy category, to annotate instances in the dataspace with a fine-grained categorization, which helps end-user to rapidly recall instances with specific ...
doi:10.1007/978-3-319-07881-6_39
fatcat:wikwufza5ndvjmnzolwmfrwvpe
A Parallel Implementation for Determining Genomic Distances Under Deletion and Insertion
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
However, the use of combination of both fine grain and coarse grain parallelism improves the performance of the algorithm drastically. ...
The experimental results show that either coarse grain parallelism or fine grain parallelism alone does not improve the performance of the algorithm very much. ...
Special attention is paid to mutual exclusive section. ...
doi:10.1007/11428848_127
fatcat:j4nxj54x55fuvglevypbpvdf6u
Deontic Reasoning Across Contexts
[chapter]
2014
Lecture Notes in Computer Science
Preserved Fulltext
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.
Contrastivism about 'ought' holds that 'ought' claims are relativized, at least implicitly, to sets of mutually exclusive but not necessarily jointly exhaustive alternatives. ...
In particular, I am concerned with whether a particular kind of theory of the meaning of 'ought' can explain some intuitive deontic inferences, which I take to be data that such a theory needs to explain ...
Thanks to the referees for DEON 2014, an audience at Leeds, and Noah Friedman-Biglin for helpful comments and discussion. ...
doi:10.1007/978-3-319-08615-6_16
fatcat:qh646mig3nbrfietheizusb3n4
Fundamental sources of unpredictability
1997
Complexity
Preserved Fulltext
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.
We define a realm to be an exhaustive set of mutually exclusive decoherent coarse-grained histories. ...
Superstring theory was thought for a number of years to exhibit several different mutually exclusive forms, of which the "heterotic" one was the most likely to agree with nature. ...
doi:10.1002/(sici)1099-0526(199709/10)3:1<9::aid-cplx4>3.0.co;2-9
fatcat:sgve4euxujbg3axg46xjc4vwqi
« Previous
Showing results 1 — 15 out of 33,207 results