Thesis (LLM (Public Law))--University of Stellenbosch, 2006. / A worrying recent trend is the failure of national government and some provincial governments to comply with court orders. The prohibition on execution of court orders against the state (as contained in section 3 of the State Liabilities Act) has left judgement creditors in these cases without an effective remedy for execution. In contrast, in the absence of a provision prohibiting execution of judgement debt against local governments, creditors of such governments are able to attach all the assets of local governments in execution of such debt. This has resulted in these local governments being unable to fulfil their constitutional obligation to provide basic services. This study investigates the South African rules in respect of the execution of court orders against the state with the aim of proposing a solution for the above problems. First of all, the historical and ideological origins of section 3 are set out. Thereafter, the courts’ practical interpretation of section 3 is investigated. From the above inquiry it becomes apparent that, at present, section 3 prohibits all steps towards execution of judgement debt against both the national government and provincial governments. As against this, local governments are not protected by section 3 and as such, court orders (except in certain exceptional instances) may freely be executed against local governments. The constitutionality of this state of affairs is considered next. It is argued that section 3 is incompatible with the doctrines of the rule of law, the supremacy of the Constitution and the separation of powers. It is also submitted that section 3 is an unjustifiable limitation of sections 9 and 34 of the Constitution, in addition to being contrary to sections 165, 173 and 195(f) of the Constitution. In order to achieve a constitutionally acceptable approach to execution of court orders against the state, and as a consequence of the above findings, it is recommended that section 3 should be amended to (a) make it clear that the state is obliged to comply with court orders, (b) to ensure that creditors have effective means of executing judgement debt against the state and (c) to ensure that the government is not rendered impotent by such execution procedures. Thereafter, international approaches to execution of court orders against the state are investigated. These approaches are then measured against the above-mentioned guidelines for achieving a constitutionally acceptable dispensation for execution of court orders so as to evaluate the suitability of such remedies for South African law. In the light of this discussion, it is proposed that effective remedies for execution of judgement debt against the state should be made available. It is proposed that: (a) orders ad factum praestandum should be enforceable by contempt of court proceedings, (b) orders ad pecuniam solvendam should be enforceable by means of attachment of state assets for purposes of execution (suggestions are also made to counter the disruptive effect of this remedy) and (c) that courts should also be able to issue declaratory orders that an order of court has been disobeyed by the state.

Troupers: Essays in Three Rings is a collection of fourteen essays focused mainly on variety entertainers (including the author). It leads the reader through a menagerie of the author's own enthusiasms--from clowning and circus elephants, to hot jazz and the ukulele. While the primary occupation of the "troupers"spotlighted here has always been to delight audiences, many of them--both human and animal--could not escape the hardscrabble, the sundered relations, the violence of everyday life. The author tells the stories of these "troupers" here, stories that reveal both their suffering and their refusal to suffer.

Cette thèse démontre que l'exercice de la justice criminelle des juges de Maupeou résulte de différentes tensions qui influent sur les jugements des nouveaux parlementaires parisiens. L'analyse des décisions des juges en matières criminelles reflète les multiples défis qui se posent à la nouvelle magistrature et la volonté de contenter différents publics. Les nouveaux juges doivent assurer leur légitimité judiciaire et asseoir l'autorité de la nouvelle Cour. Ils exercent une justice criminelle différente de celle des anciens parlementaires parisiens. Devant les différentes pressions politiques et judiciaires qui se dressent devant les magistrats, une forme de réformisme conservateur se dégage des pratiques des hommes de Maupeou. La thèse démontre que les pratiques judiciaires des parlementaires s'inscrivent au sein d'une tension importante : la nécessité de préserver la sévérité des châtiments de façon à rendre la justice plus terrible et la volonté de réduire la douleur sur le corps des coupables. Ainsi, les juges tentent de substituer des peines corporelles plus douloureuses pour des châtiments publics plus spectaculaires qui permettront au Parlement de publiciser sa nouvelle autorité judiciaire. / This thesis argues that Maupeou's Parisian parlementaires exercised criminal justice in the context of «judicial tensions». An analysis of the« Parlement Maupeou »'s criminal judgements reflects the challenges regarding a need to please different publics. Maupeou's magistrates wanted to impose their legitimacy and authority over the French population. They challenged political pressure that influenced their administration of criminal justice and contributed to forge a judiciary « conservative reformism ». On one hand, Maupeou's magistrates wanted to exercise a terrifying justice over the French population with rigorous judgements and, on the other band, they wanted to reduce pain on criminal's bodies. These parlementaires pronounced spectacular public executions that could publicized and reinforced their authority over the public, but they also reduced dolorous corporal punishments.

