kw.\*:("Bucle programa")
Results 1 to 25 of 292
Selection :
Loop formulas for disjunctive logic programsLEE, Joohyung; LIFSCHITZ, Vladimir.Lecture notes in computer science. 2003, pp 451-465, issn 0302-9743, isbn 3-540-20642-6, 15 p.Conference Paper
Interprocedural transformations for extracting maximum parallelismCHANG, Yu-Sug; LEE, Hye-Jung; PARK, Doo-Soon et al.Lecture notes in computer science. 2002, pp 415-424, issn 0302-9743, isbn 3-540-00009-7, 10 p.Conference Paper
On the stability semantics of combinational programsVAN DUNG, Tran.Lecture notes in computer science. 2005, pp 180-194, issn 0302-9743, isbn 3-540-29107-5, 1Vol, 15 p.Conference Paper
Register complexity of LOOP-, WHILE-, and GOTO-programsHOLZER, Markus; KUTRIB, Martin.Lecture notes in computer science. 2005, pp 233-244, issn 0302-9743, isbn 3-540-25261-4, 12 p.Conference Paper
Varieties of weakest liberal preconditionsMORRIS, J. M.Information processing letters. 1987, Vol 25, Num 3, pp 207-210, issn 0020-0190Article
Well-founded induction and the invariance theorem for loopsMORRIS, J. M.Information processing letters. 1989, Vol 32, Num 3, pp 155-158, issn 0020-0190Article
Dynamic processor self-scheduling for general parallel nested loopsZHIXI FANG; PEIYI TANG; PEN-CHUNG YEW et al.IEEE transactions on computers. 1990, Vol 39, Num 7, pp 919-929, issn 0018-9340, 11 p.Article
Loop-carried code placementFABER, Peter; GRIEBL, Martin; LENGAUER, Christian et al.Lecture notes in computer science. 2001, pp 230-234, issn 0302-9743, isbn 3-540-42495-4Conference Paper
Using loop-level parallelism to parallelize vectorizable programsPRESSEL, D. M; SAHU, J; HEAVEY, K. R et al.Lecture notes in computer science. 2001, pp 28-44, issn 0302-9743, isbn 3-540-41944-6Conference Paper
Unique sets oriented parallelization of loops with non-uniform dependencesJIALIN JU; CHAUDHARY, V.Computer journal (Print). 1997, Vol 40, Num 6, pp 322-339, issn 0010-4620Article
An analysis of loop checking mechanisms for logic programsBOL, R. N; APT, K. R; KLOP, J. W et al.Theoretical computer science. 1991, Vol 86, Num 1, pp 35-79, issn 0304-3975Article
Loop-dead optimizationSHAW, Sachin; KUMAR, Pawan.ACM SIGPLAN notices. 2005, Vol 40, Num 2, pp 33-40, issn 1523-2867, 8 p.Article
Loop squashing transformations for amorphous slicingLIN HU; HARMAN, Mark; HIERONS, Robert M et al.Working conference on reverse engineering. 2004, pp 152-160, isbn 0-7695-2243-2, 1Vol, 9 p.Conference Paper
Using loops in genetic programming for a twc class binary image classification problemXIANG LI; CIESIELSKI, Vic.Lecture notes in computer science. 2004, pp 898-909, issn 0302-9743, isbn 3-540-24059-4, 12 p.Conference Paper
Minimizing register requirements of a modulo schedule via optimum stage schedulingEICHENBERGER, A. E; DAVIDSON, E. S; ABRAHAM, S. G et al.International journal of parallel programming. 1996, Vol 24, Num 2, pp 103-132, issn 0885-7458Article
Performance-oriented synchronisation migration in a DOACROSS loopHWANG, R.-Y.IEE proceedings. Computers and digital techniques. 1996, Vol 143, Num 4, pp 224-231, issn 1350-2387Article
Compiler algorithms for synchronizationMIDKIFF, S. P; PADUA, D. A.IEEE transactions on computers. 1987, Vol 36, Num 12, pp 1485-1495, issn 0018-9340Article
Automatic loop transformations and parallelization for JavaARTIGAS, Pedro V; GUPTA, Manish; MIKIFF, Samuel P et al.Parallel processing letters. 2000, Vol 10, Num 2-3, pp 153-164, issn 0129-6264Conference Paper
Parallélisation automatique par insertion de directives = Automatic parallelization by directives insertionSilber, Georges-André; Darte, Alain.1999, 153 p.Thesis
Techniques de parallélisation automatique de nids de boucles = Automatic parallelization techniques for uniform loop nestsDarte, Alain; Robert, Yves.1993, 130 p.Thesis
Introducing symbolic problem solving techniques in the dependence testing phases of a vectorizer; Sur l'introduction du calcul symbolique dans les méthodes de vectorisation automatique = Sur l'introduction du calcul symbolique dans les méthodes de vectorisation automatiqueLICHNEWSKY, A; THOMASSET, François.Rapports de recherche - INRIA. 1988, Vol 820, issn 0249-6399, 16 p.Report
A novel approach for partitioning iteration spaces with variable densitiesKEJARIWAL, Arun; NICOLAU, Alexandra; BANERJEE, Utpal et al.ACm SIGPLAN symposium on principles and practice of parallel programming. 2005, pp 120-131, isbn 1-59593-080-9, 1Vol, 12 p.Conference Paper
Resource-directed loop pipelining : Exposing just enough parallelismNOVACK, S; NICOLAU, A.Computer journal (Print). 1997, Vol 40, Num 6, pp 311-321, issn 0010-4620Article
Traitement des indexations non linéaires en parallélisation automatique: Une méthode de linéarisation contextuelle = Dependence analysis in the non-linear case: a contextual linearization methodDumay, Alain; Feautrier, Paul.1992, 146 p.Thesis
Loops of superexponential lengths in one-rule string rewritingGESER, Alfons.Lecture notes in computer science. 2002, pp 267-280, issn 0302-9743, isbn 3-540-43916-1, 14 p.Conference Paper