Pages that link to "Item:Q1391751"
From MaRDI portal
The following pages link to On the parallel complexity of loops (Q1391751):
Displaying 8 items.
- The semantics and complexity of parallel programs for vector computations. I: A case study using Ada (Q1110310) (← links)
- Parallelization of recurrent loops with conditional statements (Q1285322) (← links)
- On the problem of optimizing parallel programs for complex memory hierarchies (Q1322382) (← links)
- The static parallelization of loops and recursions (Q1375712) (← links)
- On the complexity of loop fusion (Q1575601) (← links)
- (Q2997475) (← links)
- (Q4361345) (← links)
- ON THE OPTIMALITY OF ALLEN AND KENNEDY'S ALGORITHM FOR PARALLELISM EXTRACTION IN NESTED LOOPS (Q4366895) (← links)