Log in

Relevant bibliographies by topics / Resource contention / Journal articles

To see the other types of publications on this topic, follow the link: Resource contention.

Journal articles on the topic 'Resource contention'

Author: Grafiati

Published: 4 June 2021

Last updated: 9 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Resource contention.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Sheikhalishahi, Mehdi, Lucio Grandinetti, Richard M. Wallace, and Jose Luis Vazquez-Poletti. "Autonomic resource contention-aware scheduling." Software: Practice and Experience 45, no. 2 (2013): 161–75. http://dx.doi.org/10.1002/spe.2223.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Mukherjee, Joydeep, Diwakar Krishnamurthy, and Jerry Rolia. "Resource Contention Detection in Virtualized Environments." IEEE Transactions on Network and Service Management 12, no. 2 (2015): 217–31. http://dx.doi.org/10.1109/tnsm.2015.2407273.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Kirsal, Yonal, Vishnu Vardhan Paranthaman, and Glenford Mapp. "Exploring Analytical Models for Proactive Resource Management in Highly Mobile Environments." International Journal of Computers Communications & Control 13, no. 5 (2018): 837–52. http://dx.doi.org/10.15837/ijccc.2018.5.3349.

Full text

Abstract:

In order to provide ubiquitous communication, seamless connectivity is now required in all environments including highly mobile networks. By using vertical handover techniques it is possible to provide uninterrupted communication as connections are dynamically switched between wireless networks as users move around. However, in a highly mobile environment, traditional reactive approaches to handover are inadequate. Therefore, proactive handover techniques, in which mobile nodes attempt to determine the best time and place to handover to local networks, are actively being investigated in the context of next-generation mobile networks. Using this approach, it is possible to enhance channel allocation and resource management by using probabilistic mechanisms; because, it is possible to explicitly detect contention for resources. This paper presents a proactive approach for resource allocation in highly mobile networks and analyzed the user contention for common resources such as radio channels in highly mobile wireless networks. The proposed approach uses an analytical modelling approach to model the contention and results are obtained showing enhanced system performance. Based on these results an operational space has been explored and are shown to be useful for emerging future networks such as 5G by allowing base stations to calculate the probability of contention based on the demand for network resources. This study indicates that the proactive model enhances handover and resource allocation for highly mobile networks. This paper analyzed the effects of and alpha and beta, in effect, how these parameters affect the proactive resource allocation requests in the contention queue has been modelled for any given scenario from the conference paper "Exploring analytical models to maintain quality-of-service for resource management using a proactive approach in highly mobile environments".

APA, Harvard, Vancouver, ISO, and other styles

4

Tang Ling. "Research on Resource Contention in Event-Based Programming." International Journal of Digital Content Technology and its Applications 7, no. 6 (2013): 685–97. http://dx.doi.org/10.4156/jdcta.vol7.issue6.77.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Yao, Chen, and Christos Cassandras. "Resource contention games in multiclass stochastic flow models." Nonlinear Analysis: Hybrid Systems 5, no. 2 (2011): 301–19. http://dx.doi.org/10.1016/j.nahs.2010.05.006.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Cui, Y., Y. Wang, Y. Chen, and Y. Shi. "Mitigating Resource Contention on Multicore Systems via Scheduling." Computer Journal 57, no. 8 (2013): 1178–94. http://dx.doi.org/10.1093/comjnl/bxt056.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

RYANG, DAL-SOO, and KYU HO PARK. "A REAL-TIME SCHEDULING ALGORITHM FOR TASKS WITH RESOURCE CONTENTION ON A MULTIPROCESSOR." Journal of Circuits, Systems and Computers 04, no. 03 (1994): 243–53. http://dx.doi.org/10.1142/s0218126694000144.

Full text

Abstract:

Our scheduling algorithm is based on a general model with timing and resource constraints which permits OR requests. In order to keep run-time costs low, we propose an algorithm that does not search the whole search space. This paper defines two measures, survivability and impact, for scheduling tasks conflicted for some resources. The survivability is a metric to show how urgent a task is, and how constrained it is by its resources. The impact of a resource for a task measures how much other tasks are influenced by the allocation of the resource to the task. Our scheduling algorithm uses the survivability to schedule tasks on multiple processors. After a task is picked out to be run in a time slice using the survivability, the least impact resources are allocated from several alternative resources.

