Dissertations / Theses on the topic 'Threads'

Common principles, or threads, are studied that are readily found in both spiritual traditions (including religion) and in the field of sustainability. Oneness, Living Simply, Purity, and Care and Heart are examined at length, while Awakening, Awe and Wonder, and Preservation of Life are covered briefly. Opposite principles—for example, Oneness versus Fracturedness, and Purity versus Pollution—are analyzed as well. Principles and their opposites are found to have both high and low modes. Each polarity has life-supporting and life-degrading forms.

Spiritual and religious traditions are grouped into five broad categories. While three of the categories consist of world religions (traditions of Indian origin, Abrahamic traditions, and East Asian traditions), also included are indigenous traditions, alchemy and Hermeticism, and modern spiritual teachings. Sustainability is organized into three categories: ecological science, activism, and sustainable business.

The common threads between sustainability and spirituality are most reliably found in the segments of world religions that tend toward mysticism, and within teachings that emphasize the cultivation of a greater capacity for just awareness, or presence itself, such as Eckhart Tolle’s works. Indigenous traditions shine as examples of societies that have embodied, and in some cases, continue to embody life-supporting principles far more explicitly and fully than cultures that have lost intimacy with their local ecosystems.

The conclusions drawn based on findings is that wisdom traditions corroborate the idea that the outer world is a reflection of the inner world, and that improving the state of the planet therefore requires personal transformation as a prerequisite to outer improvements. A higher order of intelligence, or nous, referenced in multiple mystical traditions, is indispensable to sustainability work. This and other spiritual principles directly inform sustainability efforts, but to be fully employed they require first-hand, personal experience of spiritual realities. Those who would work toward a genuinely sustainable society are urged to pursue mystical or presence-based spiritual training and experience as a matter of urgency, including direct interaction with nature to facilitate rebuilding intimacy with ecosystems, combined with deepening understanding of ecologically sophisticated indigenous lifeways.

