Intra-type migrative scheduling of implicit-deadline sporadic tasks on two- type heterogeneous multiprocessor

Consider the problem of scheduling a set of implicit-deadline sporadic tasks to meet all deadlines on a two-type heterogeneous multiprocessor platform. Each processor is either of type-1 or type-2 with each task having different execution time on each processor type. Jobs can migrate between processors of same type (referred to as intra-type migration) but cannot migrate between processors of different types. We present a new scheduling algorithm namely, LP-Relax(THR) which offers a guarantee that if a task set can be scheduled to meet deadlines by an optimal task assignment scheme that allows intra-type migration then LP-Relax(THR) meets deadlines as well with intra-type migration if given processors 1/THR as fast (referred to as speed competitive ratio) where THR <= 2/3.

Eastwards / westwards: which direction for gender studies in the 21st century?

Eastwards / Westwards: Which Direction for Gender Studies in the XXIst Century? is a collection of essays which focus on themes and methods that characterize current research into gender in Asian countries in general. In this collection, ideas derived from Gender Studies elsewhere in the world have been subjected to scrutiny for their utility in helping to describe and understand regional phenomena. But the concepts of Local and Global – with their discoursive productions – have not functioned as a binary opposition: localism and globalism are mutually constitutive and researchers have interrogated those spaces of interaction between the ‘self’ and the ‘other’, bearing in mind their own embeddedness in social and cultural structures and their own historical memory. Contributors to this collection provided a critical transnational perspective on some of the complex effects of the dynamics of cultural globalization, by exploring the relation between gender and development, language, historiography, education and culture. We have also given attention to the ideological and rhetorical processes through which gender identity is constructed, by comparing textual grids and patterns of expectation. Likewise, we have discussed the role of ethnography, anthropology, historiography, sociology, fiction, popular culture and colonial and post-colonial sources in (re)inventing old/new male/female identities, their conversion into concepts and circulation through time and space. This multicultural and trans-disciplinary selection of essays is totally written in English, fully edited and revised, therefore, it has a good potential for an immediate international circulation. This project may trace new paths and issues for discussion on what concerns the life, practices and narratives by and about women in Asia, as well as elsewhere in the present day global experience. Academic readership: Researchers, scholars, educators, graduate and post-graduate students, doctoral students and general non-fiction readers, with a special interest in Gender Studies, Asia, Colonial and Post-Colonial Literature, Anthropology, Cultural Studies, History, Historiography, Politics, Race, Feminism, Language, Linguistics, Power, Political and Feminist Agendas, Popular Culture, Education, Women’s Writing, Religion, Multiculturalism, Globalisation, Migration. Chapter summary: 1. “Social Gender Stereotypes and their Implication in Hindi”, Anjali Pande, Jawaharlal Nehru University, New Delhi, India. This essay looks at the subtle ways in which gender identities are constructed and reinforced in India through social norms of language use. Language itself becomes a medium for perpetuating gender stereotypes, forcing its speakers to confirm to socially defined gender roles. Using examples from a classroom discussion about a film, this essay will highlight the underlying rigid male-female stereotypes in Indian society with their more obvious expressions in language. For the urban woman in India globalisation meant increased economic equality and exposure to changed lifestyles. On an individual level it also meant redefining gender relations and changing the hierarchy in man-­woman relationships. With the economic independence there is a heightened sense of liberation in all spheres of social life, a confidence to fuzz the rigid boundaries of gender roles. With the new films and media celebrating this liberated woman, who is ready to assert her sexual needs, who is ready to explode those long held notions of morality, one would expect that the changes are not just superficial. But as it soon became obvious in the course of a classroom discussion about relationships and stereotypes related to age, the surface changes can not become part of the common vocabulary, for the obvious reason that there is still a vast gap between the screen image of this new woman and the ground reality. Social considerations define the limits of this assertiveness of women, whereas men are happy to be liberal within the larger frame of social sanctions. The educated urban woman in India speaks in favour of change and the educated urban male supports her, but one just needs to scratch the surface to see the time tested formulae of gender roles firmly in place. The way the urban woman happily balances this emerging promise of independence with her gendered social identity, makes it necessary to rethink some aspects of looking at gender in a gradually changing, traditional society like India. 2. “The Linguistic Dimension of Gender Equality”, Alissa Tolstokorova, Kiev Centre for Gender Information and Education, Ukraine. The subject-matter of this essay is gender justice in language which, as I argue, may be achieved through the development of a gender-related approach to linguistic human rights. The last decades of the 20th century, globally marked by a “gender shift” in attitudes to language policy, gave impetus to the social movement for promoting linguistic gender equality. It was initiated in Western Europe and nowadays is moving eastwards, as ideas of gender democracy progress into developing countries. But, while in western societies gender discrimination through language, or linguistic sexism, was an issue of concern for over three decades, in developing countries efforts to promote gender justice in language are only in their infancy. My argument is that to promote gender justice in language internationally it is necessary to acknowledge the rights of women and men to equal representation of their gender in language and speech and, therefore, raise a question of linguistic rights of the sexes. My understanding is that the adoption of the Universal Declaration of Linguistic Rights in 1996 provided this opportunity to address the problem of gender justice in language as a human rights issue, specifically as a gender dimension of linguistic human rights. 3. “The Rebirth of an Old Language: Issues of Gender Equality in Kazakhstan”, Maria Helena Guimarães, Polytechnic Institute of Porto, Portugal. The existing language situation in Kazakhstan, while peaceful, is not without some tension. We propose to analyze here some questions we consider relevant in the frame of cultural globalization and gender equality, such as: free from Russian imperialism, could Kazakhstan become an easy prey of Turkey’s “imperialist dream”? Could these traditionally Muslim people be soon facing the end of religious tolerance and gender equality, becoming this new old language an easy instrument for the infiltration in the country of fundamentalism (it has already crossed the boarders of Uzbekistan), leading to a gradual deterioration of its rich multicultural relations? The present structure of the language is still very fragile: there are three main dialects and many academics defend the re-introduction of the Latin alphabet, thus enlarging the possibility of cultural “contamination” by making the transmission of fundamentalist ideas still easier through neighbour countries like Azerbaijan, Uzbekistan and Turkmenistan (their languages belong to the same sub-group of Common Turkic), where the Latin alphabet is already in use, and where the ground for such ideas shown itself very fruitful. 4. “Construction of Womanhood in the Bengali Language of Bangladesh”, Raasheed Mahmood; University of New South Wales, Sydney. The present essay attempts to explore the role of gender-based language differences and of certain markers that reveal the status accorded to women in Bangladesh. Discrimination against women, in its various forms, is endemic in communities and countries around the world, cutting across class, race, age, and religious and national boundaries. One cannot understand the problems of gender discrimination solely by referring to the relationship of power or authority between men and women. Rather one needs to consider the problem by relating it to the specific social formation in which the image of masculinity and femininity is constructed and reconstructed. Following such line of reasoning this essay will examine the nature of gender bias in the Bengali language of Bangladesh, holding the conviction that as a product of social reality language reflects the socio-cultural behaviour of the community who speaks it. This essay will also attempt to shed some light on the processes through which gender based language differences produce actual consequences for women, who become exposed to low self-esteem, depression and systematic exclusion from public discourse. 5. “Marriage in China as an expression of a changing society”, Elisabetta Rosado David, University of Porto, Portugal, and Università Ca’Foscari, Venezia, Italy. In 29 April 2001, the new Marriage Law was promulgated in China. The first law on marriage was proclaimed in 1950 with the objective of freeing women from the feudal matrimonial system. With the second law, in 1981, values and conditions that had been distorted by the Cultural Revolution were recovered. Twenty years later, a new reform was started, intending to update marriage in the view of the social and cultural changes that occurred with Deng Xiaoping’s “open policy”. But the legal reform is only the starting point for this case-study. The rituals that are followed in the wedding ceremony are often hard to understand and very difficult to standardize, especially because China is a vast country, densely populated and characterized by several ethnic minorities. Two key words emerge from this issue: syncretism and continuity. On this basis, we can understand tradition in a better way, and analyse whether or not marriage, as every social manifestation, has evolved in harmony with Chinese culture. 6. “The Other Woman in the Portuguese Colonial Empire: The Case of Portuguese India”, Maria de Deus Manso, University of Évora, Portugal. This essay researches the social, cultural and symbolic history of local women in the Portuguese Indian colonial enclaves. The normative Portuguese overseas history has not paid any attention to the “indigenous” female populations in colonial Portuguese territories, albeit the large social importance of these social segments largely used in matrimonial and even catholic missionary strategies. The first attempt to open fresh windows in the history of this new field was the publication of Charles Boxer’s referential study about Women in lberian Overseas Expansion, edited in Portugal only after the Revolution of 1975. After this research we can only quote some other fragmentary efforts. In fact, research about the social, cultural, religious, political and symbolic situation of women in the Portuguese colonial territories, from the XVI to the XX century, is still a minor historiographic field. In this essay we discuss this problem and we study colonial representations of women in the Portuguese Indian enclaves, mainly in the territory of Goa, using case studies methodologies. 7. “Heading East this Time: Critical Readings on Gender in Southeast Asia”, Clara Sarmento, Polytechnic Institute of Porto, Portugal. This essay intends to discuss some critical readings of fictional and theoretical texts on gender condition in Southeast Asian countries. Nowadays, many texts about women in Southeast Asia apply concepts of power in unusual areas. Traditional forms of gender hegemony have been replaced by other powerful, if somewhat more covert, forms. We will discuss some universal values concerning conventional female roles as well as the strategies used to recognize women in political fields traditionally characterized by male dominance. Female empowerment will mean different things at different times in history, as a result of culture, local geography and individual circumstances. Empowerment needs to be perceived as an individual attitude, but it also has to be facilitated at the macro­level by society and the State. Gender is very much at the heart of all these dynamics, strongly related to specificities of historical, cultural, ethnic and class situatedness, requiring an interdisciplinary transnational approach.