APA, Harvard, Vancouver, ISO, and other styles

8

Zhuravlev, Sergey, Sergey Blagodurov, and Alexandra Fedorova. "Addressing shared resource contention in multicore processors via scheduling." ACM SIGARCH Computer Architecture News 38, no. 1 (2010): 129–42. http://dx.doi.org/10.1145/1735970.1736036.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Zhuravlev, Sergey, Sergey Blagodurov, and Alexandra Fedorova. "Addressing shared resource contention in multicore processors via scheduling." ACM SIGPLAN Notices 45, no. 3 (2010): 129–42. http://dx.doi.org/10.1145/1735971.1736036.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Lam, K., and S. Hung. "The effect of resource contention on distributed database systems." Information and Software Technology 35, no. 3 (1993): 139–48. http://dx.doi.org/10.1016/0950-5849(93)90051-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Bhavadharini, R. M., S. Karthik, N. Karthikeyan, and Anand Paul. "Wireless Networking Performance in IoT Using Adaptive Contention Window." Wireless Communications and Mobile Computing 2018 (July 3, 2018): 1–9. http://dx.doi.org/10.1155/2018/7248040.

Full text

Abstract:

Internet of Things (IoT) network contains heterogeneous resource-constrained computing devices which has its unique reputation in IoT environments. In spite of its distinctiveness, the network performance deteriorates by the distributed contention of the nodes for the shared wireless medium in IoT. In IoT network, the Medium Access Control (MAC) layer contention impacts the level of congestion at the transport layer. Further, the increasing node contention at the MAC layer increases link layer frame drops resulting in timeouts at the transport layer segments and the performance of TCP degrades. In addition to that, the expiration of maximum retransmission attempts and the high contentions drive the MAC retransmissions and the associated overheads to reduce the link level throughput and the packet delivery ratio. In order to deal with aforementioned problems, the Adaptive Contention Window (ACW) is proposed, which aims to reduce the MAC overhead and retransmissions by determining active queue size at the contending nodes and the energy level of the nodes to improve TCP performance. Further, the MAC contention window is adjusted according to the node’s active queue size and the residual energy and TCP congestion window is dynamically adjusted based on the MAC contention window. Hence, by adjusting the MAC Adaptive Contention Window, the proposed model effectively distributes the access to medium and assures improved network throughput. Finally, the simulation study implemented through ns-2 is compared with an existing methodology such as Cross-Layer Congestion Control and dynamic window adaptation (CC-BADWA); the proposed model enhances the network throughput with the minimal collisions.

APA, Harvard, Vancouver, ISO, and other styles

12

Wu, Xiu Guo. "Resource Representation in Migrating Workflow System Modeling." Advanced Materials Research 424-425 (January 2012): 709–12. http://dx.doi.org/10.4028/www.scientific.net/amr.424-425.709.

Full text

Abstract:

Workflow is a critical enabler for achieving enterprise competitiveness with today’s hot technologies, as portals, e-business and e-commerce. Workflow modeling is the first step before workflow executes, and resources can become important decision factors. The lack of resources can cause contention, the need for some tasks to wait for others to complete, and the slowing down of the accomplishment of larger goals. In this paper, we discuss the resource model in workflow system, and define the resource-constrained model. The main merit of resource model is that it bridges the gap between the human and the machine level problem solving.

APA, Harvard, Vancouver, ISO, and other styles

13

