Predicting the time of oblivious programs

被引：0

作者：

Gonzalez, JA ^{[1
]}

Leon, C ^{[1
]}

Piccoli, F ^{[1
]}

Printista, M ^{[1
]}

Roda, JL ^{[1
]}

Rodriguez, C ^{[1
]}

Sande, F ^{[1
]}

机构：

[1] Univ La Laguna, Dept EIOC, Fac Matemat, Tenerife, Spain

来源：

NINTH EUROMICRO WORKSHOP ON PARALLEL AND DISTRIBUTED PROCESSING, PROCEEDINGS | 2001年

关键词：

D O I：

10.1109/EMPDP.2001.905063

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

The BSP model can be extended with a zero cost synchronization mechanism that can be used when the numbers of messages due to receive is known. This mechanism, usually known as "oblivious synchronization", implies that different processors can be in different supersteps at the same rime. An unwanted consequence of these software improvements is a loss of accuracy in prediction. This paper proposes an extension of the BSP complexity model to deal with oblivious barriers and shows its accuracy.

引用

页码：363 / 368

页数：6

共 50 条

[1] BRANCHING PROGRAMS VERSUS OBLIVIOUS BRANCHING PROGRAMS
HROMKOVIC, J
COMPUTERS AND ARTIFICIAL INTELLIGENCE, 1991, 10 (01): : 67 - 74
[2] BSP, LogP, and oblivious programs
Eisenbiegler, J
Löwe, W
Zimmermann, W
EURO-PAR '98 PARALLEL PROCESSING, 1998, 1470 : 865 - 874
[3] ON OBLIVIOUS BRANCHING PROGRAMS OF LINEAR LENGTH
KRAUSE, M
WAACK, S
LECTURE NOTES IN COMPUTER SCIENCE, 1989, 380 : 287 - 296
[4] Pseudorandom Bits for Oblivious Branching Programs
Gurjar, Rohit
Volk, Ben Lee
ACM TRANSACTIONS ON COMPUTATION THEORY, 2020, 12 (02)
[5] ON OBLIVIOUS BRANCHING PROGRAMS OF LINEAR LENGTH
KRAUSE, M
WAACK, S
INFORMATION AND COMPUTATION, 1991, 94 (02) : 232 - 249
[6] Exploring the Efficiency of Data-Oblivious Programs
Biernacki, Lauren
Tiruye, Biniyam Mengist
Demissie, Meron Zerihun
Andargie, Fitsum Assamnew
Reagen, Brandon
Austin, Todd
2023 IEEE INTERNATIONAL SYMPOSIUM ON PERFORMANCE ANALYSIS OF SYSTEMS AND SOFTWARE, ISPASS, 2023, : 189 - 200
[7] The power of nondeterminism and randomness for oblivious branching programs
Hromkovic, J
Sauerhoff, M
THEORY OF COMPUTING SYSTEMS, 2003, 36 (02) : 159 - 182
[8] The Power of Nondeterminism and Randomness for Oblivious Branching Programs
Juraj Hromkovič
Martin Sauerhoff
Theory of Computing Systems, 2003, 36 : 159 - 182
[9] Methods and means of predicting the run time of serial programs
Kalinichenko D.V.
Kapitonova A.P.
Yushchenko N.V.
Computational Mathematics and Modeling, 1998, 9 (4) : 366 - 374
[10] A portable model for predicting the size and execution time of programs
Axelsson, J
JOURNAL OF SYSTEMS ARCHITECTURE, 1997, 43 (1-5) : 211 - 213

← 1 2 3 4 5 →