Los temas de investigación sobre multithreading han ganado mucho interés en la arquitectura de computadores con la aparición de procesadores multihilo y multinucleo. Los procesadores SMT (Simultaneous Multithreading) son uno de estos nuevos paradigmas, combinando la capacidad de emisión de múltiples instrucciones de los procesadores superscalares con la habilidad de explotar el paralelismo a nivel de hilos (TLP). Así, la principal característica de los procesadores SMT es ejecutar varios hilos al mismo tiempo para incrementar la utilización de las etapas del procesador mediante la compartición de recursos.
Los recursos compartidos son el factor clave de los procesadores SMT, ya que esta característica conlleva tratar con importantes cuestiones pues los hilos también compiten por estos recursos en el núcleo del procesador. Si bien distintos grupos de aplicaciones se benefician de disponer de SMT, las diferentes propiedades de los hilos ejecutados pueden desbalancear la asignación de recursos entre los mismos, disminuyendo los beneficios de la ejecución multihilo. Por otro lado, el problema con la memoria está aún presente en los procesadores SMT. Estos procesadores alivian algunos de los problemas de latencia provocados por la lentitud de la memoria con respecto a la CPU. Sin embargo, hilos con grandes cargas de trabajo y con altas tasas de fallos en las caches son unas de las mayores dificultades de los procesadores SMT. Estos hilos intensivos en memoria tienden a crear importantes problemas por la contención de recursos. Por ejemplo, pueden llegar a bloquear recursos críticos debido a operaciones de larga latencia impidiendo no solo su ejecución, sino el progreso de la ejecución de los otros hilos y, por tanto, degradando el rendimiento general del sistema.
El principal objetivo de esta tesis es aportar soluciones novedosas a estos problemas y que mejoren el rendimiento de los procesadores SMT. Para conseguirlo, proponemos los Runahead Threads (RaT) aplicando una ejecución especulativa basada en runahead. RaT es un mecanismo alternativo a las políticas previas de gestión de recursos las cuales usualmente restringían a los hilos intensivos en memoria para conseguir más productividad.
La idea clave de RaT es transformar un hilo intensivo en memoria en un hilo ligero en el uso de recursos que progrese especulativamente. Así, cuando un hilo sufre de un acceso de larga latencia, RaT transforma dicho hilo en un hilo de runahead mientras dicho fallo está pendiente. Los principales beneficios de esta simple acción son varios. Mientras un hilo está en runahead, éste usa los diferentes recursos compartidos sin monopolizarlos o limitarlos con respecto a los otros hilos. Al mismo tiempo, esta ejecución especulativa realiza prebúsquedas a memoria que se solapan con el fallo principal, por tanto explotando el paralelismo a nivel de memoria y mejorando el rendimiento.
RaT añade muy poco hardware extra y complejidad en los procesadores SMT con respecto a su implementación. A través de un mecanismo de checkpoint y lógica de control adicional, podemos dotar a los contextos hardware con la capacidad de ejecución en runahead. Por medio de RaT, contribuímos a aliviar simultaneamente dos problemas en el contexto de los procesadores SMT. Primero, RaT reduce el problema de los accesos de larga latencia en los SMT mediante el paralelismo a nivel de memoria (MLP). Un hilo prebusca datos en paralelo en vez de estar parado debido a un fallo de L2 mejorando su rendimiento individual. Segundo, RaT evita que los hilos bloqueen recursos bajo fallos de larga latencia. RaT asegura que el hilo intensivo en memoria recicle más rápido los recursos compartidos que usa debido a la naturaleza de la ejecución especulativa.
La principal limitación de RaT es que los hilos especulativos pueden ejecutar instrucciones extras cuando no realizan prebúsqueda e innecesariamente consumir recursos de ejecución en el procesador SMT. Este inconveniente resulta en hilos de runahead ineficientes pues no contribuyen a la ganancia de rendimiento e incrementan el consumo de energía debido al número extra de instrucciones especulativas. Por consiguiente, en esta tesis también estudiamos diferentes soluciones dirigidas a solventar esta desventaja del mecanismo RaT. El resultado es un conjunto de soluciones complementarias para mejorar la eficiencia de RaT en términos de consumo de potencia y gasto energético.
Por un lado, mejoramos la eficiencia de RaT aplicando ciertas técnicas basadas en el análisis semántico del código ejecutado por los hilos en runahead. Proponemos diferentes técnicas que analizan y controlan la utilidad de ciertos patrones de código durante la ejecución en runahead. Por medio de un análisis dinámico, los hilos en runahead supervisan la utilidad de ejecutar los bucles y subrutinas dependiendo de las oportunidades de prebúsqueda. Así, RaT decide cual de estas estructuras de programa ejecutar dependiendo de la información de utilidad obtenida, decidiendo entre parar o saltar el bucle o la subrutina para reducir el número de las instrucciones no útiles. Entre las técnicas propuestas, conseguimos reducir las instrucciones especulativas y la energía gastada mientras obtenemos rendimientos similares a la técnica RaT original.
Por otro lado, también proponemos lo que denominamos hilos de runahead eficientes. Esta propuesta se basa en una técnica más fina que cubre todo el rango de ejecución en runahead, independientemente de las características del programa ejecutado. La idea principal es averiguar "cuando" y "durante cuanto" un hilo en runahead debe ser ejecutado prediciendo lo que denominamos distancia útil de runahead. Los resultados muestran que la mejor de estas propuestas basadas en la predicción de la distancia de runahead reducen significativamente el número de instrucciones extras así como también el consumo de potencia. Asimismo, conseguimos mantener los beneficios de rendimiento de los hilos en runahead, mejorando de esta forma la eficiencia energética de los procesadores SMT usando el mecanismo RaT.
La evolución de RaT desarrollada durante toda esta investigación nos proporciona no sólo una propuesta orientada a un mayor rendimiento sino también una forma eficiente de usar los recursos compartidos en los procesadores SMT en presencia de operaciones de memoria de larga latencia.
Dado que los diseños SMT en el futuro estarán orientados a optimizar una combinación de rendimiento individual en las aplicaciones, la productividad y el consumo de energía, los mecanismos basados en RaT aquí propuestos son interesantes opciones que proporcionan un mejor balance de rendimiento y energía que las propuestas previas en esta área.
Research on multithreading topics has gained a lot of interest in the computer architecture community due to new commercial multithreaded and multicore processors. Simultaneous Multithreading (SMT) is one of these relatively new paradigms, which combines the multiple instruction issue features of superscalar processors with the ability of multithreaded architectures to exploit thread level parallelism (TLP). The main feature of SMT processors is to execute multiple threads that increase the utilization of the pipeline by sharing many more resources than in other types of processors.
Shared resources are the key of simultaneous multithreading, what makes the technique worthwhile.
This feature also entails important challenges to deal with because threads also compete for resources in the processor core. On the one hand, although certain types and mixes of applications truly benefit from SMT, the different features of threads can unbalance the resource allocation among threads, diminishing the benefit of multithreaded execution. On the other hand, the memory wall problem is still present in these processors. SMT processors alleviate some of the latency problems arisen by main memory's slowness relative to the CPUs. Nevertheless, threads with high cache miss rates that use large working sets are one of the major pitfalls of SMT processors. These memory intensive threads tend to use processor and memory resources poorly creating the highest resource contention problems. Memory intensive threads can clog up shared resources due to long latency memory operations without making progress on a SMT processor, thereby hindering overall system performance.
The main goal of this thesis is to alleviate these shortcomings on SMT scenarios. To accomplish this, the key contribution of this thesis is the application of the paradigm of Runahead execution in the design of multithreaded processors by Runahead Threads (RaT). RaT shows to be a promising alternative to prior SMT resource management mechanisms which usually restrict memory bound threads in order to get higher throughputs.
The idea of RaT is to transform a memory intensive thread into a light-consumer resource thread by allowing that thread to progress speculatively. Therefore, as soon as a thread undergoes a long latency load, RaT transforms the thread to a runahead thread while it has that long latency miss outstanding. The main benefits of this simple action performed by RaT are twofold. While being a runahead thread, this thread uses the different shared resources without monopolizing or limiting the available resources for other threads. At the same time, this fast speculative thread issues prefetches that overlap other memory accesses with the main miss, thereby exploiting the memory level parallelism.
Regarding implementation issues, RaT adds very little extra hardware cost and complexity to an existing SMT processor. Through a simple checkpoint mechanism and little additional control logic, we can equip the hardware contexts with the runahead thread capability. Therefore, by means of runahead threads, we contribute to alleviate simultaneously the two shortcomings in the context of SMT processor improving the performance. First, RaT alleviates the long latency load problem on SMT processors by exposing memory level parallelism (MLP). A thread prefetches data in parallel (if MLP is available) improving its individual performance rather than be stalled on an L2 miss. Second, RaT prevents threads from clogging resources on long latency loads. RaT ensures that the L2-missing thread recycles faster the shared resources it uses by the nature of runahead speculative execution. This avoids memory intensive threads clogging the important processor resources up.
The main limitation of RaT though is that runahead threads can execute useless instructions and unnecessarily consume execution resources on the SMT processor when there is no prefetching to be exploited. This drawback results in inefficient runahead threads which do not contribute to the performance gain and increase dynamic energy consumption due to the number of extra speculatively executed instructions. Therefore, we also propose different solutions aimed at this major disadvantage of the Runahead Threads mechanism. The result of the research on this line is a set of complementary solutions to enhance RaT in terms of power consumption and energy efficiency.
On the one hand, code semantic-aware Runahead threads improve the efficiency of RaT using coarse-grain code semantic analysis at runtime. We provide different techniques that analyze the usefulness of certain code patterns during runahead thread execution. The code patterns selected to perform that analysis are loops and subroutines. By means of the proposed coarse grain analysis, runahead threads oversee the usefulness of loops or subroutines depending on the prefetches opportunities during their executions. Thus, runahead threads decide which of these particular program structures execute depending on the obtained usefulness information, deciding either stall or skip the loop or subroutine executions to reduce the number of useless runahead instructions. Some of the proposed techniques reduce the speculative instruction and wasted energy while achieving similar performance to RaT.
On the other hand, the efficient Runahead thread proposal is another contribution focused on improving RaT efficiency. This approach is based on a generic technique which covers all runahead thread executions, independently of the executed program characteristics as code semantic-aware runahead threads are. The key idea behind this new scheme is to find out --when' and --how long' a thread should be executed in runahead mode by predicting the useful runahead distance. The results show that the best of these approaches based on the runahead distance prediction significantly reduces the number of extra speculative instructions executed in runahead threads, as well as the power consumption. Likewise, it maintains the performance benefits of the runahead threads, thereby improving the energy-efficiency of SMT processors using the RaT mechanism.
The evolution of Runahead Threads developed in this research provides not only a high performance but also an efficient way of using shared resources in SMT processors in the presence of long latency memory operations. As designers of future SMT systems will be increasingly required to optimize for a combination of single thread performance, total throughput, and energy consumption, RaT-based mechanisms are promising options that provide better performance and energy balance than previous proposals in the field.