Wu, Yan, Dan Wu, Liang Ao, Lianxin Yang, and Qinxue Fu. "Contention-Based Radio Resource Management for URLLC-Oriented D2D Communications." IEEE Transactions on Vehicular Technology 69, no. 9 (2020): 9960–71. http://dx.doi.org/10.1109/tvt.2020.3003944.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Vallone, Joel, Robert Birke, and Lydia Y. Chen. "Making Neighbors Quiet: An Approach to Detect Virtual Resource Contention." IEEE Transactions on Services Computing 13, no. 5 (2020): 843–56. http://dx.doi.org/10.1109/tsc.2017.2720742.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Nam, Changjoo, and Dylan A. Shell. "Assignment Algorithms for Modeling Resource Contention in Multirobot Task Allocation." IEEE Transactions on Automation Science and Engineering 12, no. 3 (2015): 889–900. http://dx.doi.org/10.1109/tase.2015.2415514.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Do, Tien Van. "Modeling a resource contention in the management of virtual organizations." Information Sciences 180, no. 17 (2010): 3108–16. http://dx.doi.org/10.1016/j.ins.2010.04.027.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Yao, Chen, and Christos G. Cassandras. "Perturbation Analysis and Resource Contention Games in Multiclass Stochastic Flow Models." IFAC Proceedings Volumes 42, no. 17 (2009): 256–61. http://dx.doi.org/10.3182/20090916-3-es-3003.00045.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Stoyenko, Alexander D., Thomas J. Marlowe, and Wolfgang A. Halang. "Enabling Efficient Schedulability Analysis through Program Transformations and Restricted Resource Contention." IFAC Proceedings Volumes 25, no. 11 (1992): 269–73. http://dx.doi.org/10.1016/s1474-6670(17)50160-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Lide Duan, Lu Peng, and Bin Li. "Predicting Architectural Vulnerability on Multithreaded Processors under Resource Contention and Sharing." IEEE Transactions on Dependable and Secure Computing 10, no. 2 (2013): 114–27. http://dx.doi.org/10.1109/tdsc.2012.87.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Nanda, Arun K., Honda Shing, Ten-Hwan Tzen, and Lionel M. Ni. "Resource contention in shared-memory multiprocessors: A parameterized performance degradation model." Journal of Parallel and Distributed Computing 12, no. 4 (1991): 313–28. http://dx.doi.org/10.1016/0743-7315(91)90003-r.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Wada, Takeshi. "RIGIDITY AND FLEXIBILITY OF REPERTOIRES OF CONTENTION*." Mobilization: An International Quarterly 21, no. 4 (2016): 449–68. http://dx.doi.org/10.17813/1086-671x-21-4-449.

Full text

Abstract:

Scholars have argued the importance of understanding repertoires of contention, but there is little research on the quality of these repertoires across countries and over time. In this article, I seek to fill this gap and address the following questions: How flexible or rigid are repertoires of contention across countries and over time? Do they converge on a type that Tilly called “strong,” which is closer to the rigid end of the spectrum, as Tilly expected? What accounts for the differences across countries and over time in the flexibility of repertoires? Do political opportunity or resource mobilization theories explain the variation? To address these questions, I create measures from data on contentious events worldwide between 1990 and 2004 provided by the World Handbook of Political Indicators IV. I find that the flexibility of repertoires does indeed cluster around Tilly's strong model. Employing an innovative “random effect within-between model” to separate out two types of effects of explanatory factors, I find some support for each theory. State strength at the crossnational level increases the rigidity of repertoires, whereas increases in income over time increase the flexibility of repertoires.

APA, Harvard, Vancouver, ISO, and other styles

22

WANG, JIACUN, and DEMIN LI. "RESOURCE ORIENTED WORKFLOW NETS AND WORKFLOW RESOURCE REQUIREMENT ANALYSIS." International Journal of Software Engineering and Knowledge Engineering 23, no. 05 (2013): 677–93. http://dx.doi.org/10.1142/s0218194013400135.

Full text

Abstract:

Petri nets are a powerful formalism in modeling workflows. A workflow determines the flow of work according to pre-defined business process. In many situations, business processes are constrained by scarce resources. The lack of resources can cause contention, the need for some tasks to wait for others to complete, which slows down the accomplishment of larger goals. In our previous work, a resource-constrained workflow model was introduced and a resource requirement analysis approach was developed for emergency response workflows, in which support of on-the-fly workflow change is critical [14]. In this paper, we propose a Petri net based approach for recourse requirements analysis, which can be used for more general purposes. The concept of resource-oriented workflow nets (ROWN) is introduced and the transition firing rules of ROWN are presented. Resource requirements for general workflows can be done through reachability analysis. An efficient resource analysis algorithm is developed for a class of well-structured workflows, in which when a task execution is started it is guaranteed to finish successfully. For a task that may fail in the middle of execution, an equivalent non-failing task model in terms of resource consumption is developed.