Numerical experiments with a modified regularization scheme for mathematical programs with complementarity constraints

On this paper we present a modified regularization scheme for Mathematical Programs with Complementarity Constraints. In the regularized formulations the complementarity condition is replaced by a constraint involving a positive parameter that can be decreased to zero. In our approach both the complementarity condition and the nonnegativity constraints are relaxed. An iterative algorithm is implemented in MATLAB language and a set of AMPL problems from MacMPEC database were tested.

The cross crypto scheme cipher integration for securing SCADA component communication

Critical Infrastructures became more vulnerable to attacks from adversaries as SCADA systems become connected to the Internet. The open standards for SCADA Communications make it very easy for attackers to gain in-depth knowledge about the working and operations of SCADA networks. A number of Intenrnet SCADA security issues were raised that have compromised the authenticity, confidentiality, integrity and non-repudiation of information transfer between SCADA Components. This paper presents an integration of the Cross Crypto Scheme Cipher to secure communications for SCADA components. The proposed scheme integrates both the best features of symmetric and asymmetric encryptiontechniques. It also utilizes the MD5 hashing algorithm to ensure the integrity of information being transmitted.

A PTAS for assigning sporadic tasks on two-type heterogeneous multiprocessors

Consider the problem of determining a task-toprocessor assignment for a given collection of implicit-deadline sporadic tasks upon a multiprocessor platform in which there are two distinct kinds of processors. We propose a polynomialtime approximation scheme (PTAS) for this problem. It offers the following guarantee: for a given task set and a given platform, if there exists a feasible task-to-processor assignment, then given an input parameter, ϵ, our PTAS succeeds, in polynomial time, in finding such a feasible task-to-processor assignment on a platform in which each processor is 1+3ϵ times faster. In the simulations, our PTAS outperforms the state-of-the-art PTAS [1] and also for the vast majority of task sets, it requires significantly smaller processor speedup than (its upper bound of) 1+3ϵ for successfully determining a feasible task-to-processor assignment.