The increasing number of cores in both desktops and servers leads to a demand for efficient parallel algorithms. This project focuses on the fundamental collective operation reduce, which merges several arrays into one by applying a binary operation element wise. Several reduce algorithms are evaluated in terms of performance and scalability and a novel algorithm is introduced that takes advantage of shared memory and exploits load imbalance. To do so, the concept of dynamic pair generation is introduced which implies constructing a binary reduce tree dynamically based on the order of thread arrival, where pairs are formed in a lock-free manner. We conclude that the dynamic algorithm, given enough spread in the arriving times, can outperform the reference algorithms for some or all array sizes.

Most people might not reflect upon textiles as anything more than the soft material in our clothes. As a crafts practitioner, I gain knowledge of woven materials that go beyond that. The knowledge of weaving and materials is developing the ideas that form the concept of this project. From the tacit knowledge, derived from years of practically working with textile materials, an intellectual understanding of materials and the worlds they construct is growing. In this project, I decipher my own ideas of the woven structure in order to invite others to experience the universe within textiles. I look at the weave as a structure, built up by small particles in forms of threads. If seeing the weave from a distance, each repeated pattern can in turn be perceived as the smallest element. By seeing woven materials from more than one perspective, I believe that the understanding of the construction itself can develop. As this understanding grows, so does the ability to judge the quality of the material. In this line of thought, the tools used to reflect upon what materials are, how they are made and what they signify, becomes greater. To visualise the knowledge I have of the textile structures I make, I work with a waffle weave structure, together with a dyeing technique called Ikat. I also draw connections between the woven structure and that of a map – as a tool that humans use to understand their surroundings. The use of perspectives and scale is another tool that is used to widen our perception of the world around us. In order to create an experience of the universe within textiles and to invite others into that world, I draw parallels between the miniature scale of the woven material and larger, architectural structures. The final outcome of this project is a textile installation, consisting of three weavings that together form a larger construction. The construction is open for people to enter and experience. Inside the construction a smaller woven piece is presented as a map over the woven world. This weaving initially contains the same information as the large structure, but on a much smaller scale.

Image no. 16 has been removed due to copyright reasons. A link to the image can be found in the List of References

Just as a strand of thread is composed of many smaller threads, so too are there many factors in a single musical moment. Threads of the Moment explores three of these factors: the roles of composer, performer, and listener. The first movement “Composer” seeks to reflect the often messy and disorganized compositional process. Contrary to popular belief, it is not as simple as putting notes on a page and calling that "music.” To compose one must explore and experiment with every sound, big or small, and find the beauty in each so that those sounds can be brought together. There are times where the sounds blend and complement one another, but at other times they create sharp contrasts and dissonance as the composer seeks to find music within the chaotic exploration. The second movement “Performer” explores the idea of a performer being one who interprets and presents the music of the composer. However, while the performer does play based on the composer’s intentions and instructions, there is also room for interpretation. A performer brings new life to a piece by discovering new potential within it and adding his or her voice. To reflect this the cellist acts as the composer, at first leading and inspiring the bass clarinet as the performer, but later the bass clarinet starts to branch off and finds its own interpretation of the melody that it expands on. The final movement looks at the role of listener not only in regards to the audience, but also to the performers themselves who listen to one another’s parts. No one hears the music the exact same way and there are times when a listener is fully engaged, but other times the listener begins to “drift” and lose themselves in the music. For this movement this is reflected in the clarity of certain sections in regards to melody that fractures and enters into hazier sections where the performers are in their own worlds, and it ends with one last thought from each of them.

This thesis considers the problem of recovering from failures of distributable threads with assured timeliness. When a node hosting a portion of a distributable thread fails, it causes orphansâ i.e., thread segments that are disconnected from the threadâ s root. A termination model is considered for recovering from such failures. In this model the orphans must be detected and cleaned up, and failure-exception notification must be delivered to the farthest, contiguous surviving thread segment for resuming thread execution. Two real-time scheduling algorithms (AUA and HUA) and three distributable thread integrity protocols (TPR, D-TPR and W-TPR) are presented. We show that AUA combined with any of the protocols presented bounds the orphan cleanup and recovery time, thereby bounding thread starvation durations and maximizing the total thread accrued timeliness utility. The algorithms and the protocols are implemented in a real-time middleware that supports distributable threads. The experimental studies with the implementation validate the algorithm/protocolsâ time-bounded recovery property and confirm their effectiveness.
Master of Science

The object of the work was to develop the use of high-pressure steam in order to replace air in air-jets in the production of intermingled yarns, particularly for sewmg threads. The thesis discusses the development of air-jet texturing! intermingling and analysis of the process by earlier workers. Differences between steam-flow and air-flow through jets are discussed. The effects of process parameters on steam-jet intermingling and comparisons of steam-jet intermingled yarns and air-jet intermingled yarns have been studied. The results show that steam-jet intermingled yarn has higher strength, higher elongation, higher loop stability and lower boiling water shrinkage than air-jet intermingled yarn. Core-yarn wetting does not have a significant effect on the steam-jet intermingling process and intermingled yarn properties. Elimination of the wetting system reduces the production cost of steam-jet compared to air-jet. Steam-jet intermingled yarn needs less energy to heat-set after intermingling, as it has been partially heat-set by steam during intermingling. Sewing threads were made from steam-jet intermingled yarns and assessed using industrial sewing specifications. The sewing threads were also subjected to commercial trials. Sewing test results show that steam-jet intermingled sewing thread meets commercial levels of performance. Preliminary investigations revealed that high-pressure water could also be used in intermingling as a replacement of air or steam. It was found that lower core-yarn overfeeds, such as 2.9 %, can be used and therefore higher strength of intermingled yarn could be achieved. Turbulence in water was improved by designing a jet so as to suck air by water through a capillary from the outside atmosphere.

In the theoretical part of this thesis are described types of threads, methods of production and control of threads, types of taps, types of coatings and cutting fluids, analysis of specific cutting forces during thread cutting and theoretical analysis of the cross-section distribution by taps using. The experimental part of this thesis includes the production of internal threads by cutting tap at constant cutting conditions. The cutting time was measured according to the function of time during the experiment. The measured data were statistically processed and, as a result, the cost of one thread production was calculated.