APA, Harvard, Vancouver, ISO, and other styles

23

Dutta, Kaushik, and Debra VanderMeer. "Enabling Resource Access Visibility for Automated Enterprise Services." Journal of Database Management 25, no. 2 (2014): 1–28. http://dx.doi.org/10.4018/jdm.2014040101.

Full text

Abstract:

Organizations deliver on their mandates by executing a variety of services. Over the past few decades, service automation software systems, such as SAP and PeopleSoft, have enabled the automation of services. While much attention in the literature and in industry has been devoted to the implementation and functional correctness of automated services, little focus has been granted to ensuring responsiveness for services. As service automation platforms host larger and larger numbers of services, and services execute with greater and greater levels of concurrency, fault resolution becomes an important issue in ensuring expected responsiveness levels. In particular, two factors impact fault resolution in service automation platforms. First, each executing service requires access to specific data and system resources to complete its processing. As greater numbers of services execute concurrently, there is increasing contention for these data and system resources, leading to greater numbers of faults and SLA violations in service execution. Second, the black-box nature of service automation platforms provides little visibility into the nature of resource contention that caused a fault or SLA violation. This lack of visibility makes fault resolution difficult, and in many cases impossible, because it is difficult to trace the root cause of the problem. In this paper, the authors address the problem of system-level resource visibility for services through the design and development of a system capable of mapping abstract service workflows to their data and system impacts to enable resource visibility. The authors' system has been tested and demonstrated effective, as we demonstrate in a case study setting.

APA, Harvard, Vancouver, ISO, and other styles

24

B, Madhavi Devi, Smriti Agrawal, and R. Rajeshwara Rao. "Deadlock Free Resource Management Technique for IoT-Based Post Disaster Recovery Systems." Scalable Computing: Practice and Experience 21, no. 3 (2020): 391–406. http://dx.doi.org/10.12694/scpe.v21i3.1734.

Full text

Abstract:

Disasters are inevitable, but their impact can be mitigated with careful planning. An IoT-based network with limited resources can be used in the post-disaster recovery. However, the resource of common interest creates contention among its contenders. This contention leads to tussle which in turn may lead to a deadlock. Some of the existing techniques prevent or avoid deadlock by performing stringent testing with significant testing overhead. While others propose recovery action after the deadlock is detected with significant overhead. A deadlock leads to a breakdown of the post-disaster recovery system while testing overhead implies delayed response either case can lead to catastrophic losses. This paper presents a new class of techniques that do not perform stringent testing before allocating the resources but still ensure that the system is deadlock-free and the overhead is also minimal. The proposed technique suggests reserving a portion of the resources to ensure no deadlock would occur. The correctness of the technique is proved in the form of theorems. The average turnaround time is approximately 18% lower for the proposed technique over Banker’s algorithm and also an optimal overhead of O(m).

APA, Harvard, Vancouver, ISO, and other styles

25

Mathur, Vipul, and Varsha Apte. "An overhead and resource contention aware analytical model for overloaded Web servers." Journal of Systems and Software 82, no. 1 (2009): 39–55. http://dx.doi.org/10.1016/j.jss.2008.03.068.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Surve, Sunil K., and Preeti Nitin Jain. "A review on shared resource contention in multicores and its mitigating techniques." International Journal of High Performance Systems Architecture 9, no. 1 (2020): 20. http://dx.doi.org/10.1504/ijhpsa.2020.10029188.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Jain, Preeti Nitin, and Sunil K. Surve. "A review on shared resource contention in multicores and its mitigating techniques." International Journal of High Performance Systems Architecture 9, no. 1 (2020): 20. http://dx.doi.org/10.1504/ijhpsa.2020.107169.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Yao, Chen, and Christos G. Cassandras. "Perturbation analysis of stochastic hybrid systems and applications to resource contention games." Frontiers of Electrical and Electronic Engineering in China 6, no. 3 (2011): 453–67. http://dx.doi.org/10.1007/s11460-011-0166-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Ning-Hai Bao, Le-Min Li, Hong-Bin Luo, Zhi-Zhong Zhang, and Hong-Fang Yu. "On Exploiting Sharable Resources With Resource Contention Resolution for Surviving Double-Link Failures in Optical Mesh Networks." Journal of Lightwave Technology 30, no. 17 (2012): 2788–95. http://dx.doi.org/10.1109/jlt.2012.2208178.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Walsh, W. E., and M. P. Wellman. "Decentralized Supply Chain Formation: A Market Protocol and Competitive Equilibrium Analysis." Journal of Artificial Intelligence Research 19 (November 1, 2003): 513–67. http://dx.doi.org/10.1613/jair.1213.