LNT: a logical neighbor tree secure group communication scheme for wireless sensor networks

Secure group communication is a paradigm that primarily designates one-to-many communication security. The proposed works relevant to secure group communication have predominantly considered the whole network as being a single group managed by a central powerful node capable of supporting heavy communication, computation and storage cost. However, a typical Wireless Sensor Network (WSN) may contain several groups, and each one is maintained by a sensor node (the group controller) with constrained resources. Moreover, the previously proposed schemes require a multicast routing support to deliver the rekeying messages. Nevertheless, multicast routing can incur heavy storage and communication overheads in the case of a wireless sensor network. Due to these two major limitations, we have reckoned it necessary to propose a new secure group communication with a lightweight rekeying process. Our proposal overcomes the two limitations mentioned above, and can be applied to a homogeneous WSN with resource-constrained nodes with no need for a multicast routing support. Actually, the analysis and simulation results have clearly demonstrated that our scheme outperforms the previous well-known solutions.

Preemption-light multiprocessor scheduling of sporadic tasks with high utilisation bound

Known algorithms capable of scheduling implicit-deadline sporadic tasks over identical processors at up to 100% utilisation invariably involve numerous preemptions and migrations. To the challenge of devising a scheduling scheme with as few preemptions and migrations as possible, for a given guaranteed utilisation bound, we respond with the algorithm NPS-F. It is configurable with a parameter, trading off guaranteed schedulable utilisation (up to 100%) vs preemptions. For any possible configuration, NPS-F introduces fewer preemptions than any other known algorithm matching its utilisation bound. A clustered variant of the algorithm, for systems made of multicore chips, eliminates (costly) off-chip task migrations, by dividing processors into disjoint clusters, formed by cores on the same chip (with the cluster size being a parameter). Clusters are independently scheduled (each, using non-clustered NPS-F). The utilisation bound is only moderately affected. We also formulate an important extension (applicable to both clustered and non-clustered NPS-F) which optimises the supply of processing time to executing tasks and makes it more granular. This reduces processing capacity requirements for schedulability without increasing preemptions.

