Models of central capacity and concurrency

DOI10.1016/0022-2496(84)90001-4MaRDI QIDQ762011zbMATH OpenOpenAlexFDO

Authors Richard Schweickert, George J. Boggs

Publication date 1984

Published in Journal of Mathematical Psychology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0022-2496(84)90001-4

zbMATH Keywords

complexityspeed-accuracy trade-offreviewscheduling theorydeadlockscentral mechanismconcurrent mental operationsoperating systems theorysingle channel theorythrashing

Mathematics Subject Classification ID

Mathematical psychology (91E99)

Recommendations

• scientific article; zbMATH DE number 176124
• scientific article; zbMATH DE number 1314563
• Modeling the dynamics of concurrent computing systems
• scientific article; zbMATH DE number 1185853
• Concurrency model for distributed systems
• Models for determination of total capacity in computer and communicating systems
• Models for concurrency: Towards a classification
• Context for models of concurrency

Cites work

• scientific article; zbMATH DE number 3139352 (Why is no real title available?)
• scientific article; zbMATH DE number 3959192 (Why is no real title available?)
• scientific article; zbMATH DE number 3483531 (Why is no real title available?)
• scientific article; zbMATH DE number 3513292 (Why is no real title available?)
• scientific article; zbMATH DE number 3561065 (Why is no real title available?)
• scientific article; zbMATH DE number 3575352 (Why is no real title available?)
• scientific article; zbMATH DE number 3599479 (Why is no real title available?)
• scientific article; zbMATH DE number 2146482 (Why is no real title available?)
• scientific article; zbMATH DE number 3225808 (Why is no real title available?)
• scientific article; zbMATH DE number 3062467 (Why is no real title available?)
• A Proof for the Queuing Formula: L = λW
• A Shared Memory Computer Display System
• A critical path generalization of the additive factor method: Analysis of a stroop task
• Contour Enhancement, Short Term Memory, and Constancies in Reverberating Neural Networks
• Critical-Path Planning and Scheduling: Mathematical Basis
• Decomposing the reaction time distribution: Pure insertion and selective influence revisited
• Estimating an unobserved component of a serial response time model
• Fundamental operational laws of computer system performance
• SOME RESULTS CONCERNING THE IDENTIFIABILITY OF PARALLEL AND SERIAL PROCESSES
• Serial and within-stage independent parallel model equivalence on the minimum completion time
• Stochastic PERT networks as models of cognition: Derivation of the mean, variance, and distribution of reaction time using order-of-processing (OP) diagrams
• The bias of an estimate of coupled slack in stochastic PERT networks
• The theory of search: III. The optimum distribution of searching effort
• Theory of optimal search

Cited in

(4)

• Stochastic networks as models of cognition: Deriving predictions for resource-constrained mental processing
• Selective influence and response time cumulative distribution functions in serial-parallel task networks.
• Modeling and estimating recall processing capacity: sensitivity and diagnostic utility in application to mild cognitive impairment
• Channels and stages in human information processing: A limited analysis of theory and methodology

This page was built for publication: Models of central capacity and concurrency

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q762011)