Full text

Abstract:

Supply chain formation is the process of determining the structure and terms of exchange relationships to enable a multilevel, multiagent production activity. We present a simple model of supply chains, highlighting two characteristic features: hierarchical subtask decomposition, and resource contention. To decentralize the formation process, we introduce a market price system over the resources produced along the chain. In a competitive equilibrium for this system, agents choose locally optimal allocations with respect to prices, and outcomes are optimal overall. To determine prices, we define a market protocol based on distributed, progressive auctions, and myopic, non-strategic agent bidding policies. In the presence of resource contention, this protocol produces better solutions than the greedy protocols common in the artificial intelligence and multiagent systems literature. The protocol often converges to high-value supply chains, and when competitive equilibria exist, typically to approximate competitive equilibria. However, complementarities in agent production technologies can cause the protocol to wastefully allocate inputs to agents that do not produce their outputs. A subsequent decommitment phase recovers a significant fraction of the lost surplus.

APA, Harvard, Vancouver, ISO, and other styles

31

Bergner, Jason M., Sean A. Peffer, and Robert J. Ramsay. "Concession, Contention, and Accountability in Auditor-Client Negotiations." Behavioral Research in Accounting 28, no. 1 (2015): 15–25. http://dx.doi.org/10.2308/bria-51146.

Full text

Abstract:

ABSTRACT This study investigates how tactics employed by a client during negotiations impact experienced auditors' propensity to waive material adjustments and whether the salience of a strict concurring partner review affects the decision to waive. Different psychological theories predict that auditors may either become more contentious or more concessionary when facing a contentious client. Our results suggest that auditors are more likely to waive material adjustments when clients use contending tactics, but not concessionary tactics. However, we also find that making a strict concurring partner review salient reduces this propensity. Further, we find that a theory not previously applied to this line of research, the level-of-aspiration theory, may predict how auditors react. These results offer additional insights into auditor-client negotiations and reveal that existing quality controls can influence these negotiations.

APA, Harvard, Vancouver, ISO, and other styles

32

Liang, Weihao, Yong Chen, Jialin Liu, and Hong An. "CARS: A contention-aware scheduler for efficient resource management of HPC storage systems." Parallel Computing 87 (September 2019): 25–34. http://dx.doi.org/10.1016/j.parco.2019.04.010.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Armenta-Cano, F. A., A. Tchernykh, J. M. Cortes-Mendoza, et al. "Min_c: Heterogeneous concentration policy for energy-aware scheduling of jobs with resource contention." Programming and Computer Software 43, no. 3 (2017): 204–15. http://dx.doi.org/10.1134/s0361768817030021.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Yao, Ningshi, Michael Malisoff, and Fumin Zhang. "Contention-resolving model predictive control for coupled control systems with a shared resource." Automatica 122 (December 2020): 109219. http://dx.doi.org/10.1016/j.automatica.2020.109219.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Maheshbhai Shah, Darshan, M. Vinayaka Murthi, and Anand Kumar. "A Novel Local Search-Based Approximation Algorithm to Optimize Virtual Machine Placement With Resource Constraints." MATEC Web of Conferences 335 (2021): 04007. http://dx.doi.org/10.1051/matecconf/202133504007.

Full text

Abstract:

Many problems in cloud computing are not solvable in polynomial time and only option left is to choose approximate solution instead of optimum. Virtual Machine placement is one of such problem with resource constraints in which overall objective is to optimize multiple resources of hosts during placement process. In this paper we have addressed this problem with large size NP-Hard instances and proposed novel local search-based approximation algorithm. This problem is not yet studied in the research community with NP hard instances. A new proposed algorithm is empirically evaluated with state-of-the-art techniques. and our algorithm has improved placement result by 18% in CPU utilization, 21% in resource contention and 26% in overall resource utilization for benchmark instances collected from azure private cloud data center.

