This HTML5 document contains 26 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

Prefix	IRI
dcterms	http://purl.org/dc/terms/
dbo	http://dbpedia.org/ontology/
foaf	http://xmlns.com/foaf/0.1/
n11	https://global.dbpedia.org/id/
dbt	http://dbpedia.org/resource/Template:
rdfs	http://www.w3.org/2000/01/rdf-schema#
freebase	http://rdf.freebase.com/ns/
rdf	http://www.w3.org/1999/02/22-rdf-syntax-ns#
owl	http://www.w3.org/2002/07/owl#
wikipedia-en	http://en.wikipedia.org/wiki/
dbc	http://dbpedia.org/resource/Category:
dbp	http://dbpedia.org/property/
prov	http://www.w3.org/ns/prov#
xsdh	http://www.w3.org/2001/XMLSchema#
wikidata	http://www.wikidata.org/entity/
gold	http://purl.org/linguistics/gold/
dbr	http://dbpedia.org/resource/

Statements

Subject Item

dbr:Concurrent_computing

rdfs:seeAlso

dbr:Relaxed_sequential

Subject Item

dbr:Relaxed_sequential

rdf:type

dbo:Person

rdfs:label

Relaxed sequential

rdfs:comment

Relaxed sequential in computer science is an execution model describing the ability for a parallel program to run sequentially. If a parallel program has a valid sequential execution it is said to follow a relaxed sequential execution model. It does not need to be efficient. Programs designed to require concurrency are more difficult to debug. Programs designed to require concurrency will have performance issues when the number of required threads exceeds the number of hardware threads because time slicing artifacts can hit hard.

dcterms:subject

dbc:Parallel_computing

dbo:wikiPageID

12474218

dbo:wikiPageRevisionID

789051726

dbo:wikiPageWikiLink

dbc:Parallel_computing dbr:Race_Condition dbr:Producer-consumer dbr:Threading_Building_Blocks dbr:Computer_science dbr:Deadlock dbr:Execution_model dbr:Preemption_(computing) dbr:Parallel_computing

owl:sameAs

wikidata:Q7310872 freebase:m.02w7vbt n11:4u5zE

dbp:wikiPageUsesTemplate

dbt:ISBN

dbo:abstract

Relaxed sequential in computer science is an execution model describing the ability for a parallel program to run sequentially. If a parallel program has a valid sequential execution it is said to follow a relaxed sequential execution model. It does not need to be efficient. The word relaxed refers to the notion that serial programs are actually overly constrained by implicit serial dependencies (such as the program counter) and that one can introduce as much parallelism as possible without removing the ability to run sequentially. You can think of this model as being as relaxed as possible and still being able to run correctly in a single thread. That is the goal. Most parallel programs can run sequentially but will benefit from parallelism when it is present. It is possible to design programs that require parallelism for correct behavior. Algorithms such as producer-consumer that are implemented so as to require two or more threads are one example of requiring concurrency to work properly. For instance, consider a bounded container with a capacity for only three items and a program which has one thread doing “PUT PUT PUT PUT,” and another thread doing “GET GET GET GET,” each doing their actions only four at a time. Such a program requires interleaving (concurrency). A program that requires concurrency is more difficult to debug. It is easier to debug a program that has a valid sequential execution. Programs designed to require concurrency are more difficult to debug. Programs designed to require concurrency will have performance issues when the number of required threads exceeds the number of hardware threads because time slicing artifacts can hit hard.

gold:hypernym

dbr:Model

prov:wasDerivedFrom

wikipedia-en:Relaxed_sequential?oldid=789051726&ns=0

dbo:wikiPageLength

2052

foaf:isPrimaryTopicOf

wikipedia-en:Relaxed_sequential

Subject Item

wikipedia-en:Relaxed_sequential

foaf:primaryTopic

dbr:Relaxed_sequential