Parallel processing response times and experimental determination of the stopping rule

被引:18
|
作者
Townsend, JT [1 ]
Colonius, H
机构
[1] Indiana Univ, Bloomington, IN 47405 USA
[2] Univ Oldenburg, D-2900 Oldenburg, Germany
基金
美国国家科学基金会;
关键词
D O I
10.1006/jmps.1997.1185
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
It was formerly demonstrated that virtually all reasonable exhaustive serial models, and a more constrained set of exhaustive parallel models, cannot predict critical effects associated with self-terminating models. The present investigation greatly generalizes the parallel class of models covered by similar "impossibility" theorems. Specifically. we prove that if an exhaustive parallel model is not super capacity, and if targets are processed at least as fast as non-targets, then it cannot predict such (self-terminating) effects. Such effects are ubiquitous in the experimental literature, Offering strong confirmation for self-terminating processing. (C) 1997 Academic Press.
引用
收藏
页码:392 / 397
页数:6
相关论文
共 50 条
  • [11] Nonindependent and nonstationary response times in stopping and stepping saccade tasks
    Nelson, Matthew J.
    Boucher, Leanne
    Logan, Gordon D.
    Palmeri, Thomas J.
    Schall, Jeffrey D.
    ATTENTION PERCEPTION & PSYCHOPHYSICS, 2010, 72 (07) : 1913 - 1929
  • [12] Experimental determination of electronic stopping for ions in silicon dioxide
    Zhang, Y
    Weber, WJ
    McCready, DE
    Grove, DA
    Jensen, J
    Possnert, G
    APPLIED PHYSICS LETTERS, 2005, 87 (10)
  • [13] Parallel machine scheduling with time dependent processing times
    Chen, ZL
    DISCRETE APPLIED MATHEMATICS, 1996, 70 (01) : 81 - 93
  • [14] GRAIN DETERMINATION FOR PARALLEL PROCESSING SYSTEMS
    KRUATRACHUE, B
    LEWIS, T
    PROCEEDINGS OF THE TWENTY-FIRST, ANNUAL HAWAII INTERNATIONAL CONFERENCE ON SYSTEM SCIENCES, VOLS 1-4: ARCHITECTURE TRACK, SOFTWARE TRACK, DECISION SUPPORT AND KNOWLEDGE BASED SYSTEMS TRACK, APPLICATIONS TRACK, 1988, : B119 - B128
  • [15] Parallel Hybrid Metaheuristics for the Scheduling with Fuzzy Processing Times
    Bozejko, Wojciech
    Czapinski, Michal
    Wodecki, Mieczyslaw
    ARTIFICIAL INTELLIGENCE AND SOFT COMPUTING, PT II, 2010, 6114 : 379 - +
  • [16] Parallel processing chalks up fast times on analyses
    不详
    PROFESSIONAL ENGINEERING, 2002, 15 (11) : 45 - 45
  • [17] Parallel machine problems with equal processing times: a survey
    Kravchenko, Svetlana A.
    Werner, Frank
    JOURNAL OF SCHEDULING, 2011, 14 (05) : 435 - 444
  • [18] Parallel machine scheduling models with fuzzy processing times
    Peng, J
    Liu, BD
    INFORMATION SCIENCES, 2004, 166 (1-4) : 49 - 66
  • [19] Rescheduling of parallel machines with stochastic processing and setup times
    Arnaout, Jean-Paul
    JOURNAL OF MANUFACTURING SYSTEMS, 2014, 33 (03) : 376 - 384
  • [20] On a parallel machine scheduling problem with equal processing times
    Kravchenko, Svedana A.
    Werner, Frank
    DISCRETE APPLIED MATHEMATICS, 2009, 157 (04) : 848 - 852