Nous présentons deux contributions dans le domaine de la programmation parallèle. La première est théorique : nous introduisons l’analyse SIPS, une approche nouvelle pour dénombrer le nombre d’opérations de synchronisation durant l’exécution d’un algorithme parallèle ordonnancé par vol de travail. Basée sur le concept d’horloges logiques, elle nous permet : d’une part de donner de nouvelles majorations de coût en moyenne; d’autre part de concevoir des programmes parallèles plus efficaces par adaptation dynamique de la granularité. La seconde contribution est pragmatique : nous présentons une parallélisation générique d’algorithmes pour la génération déterministe de nombres pseudo-aléatoires, indépendamment du nombre de processus concurrents lors de l’exécution. Alternative à l’utilisation d’un générateur pseudo-aléatoire séquentiel par processus, nous introduisons une API générique, appelée Par-R qui est conçue et analysée grâce à SIPS. Sa caractéristique principale est d’exploiter un générateur séquentiel qui peut “sauter” directement d’un nombre à un autre situé à une distance arbitraire dans la séquence pseudo-aléatoire. Grâce à l’analyse SIPS, nous montrons qu’en moyenne, lors d’une exécution par vol de travail d’un programme très parallèle (dont la profondeur ou chemin critique est très petite devant le travail ou nombre d’opérations), ces opérations de saut sont rares. Par-R est comparé au générateur pseudo-aléatoire DotMix écrit pour Cilk Plus, une extension de C/C++ pour la programmation parallèle par vol de travail. Le surcout théorique de Par-R se compare favorablement au surcoput de DotMix, ce qui apparait aussi expériemntalement. De plus, étant générique, Par-R est indépendant du générateur séquentiel sous-jacent. / Nós apresentamos duas contribuições para a área de programação paralela. A primeira contribuição é teórica: nós introduzimos a análise SIPS, uma nova abordagem para a estimar o número de sincronizações realizadas durante a execução de um algoritmo paralelo. SIPS generaliza o conceito de relógios lógicos para contar o número de sincronizações realizadas por um algoritmo paralelo e é capaz de calcular limites do pior caso mesmo na presença de execuções paralelas não-determinísticas, as quais não são geralmente cobertas por análises no estado-da-arte. Nossa análise nos permite estimar novos limites de pior caso para computações escalonadas pelo popular algoritmo de roubo de tarefas e também projetar programas paralelos e adaptáveis que são mais eficientes. A segunda contribuição é pragmática: nós apresentamos uma estratégia de paralelização eficiente para a geração de números pseudoaleatórios. Como uma alternativa para implementações fixas de componentes de geração aleatória nós introduzimos uma API chamada Par-R, projetada e analisada utilizando-se SIPS. Sua principal idea é o uso da capacidade de um gerador sequencial R de realizar um “pulo” eficiente dentro do fluxo de números gerados; nós os associamos a operações realizadas pelo escalonador por roubo de tarefas, o qual nossa análise baseada em SIPS demonstra ocorrer raramente em média. Par-R é comparado com o gerador paralelo de números pseudoaleatórios DotMix, escrito para a plataforma de multithreading dinâmico Cilk Plus. A latência de Par-R tem comparação favorável à latência do DotMix, o que é confirmado experimentalmente, mas não requer o uso subjacente fixado de um dado gerador aleatório. / We present two contributions to the field of parallel programming. The first contribution is theoretical: we introduce SIPS analysis, a novel approach to estimate the number of synchronizations performed during the execution of a parallel algorithm. Based on the concept of logical clocks, it allows us: on one hand, to deliver new bounds for the number of synchronizations, in expectation; on the other hand, to design more efficient parallel programs by dynamic adaptation of the granularity. The second contribution is pragmatic: we present an efficient parallelization strategy for pseudorandom number generation, independent of the number of concurrent processes participating in a computation. As an alternative to the use of one sequential generator per process, we introduce a generic API called Par-R, which is designed and analyzed using SIPS. Its main characteristic is the use of a sequential generator that can perform a “jump-ahead” directly from one number to another on an arbitrary distance within the pseudorandom sequence. Thanks to SIPS, we show that, in expectation, within an execution scheduled by work stealing of a “very parallel” program (whose depth or critical path is subtle when compared to the work or number of operations), these operations are rare. Par-R is compared with the parallel pseudorandom number generator DotMix, written for the Cilk Plus dynamic multithreading platform. The theoretical overhead of Par-R compares favorably to DotMix’s overhead, what is confirmed experimentally, while not requiring a fixed generator underneath.