Real-time scheduling with resource sharing on uniform multiprocessors

Consider the problem of scheduling a set of implicit-deadline sporadic tasks to meet all deadlines on a uniform multiprocessor platform where each task may access at most one of |R| shared resources and at most once by each job of that task. The resources have to be accessed in a mutually exclusive manner. We propose an algorithm, GIS-vpr, which offers the guarantee that if a task set is schedulable to meet deadlines by an optimal task assignment scheme that allows a task to migrate only when it accesses or releases a resource, then our algorithm also meets the deadlines with the same restriction on the task migration, if given processors 4 + 6|R| times as fast. The proposed algorithm, by design, limits the number of migrations per job to at most two. To the best of our knowledge, this is the first result for resource sharing on uniform multiprocessors with proven performance guarantee.

Provably good scheduling of sporadic tasks with resource sharing on a two-type heterogeneous multiprocessor platform

Consider the problem of scheduling a set of implicit-deadline sporadic tasks to meet all deadlines on a two-type heterogeneous multiprocessor platform where a task may request at most one of |R| shared resources. There are m1 processors of type-1 and m2 processors of type-2. Tasks may migrate only when requesting or releasing resources. We present a new algorithm, FF-3C-vpr, which offers a guarantee that if a task set is schedulable to meet deadlines by an optimal task assignment scheme that only allows tasks to migrate when requesting or releasing a resource, then FF-3Cvpr also meets deadlines if given processors 4+6*ceil(|R|/min(m1,m2)) times as fast. As far as we know, it is the first result for resource sharing on heterogeneous platforms with provable performance.

A conjecture about provably good task assignment on heterogeneous multiprocessor platforms but with a stronger adversary

Consider the problem of scheduling a set of implicit-deadline sporadic tasks to meet all deadlines on a heterogeneous multiprocessor platform. We use an algorithm proposed in [1] (we refer to it as LP-EE) from state-of-the-art for assigning tasks to heterogeneous multiprocessor platform and (re-)prove its performance guarantee but for a stronger adversary.We conjecture that if a task set can be scheduled to meet deadlines on a heterogeneous multiprocessor platform by an optimal task assignment scheme that allows task migrations then LP-EE meets deadlines as well with no migrations if given processors twice as fast. We illustrate this with an example.

Provably good task assignment on heterogeneous multiprocessor platforms for a restricted case but with a stronger adversary