With the future of high performance computing quickly moving towards a higher and higher count of CPU cores, the need for efficient memory coherence models is becoming more and more prevalent. Strict memory models, while convenient for the programmer, limit the scalability and overall performance of multi- and manycore systems. For this reason, relaxed memory models are looked into, both in academia and in the industry. Applications written for stronger memory models often contain data races, which cause unexpected behaviour in more relaxed models, many of which rely on data race free code to work. At the same time, some of the most widely used programming languages now require data race free code. For these reasons, the need for benchmarks based on properly synchronised code is bigger than ever. In this thesis, we will identify data races in major benchmark suites, remove them, and then quantify and compare the performance differences between the unmodified and the properly synchronised versions.

Performance is constrained by power consumption in modern computer architectures. One way to reduce power consumption, and hence increase performance, is to eliminate redundant operations between assembly instructions. This redundancy elimination, however, is difficult, because it involves solving a costly on-line problem: the shortest common supersequence. Previous work have proposed many different heuristics to solve this problem at either the architecture, or at the compiler level. The sheer number of different algorithms, and the vast search space makes a comparison between them a herculean task. In this dissertation, we dive into this task, providing the most extensive comparative analysis of these different heuristics ever seen in the literature. We match the different heuristics along several dimensions, including the amount of thread-level or data-level parallelism that they deliver. Our results show that relatively simple heuristics, such as the so called MinPcSp can outperform very convoluted algorithms. From this comparison we draw subsidies to design, test and implement new heuristics to share redundant work between parallel threads. Our new algorithms improve on the previous works in non-trivial ways. When testing these algorithms in industrial-strength benchmarks, we have observed that some of them are able to reduce the number of instructions to be processed by a factor of 3x.
O desempenho é limitado pelo consumo de energia em arquiteturas de computadores e uma forma de reduzir o consumo de energia e aumentando o desempenho é eliminar operações redundantes. Mas isso é difícil, porque envolve a solução de um problema caro: a supersequência mais curta. Trabalhos anteriores propuseram diferentes heurísticas para resolver o problema a nível de arquitetura ou compilador. Nesta dissertação fizemos a mais extensa análise comparativa das diferentes heurísticas já vista na literatura. Combinamos as diferentes heurísticas em várias dimensões, incluindo a quantidade de paralelismo a nível de thread e a nível de dados. Nossos resultados mostram que uma heurística simples como MinPcSp pode superar algoritmos complicados. Implementamos também novas heurísticas, que melhoraram os trabalhos anteriores de maneiras não-triviais. Ao testar estes algoritmos em grandes benchmarks, observamos que alguns são capazes de reduzir o número de instruções processadas por um fator de 3x.

Thesis (M.S. in Computer Science) Naval Postgraduate School, Sept. 2001.
Thesis advisor: irvine, Cynthia E. "September 2001." Includes bibliographical references (p. 77-83). Also available in print.

Marisol Escobar, known in the 1960s as the "Latin Garbo," is a sculptor famous for showing with the Pop art greats. However, Marisol holds a curious position in art history, stranded between the formalism of the fifties' and sixties' male-dominated Pop movement and the conceptual experimentation and radicalism that followed. Trained as a draftsman and painter early in her career, Marisol's main body of work mostly consists of large-scale wooden and mixed-medium sculpture. Lesser known, her lithographs, drawings, collages and small figurines further prove her technical and artistic validity. Preferring to go by surname only, Marisol’s quiet yet intense observation pinpoints the overriding human elements present in the objects of her scrutiny. Most notable for turning her gaze inwards, her self-portraiture defies easy categorization. Meshing American art and non-Western art styles while bridging the gap between intellectual understanding and empathetic approachability, Marisol represents a unique perspective that remains relevant today. Marisol's approach to self-portraiture is, first and foremost, in service to the exploration of her own identity. Furthermore, her choice of subject matter, artistic methodology and style appear closely aligned with Postmodern discourse. Each period of her work from the 1950s to the present day includes different guises and methods that subtly critique societal roles and norms, all presented through the lens of the artist's acute wit. Internationalism, gender roles, and explorations of identity are inherent in each of her works, proving that Marisol deserves further examination to explore her relation to Postmodern thought.
B.A.
Bachelors
Arts and Humanities
Visual Arts and Design

