...
atomicity : When applied to an operation on primitive data, indicates that other threads that might access the data might see the data as it exists before the operation occurs or after the operation has completed, but may never see an intermediate value of the data.
| Anchor |
|---|
big-endian | big-endian | | Wiki Markup |
|---|
<ac:structured-macro ac:name="anchor" ac:schema-version="1" ac:macro-id="69ea690b-6fb3-4c51-b3a3-06b698878a23"><ac:parameter ac:name=""> availability</ac:parameter></ac:structured-macro>
*availability* \[[IEEE Std 610.12 1990|AA. Bibliography#IEEE Std 610.12 1990]\]
The degree to which a system or component is operational and accessible when required for use. Often expressed as a probability. |
| Wiki Markup |
|---|
*big-endian* : "Multibyte data items are always stored in big-endian order, where the high bytes come first." [The Java Virtual Machine Specification|AA. Bibliography#JVMSpec 99] [Chapter 4 "The {{class}} File Format"|http://java.sun.com/docs/books/jvms/second_edition/html/ClassFile.doc.html]. This term refers to the tension between Lilliput and Blefuscu (regarding whether to open soft-boiled eggs from the large or the small end) in Jonathan Swift's satirical novel _Gulliver's *big-endian* : "Multibyte data items are always stored in big-endian order, where the high bytes come first." [The Java Virtual Machine Specification|AA. Bibliography#JVMSpec 99] [Chapter 4 "The {{class}} File Format"|http://java.sun.com/docs/books/jvms/second_edition/html/ClassFile.doc.html]. This term refers to the tension between Lilliput and Blefuscu (regarding whether to open soft-boiled eggs from the large or the small end) in Jonathan Swift's satirical novel _Gulliver's Travels_; it was first applied to the question of byte-ordering by Danny Cohen in \[[Cohen 1981|AA. Bibliography#Cohen 81]\]. |
...
| Wiki Markup |
|---|
*condition predicate* : A condition predicate is an expression constructed from the state variables of a class that must be true for a thread to continue execution. The thread pauses execution, via {{Object.wait()}}, {{Thread.sleep()}}, or some other mechanism, and is resumed later, presumably when the requirement is true and when it is notified \[[Goetz 2006|AA. Bibliography#Goetz 06]\]. |
| Anchor |
|---|
conflicting accesses | conflicting accesses | | Wiki Markup |
|---|
*conflicting accesses* : Two accesses to (reads of or writes to) the same variable provided that at least one of the accesses is a write. \[[JLS 2005|AA. Bibliography#JLS 05]\]. |
...
, or some other mechanism, and is resumed later, presumably when the requirement is true and when it is notified \[[Goetz 2006|AA. Bibliography#Goetz 06]\]. |
| Anchor |
|---|
| conflicting accesses |
|---|
| conflicting accesses |
|---|
|
| Wiki Markup |
|---|
*conflicting accesses* : Two accesses to (reads of or writes to) the same variable provided that at least one of the accesses is a write. \[[JLS 2005|AA. Bibliography#JLS 05]\]. |
| Wiki Markup |
|---|
*data race* : Conflicting accesses of the same variable that are not ordered by a happens-before relationship" \[[JLS 2005|AA. Bibliography#JLS 05]\]. |
deadlock : Two or more threads are said to have deadlocked when both block waiting for each others' locks. Neither thread can make any progress.
| Wiki Markup |
|---|
<ac:structured-macro ac:name="anchor" ac:schema-version="1" ac:macro-id="2acd4dac-5e0b-4a91-99ac-06fd449e4d4a"><ac:parameter ac:name=""> error tolerance</ac:parameter></ac:structured-macro>
*error tolerance* \[[IEEE Std 610.12 1990|AA. Bibliography#IEEE Std 610.12 1990]\]
The ability of a system or component to continue normal operation despite the presence of erroneous inputs. |
| Wiki Markup |
|---|
<ac:structured-macro ac:name="anchor" ac:schema-version="1" ac:macro-id="09724e56-d459-4437-a2cf-013d35b1a8c4"><ac:parameter ac:name=""> exploit</ac:parameter></ac:structured-macro>
*exploit* \[[Seacord 2005a|AA. Bibliography#Seacord 05]\]
A piece of software or a technique that takes advantage of a security vulnerability to violate an explicit or implicit [security policy|BB. Definitions#security policy]. |
| Wiki Markup |
|---|
<ac:structured-macro ac:name="anchor" ac:schema-version="1" ac:macro-id="73f87e59-ef76-44db-a968-412d52320b74"><ac:parameter ac:name=""> fail safe</ac:parameter></ac:structured-macro>
*fail safe* \[[IEEE Std 610.12 1990|AA. Bibliography#IEEE Std 610.12 1990]\]
Pertaining to a system or component that automatically places itself in a safe operating mode in the event of a failure; for example, a traffic light that reverts to blinking red in all directions when normal operation fails. |
| Wiki Markup |
|---|
<ac:structured-macro ac:name="anchor" ac:schema-version="1" ac:macro-id="8e980e56-8ea8-4139-aa68-08fa85958609"><ac:parameter ac:name=""> fail soft</ac:parameter></ac:structured-macro>
*fail soft* \[[IEEE Std 610.12 1990|AA. Bibliography#IEEE Std 610.12 1990]\]
Pertaining to a system or component that continues to provide partial operational capability in the event of certain failures; for example, a traffic light that continues to alternate between red and green if the yellow light fails. |
| Wiki Markup |
|---|
<ac:structured-macro ac:name="anchor" ac:schema-version="1" ac:macro-id="ba783a97-5971-4408-9774-495ee4543ae3"><ac:parameter ac:name=""> fault tolerance</ac:parameter></ac:structured-macro>
*fault tolerance* \[[IEEE Std 610.12 1990|AA. Bibliography#IEEE Std 610.12 1990]\]
The ability of a system or component to continue normal operation despite the presence of hardware or software faults |
...
| Wiki Markup |
|---|
*data race* : Conflicting accesses of the same variable that are not ordered by a happens-before relationship" \[[JLS 2005|AA. Bibliography#JLS 05]\]. |
| Anchor |
|---|
deadlock | deadlock | deadlock : Two or more threads are said to have deadlocked when both block waiting for each others' locks. Neither thread can make any progress| Anchor |
|---|
| happens-before order |
|---|
| happens-before order |
|---|
|
...