Consider the problem of scheduling a set of implicit-deadline sporadic tasks to meet all deadlines on a heterogeneous multiprocessor platform. We consider a restricted case where the maximum utilization of any task on any processor in the system is no greater than one. We use an algorithm proposed in [1] (we refer to it as LP-EE) from state-of-the-art for assigning tasks to heterogeneous multiprocessor platform and (re-)prove its performance guarantee for this restricted case but for a stronger adversary. We show that if a task set can be scheduled to meet deadlines on a heterogeneous multiprocessor platform by an optimal task assignment scheme that allows task migrations then LP-EE meets deadlines as well with no migrations if given processors twice as fast.

Optimal virtual cluster-based multiprocessor scheduling

Scheduling of constrained deadline sporadic task systems on multiprocessor platforms is an area which has received much attention in the recent past. It is widely believed that finding an optimal scheduler is hard, and therefore most studies have focused on developing algorithms with good processor utilization bounds. These algorithms can be broadly classified into two categories: partitioned scheduling in which tasks are statically assigned to individual processors, and global scheduling in which each task is allowed to execute on any processor in the platform. In this paper we consider a third, more general, approach called cluster-based scheduling. In this approach each task is statically assigned to a processor cluster, tasks in each cluster are globally scheduled among themselves, and clusters in turn are scheduled on the multiprocessor platform. We develop techniques to support such cluster-based scheduling algorithms, and also consider properties that minimize total processor utilization of individual clusters. In the last part of this paper, we develop new virtual cluster-based scheduling algorithms. For implicit deadline sporadic task systems, we develop an optimal scheduling algorithm that is neither Pfair nor ERfair. We also show that the processor utilization bound of us-edf{m/(2m−1)} can be improved by using virtual clustering. Since neither partitioned nor global strategies dominate over the other, cluster-based scheduling is a natural direction for research towards achieving improved processor utilization bounds.

Conjecture about global fixed-priority preemptive multiprocessor scheduling of implicit-deadline sporadic tasks: the utilization bound of SM-US(sqrt(2)-1) is sqrt(2)-1

Consider global fixed-priority preemptive multiprocessor scheduling of implicit-deadline sporadic tasks. I conjecture that the utilization bound of SM-US(√2−1) is √2-1.

An implicit GTS allocation mechanism in IEEE 802.15.4 for time-sensitive wireless sensor networks: theory and practice

Timeliness guarantee is an important feature of the recently standardized IEEE 802.15.4 protocol, turning it quite appealing for Wireless Sensor Network (WSN) applications under timing constraints. When operating in beacon-enabled mode, this protocol allows nodes with real-time requirements to allocate Guaranteed Time Slots (GTS) in the contention-free period. The protocol natively supports explicit GTS allocation, i.e. a node allocates a number of time slots in each superframe for exclusive use. The limitation of this explicit GTS allocation is that GTS resources may quickly disappear, since a maximum of seven GTSs can be allocated in each superframe, preventing other nodes to benefit from guaranteed service. Moreover, the GTS may be underutilized, resulting in wasted bandwidth. To overcome these limitations, this paper proposes i-GAME, an implicit GTS Allocation Mechanism in beacon-enabled IEEE 802.15.4 networks. The allocation is based on implicit GTS allocation requests, taking into account the traffic specifications and the delay requirements of the flows. The i-GAME approach enables the use of one GTS by multiple nodes, still guaranteeing that all their (delay, bandwidth) requirements are satisfied. For that purpose, we propose an admission control algorithm that enables to decide whether to accept a new GTS allocation request or not, based not only on the remaining time slots, but also on the traffic specifications of the flows, their delay requirements and the available bandwidth resources. We show that our approach improves the bandwidth utilization as compared to the native explicit allocation mechanism defined in the IEEE 802.15.4 standard. We also present some practical considerations for the implementation of i-GAME, ensuring backward compatibility with the IEEE 801.5.4 standard with only minor add-ons. Finally, an experimental evaluation on a real system that validates our theoretical analysis and demonstrates the implementation of i-GAME is also presented

The utilization bound of uniprocessor preemptive slack-monotonic scheduling is 50%

Consider the problem of scheduling a set of sporadically arriving implicit-deadline tasks to meet deadlines on a uniprocessor. Static-priority scheduling is considered using the slack-monotonic priority-assignment scheme. We prove that its utilization bound is 50%.