Grazie all'evoluzione dei servizi di rete indirizzare le interfacce di rete come se fossero i veri destinatari delle comunicazioni è diventato obsoleto. Per questo è nato il concetto di Internet of Threads, in cui gli indirizzi IP sono assegnati ad ogni processo in esecuzione nel computer mediante una rete ethernet virtuale. Attualmente esistono progetti che forniscono la gestione della rete virtuale e librerie che forniscono lo stack TCP/IP da integrare all'interno dei propri programmi. Queste librerie richiedono però la modifica e ricompilazione del proprio codice, anche a causa della loro interfaccia differente dai Berkeley Socket. Attraverso PycoTCP è possibile sperimentare all'interno di un ambiente IoTh senza riscrivere il proprio codice. Inoltre unifica le API fornite dalle librerie sottostanti esponendo una interfaccia identica a quella standard del Python, in modo che non sia necessario imparare un altro metodo di programmazione per utilizzare il nuovo paradigma.

Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science; and, Thesis (B.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1998.
Includes bibliographical references (leaf 71).
by Christiana Virginia Toutet.
B.S.
M.Eng.

Thesis (M. Eng. and S.B.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2004.
Includes bibliographical references (p. 73).
Reliable, error-free software is hard to come by, and this is especially true for newer, larger, or more complex programs. CTAS, an air traffic control tool, falls into this category, making it a good candidate for research on error compensation. Specifically, this thesis addresses the issue of thread crashes in one portion of CTAS. We reimplement the thread structure in question around a simpler problem, and develop a failure detector and an accompanying repair mechanism to monitor it. These add-on components provide the application with thread consistency by swiftly and transparently recovering from crashes, thereby yielding a more stable, self-sufficient, and generally more reliable operating environment.
by Farid Jahanmir.
M.Eng.and S.B.

Thesis (M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2002.
Includes bibliographical references (leaves 49-50).
by Ovidiu Gheorghioiu.
M.Eng.

This dissertation examines the role of Singer in the modernization of sewing practices in Spain and Mexico from 1860 to 1940. Singer marketing was founded on gendered views of women’s work and gendered perceptions of the home. These connected with sewing practices in Spain and Mexico, where home sewing remained economically and culturally important throughout the 1940s. "Atlantic Threads" is the first study of the US-owned multinational in the Hispanic World. I demonstrate that sewing practices, and especially practices related to home sewing that have been considered part of the private sphere and therefore not an important historical matter, contributed to the building of one the first global corporation. I examine Singer corporate records and business strategies that have not been considered by other scholars such as the creation of the Embroidery Department in the late nineteen-century. Likewise, this dissertation challenges traditional narratives that have assumed that Spain and Mexico were peripheral to modernity. I look at Singer corporate records in Spain and Mexico and at regional government and cultural sources to demonstrate how Singer integrated Spain and Mexico within its business organization. Singer's marketing was focused on the consumer, which contributed to make the company part of local sewing businesses and cultures.

La conception à base de composants est le processus qui permet à partir d’exigences et un ensemble de composants prédéfinis d’aboutir à un système respectant les exigences. Les composants sont des blocs de construction encapsulant du comportement. Ils peuvent être composés afin de former des composants composites. Leur composition doit être rigoureusement définie de manière à pouvoir i) inférer le comportement des composants composites à partir de leurs constituants, ii) déduire des propriétés globales à partir des propriétés des composants individuels. Cependant, il est généralement impossible d’assurer ou de vérifier les propriétés souhaitées en utilisant des techniques de vérification statiques telles que la vérification de modèles ou l’analyse statique. Ceci est du au problème de l’explosion d’espace d’états et au fait que la propriété est souvent décidable uniquement avec de l’information disponible durant l’exécution (par exemple, provenant de l’utilisateur ou de l’environnement). La vérification à l’exécution (Runtime Verification) désigne les langages, les techniques, et les outils pour la vérification dynamique des exécutions des systèmes par rapport à des propriétés spécifiant formellement leur comportement. En vérification à l’exécution, une exécution du système vérifiée est analysée en utilisant une procédure de décision : un moniteur. Un moniteur peut être généré à partir d’une spécification écrite par l’utilisateur (par exemple une formule de logique temporelle, un automate) et a pour but de détecter les satisfactions ou les violations par rapport à la spécification. Généralement, le moniteur est une procédure de décision réalisant une analyse pas à pas de l’exécution capturée comme une séquence d’états du système, et produisant une séquence de verdicts (valeur de vérité prise dans un domaine de vérité) indiquant la satisfaction ou la violation de la spécification.Cette thèse s’intéresse au problème de la vérification de systèmes à composants multithread et distribués. Nous considérons un modèle général de la sémantique et système à composants avec interactions multi-parties: les composants intrinsèquement indépendants et leur interactions sont partitionées sur plusieurs ordonnanceurs. Dans ce contexte, il est possible d’obtenir des modèles avec différents degrés de parallelisme, des systèmes séquentiels, multi-thread, et distribués. Cependant, ni le modèle exact ni le comportement du système est connu. Ni le comportement des composants ni le comportement des ordonnanceurs est connu. Notre approche ne dépend pas du comportement exact des composants et des ordonnanceurs. En s’inspirant de la théorie du test de conformité, nous nommons cette hypothèse : l’hypothèse de monitoring. L’hypothèse de monitoring rend notre approche indépendante du comportement des composants et de la manière dont ce comportement est obtenu. Lorsque nous monitorons des composants concurrents, le problème qui se pose est celui de l’indisponibilité de l’état global à l’exécution. Une solution naïve à ce problème serait de brancher un moniteur qui forcerait le système à se synchroniser afin d’obtenir une séquence des états globaux à l’exécution. Une telle solution irait complètement à l’encontre du fait d’avoir des exécutions concurrentes et des systèmes distribués. Nous définissons deux approches pour le monitoring de système un composant multi-thread et distribués. Dans les deux approches, nous attachons des contrôleurs locaux aux ordonnanceurs pour obtenir des événements à partir des traces locales. Les événements locaux sont envoyés à un moniteur (observateur global) qui reconstruit l’ensemble des traces globale qui sont i) compatibles avec les traces locales et ii) adéquates pour le monitoring, tout en préservant la concurrence du système
Component-based design is the process leading from given requirements and a set of predefined components to a system meeting the requirements. Components are abstract building blocks encapsulating behavior. They can be composed in order to build composite components. Their composition should be rigorously defined so that it is possible to infer the behavior of composite components from the behavior of their constituents as well as global properties from the properties of individual components. It is, however, generally not possible to ensure or verify the desired property using static verification techniques such as model-checking or static analysis, either because of the state-space explosion problem or because the property can only be decided with information available at runtime (e.g., from the user or the environment). Runtime Verification (RV) is an umbrella term denoting the languages, techniques, and tools for the dynamic verification of system executions against formally-specified behavioral properties. In this context, a run of the system under scrutiny is analyzed using a decision procedure: a monitor. Generally, the monitor may be generated from a user-provided specification (e.g., a temporal-logic formula, an automaton), performs a step-by-step analysis of an execution captured as a sequence of system states, and produces a sequence of verdicts (truth-values taken from a truth-domain) indicating specification satisfaction or violation.This thesis addresses the problem of runtime monitoring multi-threaded and distributed component-based systems with multi-party interactions (CBSs). Although, neither the exact model nor the behavior of the system are known (black box system), the semantic of such CBSs can be modeled with labeled transition systems (LTSs). Inspiring from conformance testing theory, we refer to this as the monitoring hypothesis. Our monitoring hypothesis makes our approach oblivious of (i) the behavior of the CBSs, and (ii) how this behavior is obtained. We consider a general abstract semantic model of CBSs consisting of a set of intrinsically independent components whose interactions are managed by several schedulers. Using such an abstract model, one can obtain systems with different degrees of parallelism, such as sequential, multi-threaded and distributed systems. When monitoring concurrent (multi-threaded and distributed) CBSs, the problem that arises is that a global state of the system is not available at runtime, since the schedulers execute interactions even by knowing the partial state of the system. Moreover, in distributed systems the total ordering of the execution of the interaction is not observable. A naive solution to these problems would be to plug in a monitor which would however force the system to synchronize in order to obtain the sequence of global states as well as the total ordering of the executions at runtime Such a solution would defeat the whole purpose of having concurrent executions and distributed systems. We define two approaches for the monitoring of multi-threaded and distributed CBSs. In both approaches, we instrument the system to retrieve the local events of the schedulers. Local events are sent to an online monitor which reconstructs on-the-fly the set of global traces that are i) compatible with the local traces of the schedulers, and ii) suitable for monitoring purposes, in a concurrency-preserving fashion

