Results 1 - 10 of 282,020

Table 1 Concurrent Pascal versus Pascal.

in Monitors and Concurrent Pascal: A Personal History ∗ (1993)
by unknown authors
"... In PAGE 32: ... Entry variables are not permitted in monitors. Table1 shows how Concurrent Pascal difiers from Pascal. It lists the features that were added to Pascal as well as those that were excluded.... ..."

Table 4b: Mainframes per GDP Independent

in Across the Digital Divide: A Cross-Country Analysis of the Determinants
by Industry Sponsors, Sanjeev Dewan, Dale Ganley, Dale Ganley, Kenneth L. Kraemer, Kenneth L. Kraemer 2004
"... In PAGE 21: ... Thus, this analysis provides an insight into the nature of the Divide that is uniquely available from the quantile regression method, and is beyond the scope of the OLS regression methods employed in prior research. The patterns in the regressions on Mainframe penetration ( Table4 ) generally show either a neutral or increasing effect on the Divide (with the exception of GDP in Panel b). With respect to the penetration level of PCs (Table 5), however, the cost of a local call, years of schooling and trade in goods break the pattern in the per capita regressions by having a decreasing impact, ... In PAGE 34: ...Table4 : Quantile Regression Results for Mainframes Penetration Table 4a: Mainframes per Capita... In PAGE 34: ...Penetration Table4 a: Mainframes per Capita... ..."
Cited by 1

TABLE IV SHOWING THE COMPARATIVE PERFORMANCE OF DIFFERENT PASCAL IMPLEMENTATIONS ON THE SIEVE OF ERASTOSTENES PROGRAM AS A FUNCTION OF SET SIZE

in From SIMD to Micro-Grids I. COMPILING TO SIMD PARALLELISM
by Paul Cockshott

Table 1: The operators of PASCAL#7BXSC module EXI

in unknown title
by unknown authors
"... In PAGE 7: ... Thus, new operator symbols AHO, SHO, MHO, DHO were used for the operations producing a directed interval enclosing the true result of the corresponding operation on real arguments. GiasNeg#28#29 and GiasDual#28#29 were implemented in EXI , ARI module by the corresponding unary operators #5C, quot; and #5C , quot; #28see Table1 #29. Convex hull operations were implemented in EXI , ARI byoverloading of the PASCAL-XSC operator #5C+#03 quot; for real, interval and mixed type operands.... ..."

Table 1: Completion Dispatcher Concurrency

in Firfan, Harrison,
by Schmidtg Cs Wustl, Irfan Pyarali, Tim Harrison 1997
"... In PAGE 10: ... However, most modern operating sys- tems support some form of asynchronous I/O. In combination A and B from Table1 , the Post-reactive approach to asynchronous I/O is probably the best, assuming you are not waiting on any semaphores or mutexes. If you are, a Call-through implementation may be more responsive.... ..."
Cited by 23

Table 1: Completion Dispatcher Concurrency

in Firfan, Harrison,
by Schmidtg Cs, Irfan Pyarali, Tim Harrison
"... In PAGE 10: ... However, most modern operating sys- tems support some form of asynchronous I/O. In combination A and B from Table1 , the Post-reactive approach to asynchronous I/O is probably the best, assuming you are not waiting on any semaphores or mutexes. If you are, a Call-through implementation may be more responsive.... ..."

Table 1: Completion Dispatcher Concurrency

in Proactor - An Object Behavioral Pattern for Demultiplexing and Dispatching Handlers for Asynchronous Events
by Irfan Pyarali, Tim Harrison, Douglas C. Schmidt, Thomas D. Jordan
"... In PAGE 10: ... However, most modern operating sys- tems support some form of asynchronous I/O. In combination A and B from Table1 , the Post-reactive approach to asynchronous I/O is probably the best, assuming you are not waiting on any semaphores or mutexes. If you are, a Call-through implementation may be more responsive.... ..."

Table 2: Semantics of REACTIVE PASCAL.

in REACTIVE PASCAL and the Event Calculus: A platform to program reactive, rational agents
by Exte Nd Ed, Jacinto A. D'avila Quintero
"... In PAGE 4: ...Table2 REACTIVE PASCAL : Semantics (and implementation) done(Pr; To; Tf) proc Pr begin C end ^ done(C; To; Tf) [DN ? 01] done(( C1 ; C2); To; Tf) done(C1; To; T1) ^ done(C2; T1; Tf) [DN ? 02] done(( C1 par C2); To; Tf) done(C1; To; T1) ^ done(C2; To; Tf) ^ T1 Tf _ done(C1; To; Tf) ^ done(C2; To; T1)... ..."

Table 2: Semantics of REACTIVE PASCAL.

in REACTIVE PASCAL and the Event Calculus: A platform to program reactive, rational agents
by Jacinto Davila, Jacinto A. D'avila Quintero
"... In PAGE 4: ...Table2 REACTIVE PASCAL : Semantics (and implementation) done(Pr; To; Tf) proc Pr begin C end ^ done(C; To; Tf) [DN ? 01] done(( C1 ; C2); To; Tf) done(C1; To; T1) ^ done(C2; T1; Tf) [DN ? 02] done(( C1 par C2); To; Tf) done(C1; To; T1) ^ done(C2; To; Tf) ^ T1 Tf _ done(C1; To; Tf) ^ done(C2; To; T1)... ..."

Table 2: Hierarchy of concurrency control mechanisms

in Shared simple Virtual Environment: An object-oriented framework for highly-interactive group collaboration
by John M. Linebarger, Christopher D. Janneck, G. Drew Kessler 2003
"... In PAGE 7: ... 10. CONCURRENCY CONTROL As Table2 indicates, a hierarchy of concurrency control mechanisms is available in SSVE to control various types of collaborative activities. A combination of atomic mutual exclusion ( mutex ) locks (implemented using operating system calls such as TryEnterCriticalSection() under Windows) and transaction locks (implemented using object properties) drive the logic for these mechanisms, which make them particularly appropriate for multi-threaded virtual environments.... ..."
Cited by 4
Results 1 - 10 of 282,020