Nous présentons deux contributions dans le domaine de la programmation parallèle. La première est théorique : nous introduisons l’analyse SIPS, une approche nouvelle pour dénombrer le nombre d’opérations de synchronisation durant l’exécution d’un algorithme parallèle ordonnancé par vol de travail. Basée sur le concept d’horloges logiques, elle nous permet : d’une part de donner de nouvelles majorations de coût en moyenne; d’autre part de concevoir des programmes parallèles plus efficaces par adaptation dynamique de la granularité. La seconde contribution est pragmatique : nous présentons une parallélisation générique d’algorithmes pour la génération déterministe de nombres pseudo-aléatoires, indépendamment du nombre de processus concurrents lors de l’exécution. Alternative à l’utilisation d’un générateur pseudo-aléatoire séquentiel par processus, nous introduisons une API générique, appelée Par-R qui est conçue et analysée grâce à SIPS. Sa caractéristique principale est d’exploiter un générateur séquentiel qui peut “sauter” directement d’un nombre à un autre situé à une distance arbitraire dans la séquence pseudo-aléatoire. Grâce à l’analyse SIPS, nous montrons qu’en moyenne, lors d’une exécution par vol de travail d’un programme très parallèle (dont la profondeur ou chemin critique est très petite devant le travail ou nombre d’opérations), ces opérations de saut sont rares. Par-R est comparé au générateur pseudo-aléatoire DotMix écrit pour Cilk Plus, une extension de C/C++ pour la programmation parallèle par vol de travail. Le surcout théorique de Par-R se compare favorablement au surcoput de DotMix, ce qui apparait aussi expériemntalement. De plus, étant générique, Par-R est indépendant du générateur séquentiel sous-jacent. / Nós apresentamos duas contribuições para a área de programação paralela. A primeira contribuição é teórica: nós introduzimos a análise SIPS, uma nova abordagem para a estimar o número de sincronizações realizadas durante a execução de um algoritmo paralelo. SIPS generaliza o conceito de relógios lógicos para contar o número de sincronizações realizadas por um algoritmo paralelo e é capaz de calcular limites do pior caso mesmo na presença de execuções paralelas não-determinísticas, as quais não são geralmente cobertas por análises no estado-da-arte. Nossa análise nos permite estimar novos limites de pior caso para computações escalonadas pelo popular algoritmo de roubo de tarefas e também projetar programas paralelos e adaptáveis que são mais eficientes. A segunda contribuição é pragmática: nós apresentamos uma estratégia de paralelização eficiente para a geração de números pseudoaleatórios. Como uma alternativa para implementações fixas de componentes de geração aleatória nós introduzimos uma API chamada Par-R, projetada e analisada utilizando-se SIPS. Sua principal idea é o uso da capacidade de um gerador sequencial R de realizar um “pulo” eficiente dentro do fluxo de números gerados; nós os associamos a operações realizadas pelo escalonador por roubo de tarefas, o qual nossa análise baseada em SIPS demonstra ocorrer raramente em média. Par-R é comparado com o gerador paralelo de números pseudoaleatórios DotMix, escrito para a plataforma de multithreading dinâmico Cilk Plus. A latência de Par-R tem comparação favorável à latência do DotMix, o que é confirmado experimentalmente, mas não requer o uso subjacente fixado de um dado gerador aleatório. / We present two contributions to the field of parallel programming. The first contribution is theoretical: we introduce SIPS analysis, a novel approach to estimate the number of synchronizations performed during the execution of a parallel algorithm. Based on the concept of logical clocks, it allows us: on one hand, to deliver new bounds for the number of synchronizations, in expectation; on the other hand, to design more efficient parallel programs by dynamic adaptation of the granularity. The second contribution is pragmatic: we present an efficient parallelization strategy for pseudorandom number generation, independent of the number of concurrent processes participating in a computation. As an alternative to the use of one sequential generator per process, we introduce a generic API called Par-R, which is designed and analyzed using SIPS. Its main characteristic is the use of a sequential generator that can perform a “jump-ahead” directly from one number to another on an arbitrary distance within the pseudorandom sequence. Thanks to SIPS, we show that, in expectation, within an execution scheduled by work stealing of a “very parallel” program (whose depth or critical path is subtle when compared to the work or number of operations), these operations are rare. Par-R is compared with the parallel pseudorandom number generator DotMix, written for the Cilk Plus dynamic multithreading platform. The theoretical overhead of Par-R compares favorably to DotMix’s overhead, what is confirmed experimentally, while not requiring a fixed generator underneath.