Nos últimos anos, a crescente demanda por alto desempenho tem favorecido o surgimento de arquiteturas e algoritmos cada vez mais eficientes. A popularidade das plataformas distribuídas levanta novas questões no desenvolvimento de algoritmos paralelos tais como comunicação, heterogeneidade e dinamismo de recursos. Estas questões podem resultar em aplicações com carga de trabalho conhecida somente em tempo de execução. A irregularidade do algoritmo ou da entrada de dados também pode influenciar na carga de trabalho da aplicação. Uma aplicação paralela pode solucionar estas questões por meio de algoritmos dinâmicos ao utilizar técnicas de programação que definam o trabalho de uma tarefa e possibilitem a utilização de recursos sob demanda. A granularidade, que é a razão entre processamento e comunicação, considera questões práticas de execução e é um fator importante no desempenho de algoritmos dinâmicos. A implementação de um controle de granularidade é complicada e depende do suporte dos ambientes de programação. Porém, os ambientes de programação possuem interfaces extensas e complicadas que dificultam sua utilização em PAD. Este trabalho propõe a implementação de uma biblioteca (libSpawn) que incorpora um controle de granularidade em aplicações MPI dinâmicas. A biblioteca controla a granularidade ao mapear tarefas entre processos ou threads de acordo com três parâmetros: cores da arquitetura, carga e recursos de sistema. Os tempos obtidos com processos e libSpawn demonstram ganhos significativos em benchmarks sintéticos utilizados por outros ambientes de programação. Não obstante, constata-se carências na implementação atual que produzem tempos anômalos, ainda que estes sejam insignificantes em relação aos tempos com processos.
In the last years, the demand for high performance enables the emergence of more efficient computing platforms and algorithms. The increase of distributed computing platforms rises new challenges for parallel algorithm development like communication, heterogeneity, and resource management. These factors can result in applications whose work load is unknown until runtime. An irregular behavior from algorithm or data can also affect the work load. A parallel application can solve these questions through a programming technique which predicts the work load of a task and offers resource on demand. The granularity, which is the ratio of computation to communication, considers more practical issues, and is an important factor in performance of dynamic algorithms. However, this control is difficult to be designed and the support of a programming tool is needed. Yet, the programming tools have extensive and complicated interfaces which difficult your usage in HPC. This work implements a library (libSpawn) which adds a granularity control on MPI dynamic programs. The library controls the granularity by mapping tasks between processes or threads with three parameters: cores of architecture, load and resources of the operating system. The results obtained between processes and libSpawn show significant gains on synthetic benchmarks from other programming tools.

In this dissertation, we consider the problem of scheduling and synchronization of distributable real-time threads --- Real-Time CORBA's first-class abstraction for programming real-time, multi-node sequential behaviors. Distributable real-time threads can be scheduled, broadly, using two paradigms: node independent scheduling, in which nodes independently construct thread schedules, based on node-level decomposition of distributable thread (or DT) scheduling parameters, and collaborative scheduling, in which nodes collaborate to construct system-wide thread schedules, which may or may not involve scheduling parameter decomposition. While significant literature exists on node independent scheduling, little is known about collaborative scheduling and its concomitant tradeoffs. We design three collaborative scheduling algorithms, called ACUA, QBUA, and DQBUA. ACUA uses theory of consensus and QBUA uses theory of quorums for distributable thread schedule construction. DQBUA extends QBUA with lock-based, local and distributed concurrency control. The algorithms consider a model where distributable threads arrive arbitrarily, have time/utility function time constraints, access resources in an arbitrary way (e.g., arbitrary lock acquire/release order, arbitrary nestings), and are subject to arbitrary node crash failures and message losses. We analytically establish several properties of the algorithms including probabilistic end-to-end termination time satisfactions, timeliness optimality during underloads, bounded exception handling time, and correctness of the algorithms in partially synchronous systems. We implement distributable real-time threads in the Linux kernel as a first-class programming and scheduling abstraction. The resulting kernel, called ChronOS, provides application interfaces for creating and manipulating distributable threads, as well as kernel interfaces and mechanisms for scheduling them (using both independent and collaborative approaches). ChronOS also has failure detector mechanisms for detecting and recovering from distributable thread failures. We implement the proposed scheduling algorithms and their competitors in ChronOS and compare their behavior. Our studies reveal that the collaborative scheduling algorithms are superior to independent scheduling algorithms for certain thread sets, in particular, when thread sections have significantly varying execution time. This variability, especially if the variability is not consistent among the threads, may cause each node to make conflicting decisions in the absence of global information. We observe that collaborative schedulers outperform independent schedulers (e.g., EDF augmented with PIP) in terms of accrued utility by as much as 75%. We identify distributed dependencies as one of the major sources of overhead in collaborative scheduling. In particular, the cost of distributed lock-based concurrency control (e.g., lock management, distributed deadlock detection/resolution) can significantly reduce the problem space for which collaborative scheduling is beneficial. To mitigate this, we consider the use of software transactional memory (or STM), an optimistic, non-blocking synchronization alternative to lock-based concurrency control which has been extensively studied in non real-time contexts. We consider distributable real-time threads with STM concurrency control, and develop techniques for analyzing and bounding their end-to-end response times on distributed single-processor and distributed multiprocessor systems. We also develop contention management techniques, a key component of STM, which are driven by threads' real-time scheduling parameters, and establish their tradeoffs against non-real-time contention managers.
Ph. D.

Tendon injuries constitute significant clinical problems ascribable both to the limit natural healing capacity of this tissue and to the inefficiency of the current repair treatments. Tendon tissue engineering (TTE) represents an alternative approach that, through highly multidisciplinary strategies and techniques, aims to promote the generation of adequate tissue engineered tendons. Particularly, the development of biomimetic and micro-engineered hydrogels has been broadly investigated as a potential strategy, due to their ability to provide physiological support for cells mimicking the cellular instructive microenvironment. Based on this concept, herein, it is explored the use of platelet lysate (PL) to create a hydrogel layer as a depot of therapeutic factors to induce tenogenic differentiation of encapsulated human adipose-derived stem cells (hASCs). Thus, commercially available silk suture threads were first immersed into a thrombin/calcium chloride (CaCl2) solution and then incubated in PL, containing hASCs, to allow the hydrogel formation. Interestingly, cells were found viable and able to sense the presence of chemotactic factors, being aligned within and at the surface of the thread core. Furthermore, the presence of an ordered newly synthesized extracellular matrix (ECM) together with the expression of tendon-related markers demonstrate the potential use of this method for the generation of a tendon-specific microenvironment. Finally, the impressive silk sutures mechanical properties discovered, suggest the perspective clinical applications of these constructs to bridge injured tendons or as starting blocks in the development of more complex constructs for tendon repair approaches.