APA, Harvard, Vancouver, ISO, and other styles

36

Lam, Kam-Yiu, and Sheung-Lun Hung. "Roles of Resource and Data Contention on the Performance of Replicated Distributed Database Systems." Journal of Database Management 4, no. 1 (1993): 25–38. http://dx.doi.org/10.4018/jdm.1993010103.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Jain, P. K. "Solving resource contention problem in FMS using Petri nets and a rule-based approach." International Journal of Production Research 39, no. 4 (2001): 785–808. http://dx.doi.org/10.1080/00207540010005114.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Chen Yao and C. G. Cassandras. "A Solution to the Optimal Lot-Sizing Problem as a Stochastic Resource Contention Game." IEEE Transactions on Automation Science and Engineering 9, no. 2 (2012): 250–64. http://dx.doi.org/10.1109/tase.2012.2186126.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Vasquez, John A. "Domestic contention on critical foreign-policy issues: the case of the United States." International Organization 39, no. 4 (1985): 643–66. http://dx.doi.org/10.1017/s0020818300027053.

Full text

Abstract:

Variations in domestic contention on foreign policy, particularly variations of a cyclical nature within the United States, have been often identified but not explained. Changes in international interactions on global issues affect domestic contention. Such external events as the rise of new global issues, the emergence of crises, moves toward accommodation and resolution, war, and foreign-policy failure are related to the diverse forms that domestic contention can take. U.S. domestic contention, both in the recent past and in the short-term future, illustrates particularly well how hard-liners and accommodationists battle over the lessons of history.

APA, Harvard, Vancouver, ISO, and other styles

40

Cho, Won, and Joonho Kong. "Memory and Cache Contention Denial-of-Service Attack in Mobile Edge Devices." Applied Sciences 11, no. 5 (2021): 2385. http://dx.doi.org/10.3390/app11052385.

Full text

Abstract:

In this paper, we introduce a memory and cache contention denial-of-service attack and its hardware-based countermeasure. Our attack can significantly degrade the performance of the benign programs by hindering the shared resource accesses of the benign programs. It can be achieved by a simple C-based malicious code while degrading the performance of the benign programs by 47.6% on average. As another side-effect, our attack also leads to greater energy consumption of the system by 2.1× on average, which may cause shorter battery life in the mobile edge devices. We also propose detection and mitigation techniques for thwarting our attack. By analyzing L1 data cache miss request patterns, we effectively detect the malicious program for the memory and cache contention denial-of-service attack. For mitigation, we propose using instruction fetch width throttling techniques to restrict the malicious accesses to the shared resources. When employing our malicious program detection with the instruction fetch width throttling technique, we recover the system performance and energy by 92.4% and 94.7%, respectively, which means that the adverse impacts from the malicious programs are almost removed.

APA, Harvard, Vancouver, ISO, and other styles

41

Meilasari-Sugiana, Astrid. "Collective action and ecological sensibility for sustainable mangrove governance in Indonesia: challenges and opportunities." Journal of Political Ecology 19, no. 1 (2012): 184. http://dx.doi.org/10.2458/v19i1.21726.

Full text

Abstract:

Theorists of Common Pool Resources (CPR) management suggest that distribution and devolution of power can localize consequential decisions over natural resources. The Government of Indonesia has encouraged the collective management of natural resources through self-governed local communes. It has also argued for consensual decision making over the use, allocation and distribution of natural resources at the village, district and regency level. Devolution has not, however, given most people access to strategic and structural power to decide on natural resource governance. Two cases in South Sulawesi are discussed. In the case of the hunting of Sinjai's bats, devolution for collective governance was marked by contention, unfettered competition, and resource overutilization. Management of Sinjai's coastal mangroves, however, suggests that social institutions can stimulate social sensibility, encourage attachment to the natural landscape, and instigate collective responsibilities. Community members acted in a way that benefited the overall good, avowing individual rights. Barriers and enablers to sustainable natural resource governance emerged from the local context in each case, including assertion of private ownership of mangrove plots; they did not emerge as a consequence of distribution and devolution of power alone, as CPR theory suggests.Keywords: Devolution, collective action, reciprocity, ecological sensibility, mangroves, South Sulawesi