A dissertação propõe analisar a concretização da efetividade do processo nas ações de execução por quantia certa em face da Fazenda Pública. O tema constitui-se relevante uma vez que a efetividade tornou-se a voga da onda renovatória do processo civil. Torna-se de fundamental importância uma vez que a Fazenda Pública é a maior demandada em juízo em todas as esferas sejam a União, os Estados, o Distrito Federal, os Municípios e as autarquias. Nessa toada, é mister que sejam enfrentadas as prerrogativas garantidas à Fazenda Pública como instrumento ou não de óbice contra a efetividade do processo tutelado na Constituição Federal. Dentre as prerrogativas, a Constituição estabeleceu que os pagamentos devidos pela Fazenda Federal, Estadual ou Municipal, em virtude de sentença judicial, far-se-ão exclusivamente na ordem de apresentação dos precatórios. O que vem a ser essa figura tipicamente brasileira denominada precatório? Quais os impactos desse instituto em face da efetividade do processo? Seria constitucional esse instituto estabelecido quando se analisa sistemicamente a constituição? Pelo princípio da unidade da constituição e pela máxima efetividade, seria cabível o que trouxeram as Emendas Constitucionais n 30/2000 e 62/2009, que estabeleceram uma verdadeira moratória das dívidas já reconhecidas e que já se encontravam em fila de espera? Uma vez que a Constituição vem enfrentando uma verdadeira afronta mediante as reformas propostas via emenda constitucional do poder constituinte derivado, é necessário que seja feita uma reflexão quanto à inconstitucionalidade ou não dessas emendas, sob pena de ser afrontado um direito fundamental garantido pela Constituição. Se não houver uma profunda quebra de paradigma, é possível que a efetividade do processo em face da Fazenda Pública tornese uma verdadeira utopia, ficando todos os litigantes contra a Fazenda Pública com o desconfortável sentimento de injustiça não sendo o Poder Judiciário capaz de ser um instrumento de pacificação social / The thesis proposes to analyze the effectiveness of civil process regarding the attachment and garnishment actions for debts of the Public Administration. The issue is relevant because the process effectiveness has become the new trend in civil process, and because the Public Administration is the major defendant in all levels of the Judiciary, being the Federal Government, the States, Federal District, Municipalities or Agencies. Therefore it is mandatory to analyze the privileges granted to the Public Administration as instrument for or impediment against the effectiveness of process, as mentioned by the Federal Constitution. One of the Public Administrations privileges the Constitution established is that payments owed by the Federal, State, and Municipal Governments, from any judicial decision are to be made exclusively in the order Judicial Awards for Payment by Public Administration are filed. What is this typical Brazilian institute called Judicial Award for Payment by Public Administration? What is the impact of such institute on process effectiveness? Would such institute be considered constitutional when one interprets systematically the Constitution? Considering the principles of unity of the Constitution and maximum effectiveness, are the Amendments # 30/2000 and 62/2009 that have established an actual moratorium to Public debts already awarded and waiting on the line legally adequate? While the Constitution is facing a big challenge by the proposed Constitutional Amendments from Congress an examination of their unconstitutionality is called for. If such examination is not done provisions from fundamental rights granted by the Constitution may be disregarded. And if there is no profound paradigm break it is possible the process effectiveness against the Public Administration becomes an utopia, and all litigants against the Public Administration remain with the uncomfortable feeling of injustice. In such a case, the Judiciary Power is not going to be able to work as an instrument of social pacification