Sustainability has become a buzz word of our time, although our developed world community is still coming to terms with what the word really means. Universities and polytechnics in Aotearoa New Zealand will have to change in many ways before sustainability can be considered to occupy a meaningful place in the tertiary education sector. However the change process that sees an organisation moving towards sustainability is complex, and agency for change can be considered on many different levels including the individual identities of staff and students, the identity of managers, and the programme and wider organisational identities constructed by the communities that comprise them. This qualitative research explores education for sustainability within the context of outdoor education using the Bachelor of Adventure Recreation and Outdoor Education (BRecEd) at the Christchurch Polytechnic Institute of Technology (CPIT) (the programme into which the author teaches) as a case study. Participatory action research forms the overarching methodology for a multiple method approach to data collection. The research leans heavily on the lived experiences of staff and students within the programme, is woven with my own reflections, and incorporates many examples of students’ work. The weaving together of these experiences grounds the research and helps bring theory to life. The research reveals the complexity of change towards more sustainable ways of practising outdoor education in an organisational setting. It explores the tensions that are encountered and mechanisms that have allowed for staff and students to engage in education for sustainability in a more meaningful way. The key themes of the research explore the intersection of identity construction processes and change agency, and it is argued these processes are inseparable for those concerned with organisational change towards sustainability.

This thesis is an ethnographic study of ethical concepts and practices among contemporary Muslim textile traders and entrepreneurs in Aleppo, Syria. It draws on Lambek's perspective that ethics is 'ordinary': an inherent and pervasive aspect of exchange transactions, such as visits, hospitality, retail transactions and the negotiations leading up to them. Three ethnographic settings are explored - a textile factory in the north of Aleppo; a wholesale yarn market in the centre of Aleppo's old city markets that is also the site for speculative futures-trading; and a retail fabric shop where young salesmen are employed to get the best price they can from their mainly female customers. The moral processes, concepts and accomplishments that emerge in these different settings include affection and generosity; intention and pure-heartedness; substance and trustworthiness; autonomy, dignity and worth; and obligation and moral reasoning. The thesis describes the different ways that exchanges mediate these processes. This thesis approaches ethics as a function of life lived with others: an aspect of how one should be involved with others, and how one should manage, limit, extend and orient oneself in that involvement. One theme that emerges is how the relationship between autonomy and generosity is managed in these settings, by actors with differential access to resources. Another is what 'sincerity' means: is virtue simply a question of mastering the protocols that govern these exchanges, or is it a matter of the heart? How can social actors tell the difference? Why and when does it matter to them to be able to do so? This thesis also explores the connections between power relationships and ethical practice, arguing that ethics can never be isolated from power, but nor can it be collapsed into it. Moral accomplishments such as generosity, sincerity or affection can be ways of making and organising claims to social status and capital, and of course depend on these things too. However, they also define types of sociality – such as 'intimacy' and 'continuity' - that are seen as having intrinsic worth.

Thesis (M.S. in Computer Science)--Naval Postgraduate School, September 2009.
Thesis Advisor(s): Martell, Craig H. "September 2009." Description based on title screen as viewed on November 9, 2009. Includes bibliographical references (p. 77). Also available in print.

Dissertação (mestrado) - Universidade Federal de Santa Catarina, Centro Tecnológico, Programa de Pós-Graduação em Ciência da Computação, Florianópolis, 2012
Made available in DSpace on 2013-06-26T00:23:57Z (GMT). No. of bitstreams: 1 313320.pdf: 1007920 bytes, checksum: f8e570328bd5e12fe09d459b960a781a (MD5)
Mecanismos de previsão de perda de deadlines são importantes para sistemas de tempo real na medida em que possibilitam otimizar seu desempenho através de ações preventivas ou corretivas. Este trabalho apresenta uma implementação do mecanismo de previsão ASQ (Aperiodic Server Queue) proposto em (PLENTZ, 2008) usando o Java RTS, uma implementação da Real-Time Specification for Java (RTSJ). O objetivo geral é fazer uma análise qualitativa desta implementação com a descrita na referência citada, a qual utiliza a linguagem Java convencional. Para tanto, utiliza-se o mesmo modelo de tarefas proposto em (PLENTZ, 2008) que é composto por tarefas periódicas locais e aperiódicas distribuídas. Este último tipo de tarefa segue o conceito de Threads distribuídas, uma abstração que estende o modelo de threads locais, existentes em sistemas computacionais. Simulações realizadas mostram que o desempenho da implementação desenvolvida neste trabalho não apresenta uma diferença substancial em relação a versão de (PLENTZ, 2008), isto é, o número de previsões corretas e as taxas de erros de ambas as implementações ficam bem próximas com uma pequena tendência de melhora nesta versão aqui apresentada. Além disso, este trabalho apresenta uma implementação bem mais próxima de um sistema de tempo real, distanciando-se de uma simulação, na medida em que utiliza uma linguagem de programação apropriada para o desenvolvimento deste tipo de sistema.

Abstract : Deadline Missing Prediction Mechanisms provide an adequate strategy to improve the system behavior by allowing the anticipation of decisions about necessary measures to improve system performance. This work presents an implementation of ASQ (Aperiodic Server Queue) Prediction Mechanisms proposed by (PLENTZ, 2008) using Java RTS, which is a Real-Time Specification for Java (RTSJ) implementation. The main objective is to analyse qualitatively this implementation in comparison to other described in (PLENTZ, 2008) that was implemented using the conventional Java language. To achieve this objective the same task model described in (PLENTZ, 2008) is used, the task model consists of local periodic tasks and distributed aperiodic taks. The distributed aperiodic model use the Distributed Threads concept which is an abstration that extends the local thread model used in computing systems. Simulations performed in this work shows similar results between this implementations and the one implemented by (PLENTZ, 2008), it means that the number of correct predictions and error rate of both implementations are very close with a small tendency of improvement in this version presented here. Moreover, the work presents an implementation much closer to a realtime system than a simulation is, because utilizes a programming language suitable for the development of real time systems.

A number of approaches and methods are being used to assess higher cognition within online threaded discussions, as evidenced by the corpus of scholarship. However, a review of the literature suggests that current strategies relating to asynchronous discourse have tended to focus on cognitive processes that are mostly driven by task-oriented communication, thereby failing to assess the quality of interactions that engender meaning-making and knowledge creation. The first goal of this study was to decompose and interpret examples of threaded conversation exhibiting lexical attributes of higher cognition. The second goal was to identify instances of critical thinking and indicators of deep learning contributing to meaningful reflection within diachronic encounters to develop more effective higher-order thinking strategies within discussions. Discourse analysis theory in conjunction with Garrison's stages of critical thinking was used to examine meaning-making within contexts of social interaction. Archival discussion data were examined from 39 participants derived from 2 online undergraduate courses at a small private university in the southeastern United States. The content analysis qualitative design applied computer-mediated discourse analysis (CMDA) to analyze and classify statements in discussion transcripts according to Garrison's stages of critical thinking. Results indicated a pattern of utterances suggesting in-depth learning, with a smaller sample of stanzas indicating surface-level processing. Results of this study can be used by teachers and course designers to create positive change by purposefully engendering critical reflection, thereby preparing learners for the work of the future necessitating well thought-out approaches to grapple with new problems and situations in new ways.

