2 resultados para Slave insurrections

em RUN (Repositório da Universidade Nova de Lisboa) - FCT (Faculdade de Cienecias e Technologia), Universidade Nova de Lisboa (UNL), Portugal


Relevância:

10.00% 10.00%

Publicador:

Resumo:

Based on bibliographical research and the analysis of court rulings, this study investigates the characterization of slave-like labor by Brazilian courts. After the alteration of article 149 of the Brazilian Penal Code, introduced by Law nº 10.803/2003, which typifies the practice of contemporary slavery in Brazil, divergent characterizations of this practice remain. The courts currently employ the broadest concept of contemporary slave labor, in which the crime is characterized by the engagement in one of the following conducts established as a criminal offense: labor with the restriction of freedom, submission to exhaustive working conditions, degrading working conditions, and debt bondage. The engagement in one of the above is therefore enough to constitute a crime. Contemporary slave labor in Brazil is not characterized only by the restriction of the worker’s freedom, as in the case of forced labor or debt bondage, but also through the submission of the workers to situations that offend their human dignity. Individual freedom and the dignity of the human person, fundamental tenets of the Brazilian Federal Constitution, are juridical resources safeguarded by law. Contemporary slavery is not limited to the mere infringement of labor laws, but represents a severe violation of the human rights of the workers involved.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Current computer systems have evolved from featuring only a single processing unit and limited RAM, in the order of kilobytes or few megabytes, to include several multicore processors, o↵ering in the order of several tens of concurrent execution contexts, and have main memory in the order of several tens to hundreds of gigabytes. This allows to keep all data of many applications in the main memory, leading to the development of inmemory databases. Compared to disk-backed databases, in-memory databases (IMDBs) are expected to provide better performance by incurring in less I/O overhead. In this dissertation, we present a scalability study of two general purpose IMDBs on multicore systems. The results show that current general purpose IMDBs do not scale on multicores, due to contention among threads running concurrent transactions. In this work, we explore di↵erent direction to overcome the scalability issues of IMDBs in multicores, while enforcing strong isolation semantics. First, we present a solution that requires no modification to either database systems or to the applications, called MacroDB. MacroDB replicates the database among several engines, using a master-slave replication scheme, where update transactions execute on the master, while read-only transactions execute on slaves. This reduces contention, allowing MacroDB to o↵er scalable performance under read-only workloads, while updateintensive workloads su↵er from performance loss, when compared to the standalone engine. Second, we delve into the database engine and identify the concurrency control mechanism used by the storage sub-component as a scalability bottleneck. We then propose a new locking scheme that allows the removal of such mechanisms from the storage sub-component. This modification o↵ers performance improvement under all workloads, when compared to the standalone engine, while scalability is limited to read-only workloads. Next we addressed the scalability limitations for update-intensive workloads, and propose the reduction of locking granularity from the table level to the attribute level. This further improved performance for intensive and moderate update workloads, at a slight cost for read-only workloads. Scalability is limited to intensive-read and read-only workloads. Finally, we investigate the impact applications have on the performance of database systems, by studying how operation order inside transactions influences the database performance. We then propose a Read before Write (RbW) interaction pattern, under which transaction perform all read operations before executing write operations. The RbW pattern allowed TPC-C to achieve scalable performance on our modified engine for all workloads. Additionally, the RbW pattern allowed our modified engine to achieve scalable performance on multicores, almost up to the total number of cores, while enforcing strong isolation.