O presente trabalho tem como objeto de estudo a análise da viabilidade constitucional da implantação da execução fiscal administrativa no Brasil. Iniciamos o nosso estudo analisando a execução fiscal brasileira, seus princípios e realizamos considerações acerca da dívida ativa e seus dados atuais e também sobre as Execuções Fiscais que tramitam perante a Justiça Federal de 1 grau, em seguida realizamos um estudo de direito comparado demonstrando como se processa a execução dos créditos tributários em outros países, para então partimos para um estudo mais detalhado sobre o Processo Administrativo Tributário e a decisão administrativa tributária. No terceiro capítulo, apresentamos os Projetos de Lei em trâmite no Congresso Nacional e o debate doutrinário a cerca da implantação da execução fiscal administrativa no país e tecermos nossas considerações a cerca da inconstitucionalidade da implantação de qualquer um dos Projetos de Lei abordados. A metodologia de pesquisa adotada foi o levantamento bibliográfico e documental e a interpretação de dados acerca dos processos de execução fiscal que tramitam perante a 1 instância da Justiça Federal e a Dívida Ativa da União, fornecidos nos sítios oficiais da Procuradoria Geral da Fazenda Nacional, Conselho Nacional de Justiça e Justiça Federal e através do embasamento teórico que versam sobre o tema, assim como artigos científicos publicados em revistas acadêmicas e científicas e em sítios especializados / The present work hás the objective to study the analysis of the constitutional viability of the implantation of the administrative fiscal execution in Brazil. We begin our study by analyzing the brazilian fiscal execution, its principles and by realizing considerations about the active debt and its actual date and also about the fiscal executions that proced in the federal justice of 1st. Grade, later on we realize a study of compared rights demonstrating how the execution of tributary credits work in other countries so that we go on for a more detailed study about the tributary administrative process and about the tributary administrative decision. In the 3rd chapter we presented the law projects in course at the National Congress and doctrinary debate about the implantation of the administrative fiscal execution in the country and we devise our considerations about the inconstutionality of implantation of any one of law projects considered. The methodology of investigation chosen was the bibliographical and documental research and the interpretation of date about the processes of fiscal execution in course at the 1st instance of federal justice and active debt of the Union, supplied by the official sites of the general attorney of the national treasury, the national council of justice and federal, justice and by the theoretical embasement that deal with the theme, as well as scientific articles published in academic and scientific magazines and specialized sites

Em face das dificuldades encontradas pelo credor para o recebimento dos seus créditos na execução civil, o presente trabalho tem por objetivo demonstrar a necessidade de relativização da impenhorabilidade de bens, a fim de ampliar a responsabilidade patrimonial do devedor que possibilitará que o mesmo cumpra com as suas obrigações, e consequentemente o credor receba o seu crédito, tendo em vista que o recebimento do crédito na execução civil se trata de um direito fundamental. A afirmação da existência do direito fundamental do credor só foi possível com a pesquisa bibliográfica, em que juristas corroboraram a necessidade da tutela executiva, deixando claro que é preciso a relativização da impenhorabilidade dos bens a fim de que a prestação jurisdicional ocorra de maneira eficaz para os credores no procedimento de execução civil. / Given the difficulties encountered by the lender to the receipt of their claims in civil enforcement, this paper aims to demonstrate the need for relativization of immunity from seizure of goods in order to increase the financial liability of the debtor that will enable it to comply with the their obligations, and therefore the lender receives your credit, given that the credit receipt in civil enforcement it is a fundamental right. The affirmation of the existence of the fundamental right of the lender was only possible with the literature, in which legal experts confirmed the need for executive protection, making it clear that the relativization of immunity from seizure of the assets so that the adjudication occurs effectively it takes to creditors in the civil enforcement procedure.