Thesis (M.S.)--Missouri University of Science and Technology, 2009.
Vita. The entire thesis text is included in file. Title from title screen of thesis/dissertation PDF file (viewed November 23, 2009) Includes bibliographical references (p. 52).

In this arts-based study, I will discuss using craft techniques such as crazy quilting in the creative process of making art. The paper describes the history of crazy quilts, a brief summary of artists who use quilts as a medium, and a description of how teaching craft-making skills in the classroom can encourage students to use them for art-making.

PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO
COORDENAÇÃO DE APERFEIÇOAMENTO DO PESSOAL DE ENSINO SUPERIOR
PROGRAMA DE SUPORTE À PÓS-GRADUAÇÃO DE INSTS. DE ENSINO
PROGRAMA DE SUPORTE À PÓS-GRADUAÇÃO DE INSTITUIÇÕES COMUNITÁRIAS DE ENSINO PARTICULARES
A tese Tramas teóricas e ficcionais na escrita auto(r)biográfica investiga criticamente textos autobiográficos contemporâneos e formas e modelos de sua construção teórica a partir da hipótese de se tratar de discursos inseparáveis marcados por constantes processos de retroalimentação. Neste horizonte é problematizado o estatuto híbrido da escrita autobiográfica situada nos interstícios do factual e do ficcional, contestando a ilusão referencial fundada em modelos dicotômicos excludentes. É questionado, igualmente, o estatuto do autor enquanto sujeito autônomo, integrado, autoconsciente e relativizada a reivindicação de autenticidade e verdade de seus enunciados a favor de uma configuração complexa e cambiante de seus modos de expressão identitária em circuitos comunicativos circunstanciais, marcados por alternâncias, intercâmbios e fusões das distintas instâncias autorais e pela sobreposição com a figura do narrador. O processo de autorreflexão e de autoencenação proposto é entendido como performance de um autor compósito – entre outros, orientando, jornalista, ensaísta, contista, escritor de ficção, professor, pesquisador, candidato ao título de doutor – que constrói uma identidade oscilante no encontro com múltiplos outros. Em consonância com um cenário de reflexão teórica não transparente e dispersa e em diálogo com produções literárias contemporâneas classificadas de inespecíficas – construídas pela articulação de metarreflexões, correios eletrônicos, sonhos e pesadelos, ensaios, fragmentos teóricos, desenhos, imagens, fotografias, citações intertextuais, referências autobiográficas, contos, crônicas e textos literários –, a tese comprova as suas hipóteses no experimento de uma escrita criativa, radicalizando os processos interativos de reciprocidade entre produção literária e construção teórica, ficcionalidade e factualidade, sujeito e objeto, autenticidade e encenação neste work in progress. Em sintonia com a expansão do campo literário, opta-se por uma perspectiva investigativa transdisciplinar e, no espaço da própria configuração textual, ensaia-se uma escrita de sintaxe não linear, interrompida, entrecortada, duplicada, invertida, marcada por reticências e sem ponto final. O texto sinaliza a ambivalência do lugar do discurso através de formas de circulação e recepção, da alternância do narrador autodiegético para o narrador heterodiegético e, também, por meio de um pacto autobiográfico ambíguo, que se desdiz ao longo do texto. Essas dinâmicas ambivalentes oferecem ao leitor possibilidades de escolha. A partir de uma perspectiva epistemológica construtivista e da adoção de uma linguagem metanarrativa, a tese concentra-se em processos: tanto no de escrita quanto no da própria pesquisa, configurando-se, assim, como uma observação de segunda ordem. Neste âmbito, ela se oferece como contribuição significativa para uma discussão atualizada acerca da escrita autobiográfica no espaço disciplinar dos estudos literários que, por seu lado, se caracterizam como permanente work in progress.
The dissertation Theoretical and fictional threads in aut(h)o(r)biographical writing investigates critically contemporary autobiographical texts and forms and models of their theoretical construction from the hypothesis of being inseparable discourses marked by constant feedback processes. In this context the hybrid statute of autobiographical writing located in the interstices of the factual and the fictional is put in doubt, challenging the referential illusion based on excluding dichotomous models. It is also questioned the status of the author as an autonomous subject, integrated, self-conscious and relativized the claim of authenticity and truth of their statements in favor of a complex and changing configuration of their modes of expression of identity in circumstantial communicative circuits, marked by alternations, exchanges and fusion of the different authorial instances and by the superposition with the figure of the narrator. The process of self-reflection and self-enacting is understood as the performance of a composite author – among others, advisee, journalist, essayist, short story writer, teacher, researcher, candidate for doctoral title – who builds an oscillating identity in the encounter with multiple others. Consistent with a non-transparent and dispersed theoretical reflection scenario and in dialogue with contemporary literary productions classified as nonspecific - constructed by the articulation of metareflections, e-mail, dreams and nightmares, essays, theoretical fragments, drawings, images, photographs, intertextual quotations, autobiographical references, short stories, chronicles and literary texts - the thesis proves its hypothesis in the experiment of a creative writing radicalizing the interactive processes of reciprocity between literary production and theoretical construction, fictionality and factuality, subject and object, authenticity and staging in this work in progress. In line with the expansion of the literary field, a transdisciplinary research perspective is chosen and, in the space of the textual configuration itself, a non-linear, interrupted, duplicated, inverted syntax writing marked by suspension points and no period. The text signals the ambivalence of the place of discourse through forms of circulation and reception, from the alternation of the autodiegetic narrator to the heterodiegetic narrator, and also by means of an ambiguous autobiographical pact, which is discouraged throughout the text. These ambivalent dynamics offer the reader possibilities of choice. From a constructivist epistemological perspective and the adoption of a metanarrative language, the thesis focuses on processes: both in writing and in research itself, thus becoming a second order observation. In this context, it offers itself as a significant contribution to an up-to-date discussion of autobiographical writing in the disciplinary space of literary studies which, in turn, are characterized as permanent work in progress.