AAAAAA

   
Results: 1-7 |
Results: 7
P-BANDWIDTH PRIORITY-QUEUES ON RECONFIGURABLE TREE OF MESHES
Authors: BERTOSSI AA MEI A
Citation: Aa. Bertossi et A. Mei, P-BANDWIDTH PRIORITY-QUEUES ON RECONFIGURABLE TREE OF MESHES, Journal of parallel and distributed computing, 40(2), 1997, pp. 248-255
RATE-MONOTONIC SCHEDULING FOR HARD-REAL-TIME SYSTEMS
Authors: BERTOSSI AA FUSIELLO A
Citation: Aa. Bertossi et A. Fusiello, RATE-MONOTONIC SCHEDULING FOR HARD-REAL-TIME SYSTEMS, European journal of operational research, 96(3), 1997, pp. 429-443
CODE ASSIGNMENT FOR HIDDEN TERMINAL INTERFERENCE AVOIDANCE IN MULTIHOP PACKET RADIO NETWORKS
Authors: BERTOSSI AA BONUCCELLI MA
Citation: Aa. Bertossi et Ma. Bonuccelli, CODE ASSIGNMENT FOR HIDDEN TERMINAL INTERFERENCE AVOIDANCE IN MULTIHOP PACKET RADIO NETWORKS, IEEE/ACM transactions on networking, 3(4), 1995, pp. 441-449
INCREASING PROCESSOR UTILIZATION IN HARD-REAL-TIME SYSTEMS WITH CHECKPOINTS
Authors: BERTOSSI AA BONOMETTO M MANCINI LV
Citation: Aa. Bertossi et al., INCREASING PROCESSOR UTILIZATION IN HARD-REAL-TIME SYSTEMS WITH CHECKPOINTS, Real time systems, 9(1), 1995, pp. 5-29
SCHEDULING ALGORITHMS FOR FAULT-TOLERANCE IN HARD-REAL-TIME SYSTEMS
Authors: BERTOSSI AA MANCINI LV
Citation: Aa. Bertossi et Lv. Mancini, SCHEDULING ALGORITHMS FOR FAULT-TOLERANCE IN HARD-REAL-TIME SYSTEMS, Real time systems, 7(3), 1994, pp. 229-245
RECONFIGURABLE TREE ARCHITECTURES FOR GRACEFULLY DEGRADABLE VLSI SYSTEMS
Authors: BERTOSSI AA BONUCCELLI MA ROCCETTI M
Citation: Aa. Bertossi et al., RECONFIGURABLE TREE ARCHITECTURES FOR GRACEFULLY DEGRADABLE VLSI SYSTEMS, Journal of parallel and distributed computing, 23(3), 1994, pp. 264-277
PARALLEL STRING-MATCHING WITH VARIABLE-LENGTH DONT CARES
Authors: BERTOSSI AA LOGI F
Citation: Aa. Bertossi et F. Logi, PARALLEL STRING-MATCHING WITH VARIABLE-LENGTH DONT CARES, Journal of parallel and distributed computing, 22(2), 1994, pp. 229-234
Risultati: 1-7 |