Sur le point de disparaître en France à la fin du XIXe siècle, la peine de mort connaît un regain à pai1ir de 1906. S'appuyant sur les émotions punitives présentes dans l'opinion publique ainsi que sur les discours criminologiques, le système judiciaire vise à l'élimination de certains accusés. La peine capitale reste cependant marginale dans l'ensemble de la répression pénale et ne punit qu'une minorité de crimes de sang considérés comme particulièrement atroces. Les condamnés à mort sont fréquemment issus des couches les plus misérables et les moins intégrées de la société. Les discours judiciaires, plaidoiries, réquisitoires, expertises, s'affrontent pour déterminer si ces individus peuvent disposer de circonstances atténuantes. Les fonctions de la peine de mort sont alors discutées: s'agit-il de faire un exemple, de venger, ou d'épurer le corps social? S'entremêlent alors considérations rationnelles et émotionnelles. Ces discussions ont lieu à deux niveaux : celui de la cour d'assises d'abord, où l'enjeu est de convaincre les citoyens siégeant comme jurés, celui de l'administration ministérielle et présidentielle ensuite, où l'enjeu est de décider d'une éventuelle grâce. Les condamnés à mort, en attendant que l'on statue sur leur sort, sont détenus dans des conditions particulièrement sévères, devant éviter évasion ou suicide. Leur temps et leur espace sont extrêmement normés, ce qui ne les empêche pas de les aménager à des fins qui leur sont propres. La préparation à mort s'inscrit dans des perspectives tant laïques et religieuses Le cas échéant, la décision d'exécution mobilise forces de l'ordre, personnel pénitentiaire, l'exécuteur et ses aides, pour un acte conjuguant aspects bureaucratiques et brutale violence. Sinon, le condamné est rendu aux circuits pénitentiaires ordinaires, où il risque cependant une autre forme de mort pénale. / Death penalty was about to disappear in France at the end of the 19th century. But the number of death sentences rose after 1906. The judiciary relied on the punitive emotions of the public opinion and on the criminological knowledge to eliminate some of the defendants. The capital punishment was very minor in the whole penal repression and its enforcement punished a small number of murders, considered as particularly heinous. The people sentenced to death came from the most miserable and less integrated parts of the society. Judicial discourses, such as speeches for the prosecution or the defense, or testimonies, confronted each other to determine if these people should benefit of mitigating circumstances. The functions of the death penalty were then discussed: deterrence, retribution, revenge or purge of the social body? Emotional as well as rational arguments were used. The cases were exposed at two different levels: a first time in front of the criminal court and of the citizen seating in the jury, a second time in front of the presidential advisors and of the President of the Republic, who had to decide of the pardon or the execution. The people sentenced to death had to wait their fate in particularly harsh conditions, which aimed at avoiding suicide or escape. Very strong rules framed their time and their space but some of them succeeded to adjust their environment for their own purposes. The preparation to death could be religious or secular. It the need arose, police, army, penitentiary staff, as well as the executioner and his helps were summoned to perform the execution, an act combining bureaucratic aspects and rough violence. In the other case the prisoner was held back to the ordinary prison system, where he could still risk another form of penal death.