APA, Harvard, Vancouver, ISO, and other styles

42

Souravlas, Stavros, Stefanos Katsavounis, and Sofia Anastasiadou. "On Modeling and Simulation of Resource Allocation Policies in Cloud Computing Using Colored Petri Nets." Applied Sciences 10, no. 16 (2020): 5644. http://dx.doi.org/10.3390/app10165644.

Full text

Abstract:

The Petri net (PN) formalism is a suitable tool for modeling parallel systems due to its basic characteristics, such as synchronization. The extension of PN, the Colored Petri Nets (CPN) allows the incorporation of more details of the real system into the model (for example, contention for shared resources). The CPNs have been widely used in a variety of fields to produce suitable models. One of their biggest strengths is that their overall philosophy is quite similar to the philosophy of the object-oriented paradigm. In this regard, the CPN models can be used to implement simulators in a rather straightforward way. In this paper, the CPN framework is employed to implement a new resource allocation simulator, which is used to verify the performance of our previous work, where we proposed a fair resource allocation scheme with flow control and maximum utilization of the system’s resources.

APA, Harvard, Vancouver, ISO, and other styles

43

Han, Seunghee, Bosung Kim, Jaemin Han, Kyehee Kim, and JooSeok Song. "Adaptive Data Placement for Improving Performance of Online Social Network Services in a Multicloud Environment." Scientific Programming 2017 (2017): 1–17. http://dx.doi.org/10.1155/2017/2824782.

Full text

Abstract:

The existing online social network (OSN) services in a multiple-cloud (Multicloud) environment use replications to store user data for improving the service performance. However, it not only generates tremendous traffic for synchronization between data but also stores considerable redundant data, thus causing large storage costs. In addition, it does not provide dynamic load balancing considering the resource status of each cloud. As a result, it cannot cope with the degradation of performance caused by the resource contention. We introduce an adaptive data placement algorithm without the replications for improving the performance of the OSN services in the Multicloud environment. Our approach is designed to avoid server overhead using data balancing technique, which locates data from a cloud to another according to the amount of traffic. To provide acceptable latency delay, it also considers the relationship between users and the distance between user and cloud when transferring data. To validate our approach, we experimented with actual users’ locations and times of use collected from OSN services. Our findings indicate that this approach can reduce the resource contention by an average of more than 59%, reduce storage volume to at least 50%, and maintain the latency delay under 50 ms.

APA, Harvard, Vancouver, ISO, and other styles

44

Ramacciotti, Mirela. "Bilingualism as a resource for neuroplasticity: a hypothesis to be considered." Revista da ABRALIN 19, no. 2 (2020): 1–6. http://dx.doi.org/10.25189/rabralin.v19i2.1543.

Full text

Abstract:

This is a review of the lecture Does Bilingualism Affect Cognitive and Brain Structures? Facts and Fictions by Ellen Bialystok on June 30th, 2020 for Abralin. Aspects of bilingualism, inhibition and selective attention are examined to demonstrate where research shows positive correlations (life endpoints: infancy and old age) and where it remains unclear (young adults). Reasons for this are examined and the unity and diversity model upon which predictions have been made is disputed. A contention for a different outlook in research on bilingualism posits that better explanations can be found in looking at attentional network reconfiguration and neuroplasticity adaptations.

APA, Harvard, Vancouver, ISO, and other styles

45

Musah-Surugu, Issah Justice, Albert Ahenkan, and Justice Nyigmah Bawole. "Local Government Financing of Climate Change in Ghana: Politics of Aid and Central Government Dependency Syndrome." Journal of Asian and African Studies 54, no. 5 (2018): 619–37. http://dx.doi.org/10.1177/0021909618812911.

Full text

Abstract:

Uncertainties about the amount of resources needed to combat climate change, dwindling local resources, limited local autonomy and limited expertise constrain local governments (LGs) in their response to the effects of climate change. As a result, financing climate change remains a major nightmare for LG actors across diverse nested territorial containers. It certainly requires the embracing of a multifaceted approach – the use of system thinking where local governments’ resource husbandry is optimised to support external aid and central government transfer. A multifaceted approach brings onboard blended resources, diverse stakeholders, diverse resource mobilisation skills and schemes, and accountability measures. Also, given projected increases in future climate-induced public expenditure, albeit with uncertainties, reliance on a single resource mobilisation approach will be a recipe for inefficiency. This article argues that developmental aid and central government’s transfer remains inadequate to meet the increasing demand for adaptation cost at the local level in Ghana. In the face of the unequivocal impact of climate change risk, we contend that local resource husbandry must be optimised through different innovations to complement other major sources of financing. Our contention resonates with the school of thought that argues local level resources are more resilient to politicisation, are stable, and are predictable compared to international aid and central government transfer. Through qualitative in-depth interviews, empirical data has been drawn from local governments in Ghana to justify our claims.

APA, Harvard, Vancouver, ISO, and other styles

46

Paranthaman, Vishnu Vardhan, Yonal Kirsal, Glenford Mapp, Purav Shah, and Huan X. Nguyen. "Exploiting Resource Contention in Highly Mobile Environments and Its Application to Vehicular Ad-Hoc Networks." IEEE Transactions on Vehicular Technology 68, no. 4 (2019): 3805–19. http://dx.doi.org/10.1109/tvt.2019.2902245.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Li-Chun Wang and A. Chen. "Optimal Radio Resource Partition for Joint Contention- and Connection-Oriented Multichannel Access in OFDMA Systems." IEEE Transactions on Mobile Computing 8, no. 2 (2009): 162–72. http://dx.doi.org/10.1109/tmc.2008.96.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Stoyenko, Alexander D., and Thomas J. Marlowe. "Polynomial-time transformations and schedulability analysis of parallel real-time programs with restricted resource contention." Real-Time Systems 4, no. 4 (1992): 307–29. http://dx.doi.org/10.1007/bf00355297.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

PILLAI, ABHISHEK, and WEI ZHANG. "EXPLOITING INSTRUCTION REUSE TO IMPROVE THE PERFORMANCE OF DUAL INSTRUCTION EXECUTION." Journal of Circuits, Systems and Computers 20, no. 05 (2011): 899–913. http://dx.doi.org/10.1142/s0218126611007670.

Full text

Abstract:

Dual instruction execution (DIE) is an effective instruction-level temporal redundancy technique to improve the datapath reliability against transient errors for superscalar microprocessors. However, previous study shows that the performance overhead of dual instruction execution on an out-of-order core is substantial, primarily due to the serious resource contention problems such as the ALU bandwidth. In this paper, we propose a novel approach to reducing the performance overhead of DIE without compromising the datapath reliability. In the proposed scheme, both the primary and the duplicate instructions of DIE can exploit the ECC-protected instruction reuse buffer (IRB) for mitigating the resource contention of DIE by minimizing the number of dynamic instructions executed, leading to better performance without impacting the reliability of DIE. Our experiments indicate that the proposed approach can reduce the performance loss of dual instruction execution by up to 70.8%, with 51.1% on average, and can reduce the performance loss of DIE–IRB by up to 17.2%, with 7.1% on average, while providing reliability comparable to DIE or DIE–IRB.

APA, Harvard, Vancouver, ISO, and other styles

50

Nair, Manjusha. "Differences in Workers' Narratives of Contention in Two Central Indian Towns." International Labor and Working-Class History 79, no. 1 (2011): 175–94. http://dx.doi.org/10.1017/s0147547910000323.

Full text

Abstract:

AbstractContract work in India, though legally regulated by a 1970 Act, is widespread and mostly unrecognized. With the implementation of neoliberal policies in India since the 1990s, contract work has become the norm. There are now few spaces in which contract workers can get redress through the legal system. Using oral history narratives of contract workers' participation in a labor movement, this article shows how narratives of contention differ in the rendering of agency, success, and future, between one group of contract workers employed in the 1970s in a state-owned mine and another employed in the 1990s in an industrial area owned by private and foreign capital. The evidence for the article is ethnographic, collected in Chhattisgarh region in central India. This article suggests that these workers' narratives show the transformation in practices of citizenship, resistance, and militancy in India over time. Such differences are essential in understanding phenomena like the resurgence of the Maoist movement in Chhattisgarh.

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!