Nous présentons deux contributions dans le domaine de la programmation parallèle. La première est théorique : nous introduisons l’analyse SIPS, une approche nouvelle pour dénombrer le nombre d’opérations de synchronisation durant l’exécution d’un algorithme parallèle ordonnancé par vol de travail. Basée sur le concept d’horloges logiques, elle nous permet : d’une part de donner de nouvelles majorations de coût en moyenne; d’autre part de concevoir des programmes parallèles plus efficaces par adaptation dynamique de la granularité. La seconde contribution est pragmatique : nous présentons une parallélisation générique d’algorithmes pour la génération déterministe de nombres pseudo-aléatoires, indépendamment du nombre de processus concurrents lors de l’exécution. Alternative à l’utilisation d’un générateur pseudo-aléatoire séquentiel par processus, nous introduisons une API générique, appelée Par-R qui est conçue et analysée grâce à SIPS. Sa caractéristique principale est d’exploiter un générateur séquentiel qui peut “sauter” directement d’un nombre à un autre situé à une distance arbitraire dans la séquence pseudo-aléatoire. Grâce à l’analyse SIPS, nous montrons qu’en moyenne, lors d’une exécution par vol de travail d’un programme très parallèle (dont la profondeur ou chemin critique est très petite devant le travail ou nombre d’opérations), ces opérations de saut sont rares. Par-R est comparé au générateur pseudo-aléatoire DotMix écrit pour Cilk Plus, une extension de C/C++ pour la programmation parallèle par vol de travail. Le surcout théorique de Par-R se compare favorablement au surcoput de DotMix, ce qui apparait aussi expériemntalement. De plus, étant générique, Par-R est indépendant du générateur séquentiel sous-jacent. / Nós apresentamos duas contribuições para a área de programação paralela. A primeira contribuição é teórica: nós introduzimos a análise SIPS, uma nova abordagem para a estimar o número de sincronizações realizadas durante a execução de um algoritmo paralelo. SIPS generaliza o conceito de relógios lógicos para contar o número de sincronizações realizadas por um algoritmo paralelo e é capaz de calcular limites do pior caso mesmo na presença de execuções paralelas não-determinísticas, as quais não são geralmente cobertas por análises no estado-da-arte. Nossa análise nos permite estimar novos limites de pior caso para computações escalonadas pelo popular algoritmo de roubo de tarefas e também projetar programas paralelos e adaptáveis que são mais eficientes. A segunda contribuição é pragmática: nós apresentamos uma estratégia de paralelização eficiente para a geração de números pseudoaleatórios. Como uma alternativa para implementações fixas de componentes de geração aleatória nós introduzimos uma API chamada Par-R, projetada e analisada utilizando-se SIPS. Sua principal idea é o uso da capacidade de um gerador sequencial R de realizar um “pulo” eficiente dentro do fluxo de números gerados; nós os associamos a operações realizadas pelo escalonador por roubo de tarefas, o qual nossa análise baseada em SIPS demonstra ocorrer raramente em média. Par-R é comparado com o gerador paralelo de números pseudoaleatórios DotMix, escrito para a plataforma de multithreading dinâmico Cilk Plus. A latência de Par-R tem comparação favorável à latência do DotMix, o que é confirmado experimentalmente, mas não requer o uso subjacente fixado de um dado gerador aleatório. / We present two contributions to the field of parallel programming. The first contribution is theoretical: we introduce SIPS analysis, a novel approach to estimate the number of synchronizations performed during the execution of a parallel algorithm. Based on the concept of logical clocks, it allows us: on one hand, to deliver new bounds for the number of synchronizations, in expectation; on the other hand, to design more efficient parallel programs by dynamic adaptation of the granularity. The second contribution is pragmatic: we present an efficient parallelization strategy for pseudorandom number generation, independent of the number of concurrent processes participating in a computation. As an alternative to the use of one sequential generator per process, we introduce a generic API called Par-R, which is designed and analyzed using SIPS. Its main characteristic is the use of a sequential generator that can perform a “jump-ahead” directly from one number to another on an arbitrary distance within the pseudorandom sequence. Thanks to SIPS, we show that, in expectation, within an execution scheduled by work stealing of a “very parallel” program (whose depth or critical path is subtle when compared to the work or number of operations), these operations are rare. Par-R is compared with the parallel pseudorandom number generator DotMix, written for the Cilk Plus dynamic multithreading platform. The theoretical overhead of Par-R compares favorably to DotMix’s overhead, what is confirmed experimentally, while not requiring a fixed generator underneath.