Увійти

Готові списки джерел за темами / Job Replication / Статті в журналах

Статті в журналах з теми "Job Replication"

Щоб переглянути інші типи публікацій з цієї теми, перейдіть за посиланням: Job Replication.

Автор: Grafiati

Опубліковано: 14 березня 2023

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Ознайомтеся з топ-50 статей у журналах для дослідження на тему "Job Replication".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Переглядайте статті в журналах для різних дисциплін та оформлюйте правильно вашу бібліографію.

1

Kim, Yusik, Rhonda Righter, and Ronald Wolff. "Job replication on multiserver systems." Advances in Applied Probability 41, no. 2 (June 2009): 546–75. http://dx.doi.org/10.1239/aap/1246886623.

Повний текст джерела

Анотація:

Parallel processing is a way to use resources efficiently by processing several jobs simultaneously on different servers. In a well-controlled environment where the status of the servers and the jobs are well known, everything is nearly deterministic and replicating jobs on different servers is obviously a waste of resources. However, in a poorly controlled environment where the servers are unreliable and/or their capacity is highly variable, it is desirable to design a system that is robust in the sense that it is not affected by the poorly performing servers. By replicating jobs and assigning them to several different servers simultaneously, we not only achieve robustness but we can also make the system more efficient under certain conditions so that the jobs are processed at a faster rate overall. In this paper we consider the option of replicating jobs and study how the performance of different ‘degrees’ of replication, ranging from no replication to full replication, affects the performance of a system of parallel servers.

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Kim, Yusik, Rhonda Righter, and Ronald Wolff. "Job replication on multiserver systems." Advances in Applied Probability 41, no. 02 (June 2009): 546–75. http://dx.doi.org/10.1017/s0001867800003414.

Повний текст джерела

Анотація:

Parallel processing is a way to use resources efficiently by processing several jobs simultaneously on different servers. In a well-controlled environment where the status of the servers and the jobs are well known, everything is nearly deterministic and replicating jobs on different servers is obviously a waste of resources. However, in a poorly controlled environment where the servers are unreliable and/or their capacity is highly variable, it is desirable to design a system that is robust in the sense that it is not affected by the poorly performing servers. By replicating jobs and assigning them to several different servers simultaneously, we not only achieve robustness but we can also make the system more efficient under certain conditions so that the jobs are processed at a faster rate overall. In this paper we consider the option of replicating jobs and study how the performance of different ‘degrees’ of replication, ranging from no replication to full replication, affects the performance of a system of parallel servers.

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Lynch, Beverly P. "Job Satisfaction in Libraries: A Replication." Library Quarterly 57, no. 2 (April 1987): 190–202. http://dx.doi.org/10.1086/601871.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

4

Raaijmakers, Youri, and Sem Borst. "Achievable Stability in Redundancy Systems." ACM SIGMETRICS Performance Evaluation Review 49, no. 1 (June 22, 2022): 27–28. http://dx.doi.org/10.1145/3543516.3456267.

Повний текст джерела

Анотація:

We investigate the achievable stability region for redundancy systems and a quite general workload model with different job types and heterogeneous servers, reflecting job-server affinity relations which may arise from data locality issues and soft compatibility constraints. Under the assumption that job types are known beforehand we establish for New-Better-than-Used (NBU) distributed speed variations that no replication gives a strictly larger stability region than replication. Strikingly, this does not depend on the underlying distribution of the intrinsic job sizes, but observing the job types is essential for this statement to hold. In case of non-observable job types we show that for New-Worse-than-Used (NWU) distributed speed variations full replication gives a larger stability region than no replication.

Стилі APA, Harvard, Vancouver, ISO та ін.

5

Saadat, Nazanin, and Amir Masoud Rahmani. "A Two-Level Fuzzy Value-Based Replica Replacement Algorithm in Data Grids." International Journal of Grid and High Performance Computing 8, no. 4 (October 2016): 78–99. http://dx.doi.org/10.4018/ijghpc.2016100105.

Повний текст джерела

Анотація:

One of the challenges of data grid is to access widely distributed data fast and efficiently and providing maximum data availability with minimum latency. Data replication is an efficient way used to address this challenge by replicating and storing replicas, making it possible to access similar data in different locations of the data grid and can shorten the time of getting the files. However, as the number and storage size of grid sites is limited and restricted, an optimized and effective replacement algorithm is needed to improve the efficiency of replication. In this paper, the authors propose a novel two-level replacement algorithm which uses Fuzzy Replica Preserving Value Evaluator System (FRPVES) for evaluating the value of each replica. The algorithm was tested using a grid simulator, OptorSim developed by European Data Grid projects. Results from simulation procedure show that the authors' proposed algorithm has better performance in comparison with other algorithms in terms of job execution time, total number of replications and effective network usage.

Стилі APA, Harvard, Vancouver, ISO та ін.

6

Levinson, Edward M. "Job Satisfaction among School Psychologists: A Replication Study." Psychological Reports 65, no. 2 (October 1989): 579–84. http://dx.doi.org/10.2466/pr0.1989.65.2.579.

Повний текст джерела

Анотація:

The purpose of this study was to determine whether the results of Anderson, et al.'s 1984 national study of the job satisfaction of NASP affiliated school psychologists could be replicated in one state and with a sample that comprised both NASP-affiliated and nonaffiliated school psychologists. The job satisfaction of 362 school psychologists in Pennsylvania was analyzed using demographic data and the Minnesota Satisfaction Questionnaire and other procedures nearly identical to those employed by Anderson, et al. Current results paralleled the results of Anderson, et al. both in the percentages of school psychologists who showed various levels of job satisfaction and in regard to sources of satisfaction and dissatisfaction.

Стилі APA, Harvard, Vancouver, ISO та ін.

7

Chang, Ruay-Shiung, Jih-Sheng Chang, and Shin-Yi Lin. "Job scheduling and data replication on data grids." Future Generation Computer Systems 23, no. 7 (August 2007): 846–60. http://dx.doi.org/10.1016/j.future.2007.02.008.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

8

Shwe, Thanda, and Masayoshi Aritsugi. "A DATA RE-REPLICATION SCHEME AND ITS IMPROVEMENT TOWARD PROACTIVE APPROACH." ASEAN Engineering Journal 8, no. 1 (June 1, 2018): 36–52. http://dx.doi.org/10.11113/aej.v8.15497.

Повний текст джерела

Анотація:

With increasing demand for cloud computing technology, cloud infrastructures are utilized to their maximum limits. There is a high possibility that commodity servers that are used in Hadoop Distributed File System (HDFS) based cloud data center will fail often. However, the selection of source and destination data nodes for re-replication of data has so far not been adequately addressed. In order to balance the workload among nodes during re-replication phase and reduce impact on cluster normal jobs’ performance, we develop a re-replication scheme that takes into consideration of both performance and reliability perspectives. The appropriate nodes for re-replication are selected based on Analytic Hierarchy Process (AHP) with the consideration of the current utilization of resources by the cluster normal jobs. Toward effective data re-replication, we investigate the feasibility of using linear regression and local regression methods to predict resource utilization. Simulation results show that our proposed approach can reduce re-replication time, total job execution time and top-of-rack network traffic compared to baseline HDFS, consequently increases the reliability of the system and reduces performance impacts on users jobs. Regarding feasibility study of prediction methods, both regression methods are good enough to predict short time future resource utilization for re-replication.

Стилі APA, Harvard, Vancouver, ISO та ін.

9

Beigrezaei, Mahsa, Abolfazel Toroghi Haghighat, and Seyedeh Leili Mirtaheri. "Improve Performance by a Fuzzy-Based Dynamic Replication Algorithm in Grid, Cloud, and Fog." Mathematical Problems in Engineering 2021 (June 21, 2021): 1–14. http://dx.doi.org/10.1155/2021/5522026.

Повний текст джерела

Анотація:

The efficiency of data-intensive applications in distributed environments such as Cloud, Fog, and Grid is directly related to data access delay. Delays caused by queue workload and delays caused by failure can decrease data access efficiency. Data replication is a critical technique in reducing access latency. In this paper, a fuzzy-based replication algorithm is proposed, which avoids the mentioned imposed delays by considering a comprehensive set of significant parameters to improve performance. The proposed algorithm selects the appropriate replica using a hierarchical method, taking into account the transmission cost, queue delay, and failure probability. The algorithm determines the best place for replication using a fuzzy inference system considering the queue workload, number of accesses in the future, last access time, and communication capacity. It uses the Simple Exponential Smoothing method to predict future file popularity. The OptorSim simulator evaluates the proposed algorithm in different access patterns. The results show that the algorithm improves performance in terms of the number of replications, the percentage of storage filled, and the mean job execution time. The proposed algorithm has the highest efficiency in random access patterns, especially random Zipf access patterns. It also has good performance when the number of jobs and file size are increased.

Стилі APA, Harvard, Vancouver, ISO та ін.

10

Kapur, Kanika. "The Impact of Health on Job Mobility: A Measure of Job Lock." ILR Review 51, no. 2 (January 1998): 282–98. http://dx.doi.org/10.1177/001979399805100208.

Повний текст джерела

Анотація:

The author analyzes data from the National Medical Expenditure Survey of 1987 to measure the importance of “job lock”—the reduction in job mobility due to the non-portability of employer-provided health insurance. Refining the approach commonly used by other researchers investigating the same question, the author finds insignificant estimates of job lock; moreover, the confidence intervals of these estimates exclude large levels of job lock. A replication of an influential previous study that used the same data source shows large and significant job lock, as did that study, but when methodological problems are corrected and improved data are used to construct the job lock variables, job lock is found to be small and statistically insignificant.

Стилі APA, Harvard, Vancouver, ISO та ін.

11

Bansal, Jyoti, Dr Shaveta Rani, and Dr Paramjit Singh. "TheWorkQueue with Dynamic Replication-FaultTolerant Scheduler in Desktop Grid Environment." INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY 11, no. 4 (October 15, 2013): 2446–51. http://dx.doi.org/10.24297/ijct.v11i4.3128.

Повний текст джерела

Анотація:

Desktop Grid is different from Grid in terms of the characteristics of resources as well as types of sharing. Particularly, resource providers in Desktop Grid are volatile, heterogeneous, faulty, and malicious. These distinct features make it difficult for a scheduler to allocate tasks. Moreover, they deteriorate reliability of computation and performance. Availability metrics can forecast unavailability & can provide schedulers with information about reliability which helps them to make better scheduling decision when combined them with information about speed. This paper using these metrics for deciding when to replicate jobs & how much to replicate. In particular our metrics forecast the probability that a job will complete uninterrupted & our schedulers replicate those jobs that are least likely to do so. Our policy outperforms other replication policies as measured by improved Total CPU Time & reduced Waiting Time & Failure count

Стилі APA, Harvard, Vancouver, ISO та ін.

12

M Berry, Devon, Mary Beth Kaylor, Judi Church, Kay Campbell, Tina Mcmillin, and Rachelle Wamsley. "Caritas and job environment: A replication of Persky et al." Contemporary Nurse 43, no. 2 (February 2013): 237–43. http://dx.doi.org/10.5172/conu.2013.43.2.237.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

13

Campion, Michael A. "Interdisciplinary Approaches to Job Design: A Replication with Methodological Extensions." Academy of Management Proceedings 1987, no. 1 (August 1987): 249–53. http://dx.doi.org/10.5465/ambpp.1987.17534233.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

14

Abdi, Somayeh, Hossein Pedram, and Somayeh Mohamadi. "Two Level Job Scheduling and Data Replication in Data Grid." International Journal of Grid Computing & Applications 1, no. 1 (September 30, 2010): 23–37. http://dx.doi.org/10.5121/ijgca.2010.1103.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

15

Lance, Charles E., and Winston Bennett, Jr. "Replication and Extension of Models of Supervisory Job Performance Ratings." Human Performance 13, no. 2 (April 2000): 139–58. http://dx.doi.org/10.1207/s15327043hup1302_2.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

16

Campion, Michael A. "Interdisciplinary approaches to job design: A constructive replication with extensions." Journal of Applied Psychology 73, no. 3 (1988): 467–81. http://dx.doi.org/10.1037/0021-9010.73.3.467.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

17

Solga, Marc, Jaqueline Betz, Moritz Düsenberg, and Helen Ostermann. "Political skill in job negotiations: a two-study constructive replication." International Journal of Conflict Management 26, no. 1 (February 9, 2015): 2–24. http://dx.doi.org/10.1108/ijcma-02-2012-0022.

Повний текст джерела

Анотація:

Purpose – This paper aims to investigate the effects of political skill in a specific workplace setting – the job negotiation. The authors expected negotiator political skill to be positively related to distributive negotiation outcome, problem-solving as a negotiation strategy to mediate this relationship and political skill to also moderate – that is amplify – the link between problem-solving and negotiation outcome. Design/methodology/approach – In Study 1, a laboratory-based negotiation simulation was conducted with 88 participants; the authors obtained self-reports of political skill prior to the negotiation and – to account for non-independence of negotiating partners’ outcome – used the Actor–Partner Interdependence Model for data analysis. Study 2 was carried out as a real-life negotiation study with 100 managers of a multinational corporation who were given the opportunity to re-negotiate their salary package prior to a longer-term foreign assignment. Here, the authors drew on two objective measures of negotiation success, increase of annual gross salary and additional annual net benefits. Findings – In Study 1, the initial hypothesis – political skill will be positively related to negotiator success – was fully supported. In Study 2, all three hypotheses (see above) were fully supported for additional annual net benefits and partly supported for increase of annual gross salary. Originality/value – To the authors' best knowledge, this paper presents the first study to examine political skill as a focal predictor variable in the negotiation context. Furthermore, the studies also broaden the emotion-centered approach to social effectiveness that is prevalent in current negotiation research.

Стилі APA, Harvard, Vancouver, ISO та ін.

18

Becker, Deborah R., Richard R. Bebout, and Robert E. Drake. "Job preferences of people with severe mental illness: A replication." Psychiatric Rehabilitation Journal 22, no. 1 (1998): 46–50. http://dx.doi.org/10.1037/h0095266.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

19

Mansouri, Najme, and Gholam Hosein Dastghaibyfard. "Job scheduling and dynamic data replication in data grid environment." Journal of Supercomputing 64, no. 1 (January 9, 2013): 204–25. http://dx.doi.org/10.1007/s11227-012-0850-2.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

20

Duffy, Ken R., and Seva Shneer. "MDS coding is better than replication for job completion times." Operations Research Letters 49, no. 1 (January 2021): 91–95. http://dx.doi.org/10.1016/j.orl.2020.11.010.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

21

Takalkar, Pradnya, and Michael D. Coovert. "International Replication Note The Dimensionality of Job Satisfaction in India." Applied Psychology 43, no. 3 (July 1994): 415–26. http://dx.doi.org/10.1111/j.1464-0597.1994.tb00837.x.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

22

Doğan, Atakan, Mustafa Müjdat Atanak, Safai Tandoğan, Reha Oğuz Altuğ, and Hakan Güray Şenel. "DGridSim: a multi-model discrete-event simulator for real-time data grid systems." SIMULATION 90, no. 11 (August 21, 2014): 1209–30. http://dx.doi.org/10.1177/0037549714545415.

Повний текст джерела

Анотація:

Data grid systems are utilized to share, manage, and process large data sets. On the other hand, an increasing number of applications with real-time constraints arise in several disciplines of science and engineering. The performance of a data grid system for real-time applications is highly dependent on the underlying job scheduling, data scheduling, and data replication algorithms and advance reservation mechanism. Thus, in the literature, there are numerous studies that propose solutions to the job/data scheduling, data replication, and advance reservation problems. In these studies, a number of simulators, emulators, or test beds have been used to evaluate the proposed algorithms. Furthermore, these simulators/emulators usually adopt fixed-grid models, which in turn dictate specific job/data scheduling and data replication mechanisms. In the literature, there is no unified framework for modeling grid systems with different architectures, which can allow researchers to develop new grid system models and evaluate them in a flexible manner. This paper presents a unique framework for modeling real-time data grid systems that attempts to unify a large class of job scheduling, data scheduling, and data replication algorithms based on several system services. Then, in order to enable the development of these algorithms under different system models, DGridSim is realized to be a multi-model discrete-event simulator, and its capabilities are exemplified by means of a set of simulation results. The main contribution of the research is DGridSim, which can model and simulate a variety of different data grid system models by means of several system services and their interactions.

Стилі APA, Harvard, Vancouver, ISO та ін.

23

Shi, Lei, Jing Xu, Lunfei Wang, Jie Chen, Zhifeng Jin, Tao Ouyang, Juan Xu, and Yuqi Fan. "Multijob Associated Task Scheduling for Cloud Computing Based on Task Duplication and Insertion." Wireless Communications and Mobile Computing 2021 (April 28, 2021): 1–13. http://dx.doi.org/10.1155/2021/6631752.

Повний текст джерела

Анотація:

With the emergence and development of various computer technologies, many jobs processed in cloud computing systems consist of multiple associated tasks which follow the constraint of execution order. The task of each job can be assigned to different nodes for execution, and the relevant data are transmitted between nodes to complete the job processing. The computing or communication capabilities of each node may be different due to processor heterogeneity, and hence, a task scheduling algorithm is of great significance for job processing performance. An efficient task scheduling algorithm can make full use of resources and improve the performance of job processing. The performance of existing research on associated task scheduling for multiple jobs needs to be improved. Therefore, this paper studies the problem of multijob associated task scheduling with the goal of minimizing the jobs’ makespan. This paper proposes a task Duplication and Insertion algorithm based on List Scheduling (DILS) which incorporates dynamic finish time prediction, task replication, and task insertion. The algorithm dynamically schedules tasks by predicting the completion time of tasks according to the scheduling of previously scheduled tasks, replicates tasks on different nodes, reduces transmission time, and inserts tasks into idle time slots to speed up task execution. Experimental results demonstrate that our algorithm can effectively reduce the jobs’ makespan.

Стилі APA, Harvard, Vancouver, ISO та ін.

24

Jackofsky, Ellen F., and Lawrence H. Peters. "Part-time versus full-time employment status differences: A replication and extension." Journal of Organizational Behavior 8, no. 1 (January 1987): 1–9. http://dx.doi.org/10.1002/job.4030080102.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

25

NANDAGOPAL, MALARVIZHI, S. GAJALAKSHMI, and V. RHYMEND UTHARIARAJ. "SCHEDULING WITH JOB CHECKPOINT IN COMPUTATIONAL GRID ENVIRONMENT." International Journal of Modeling, Simulation, and Scientific Computing 02, no. 03 (September 2011): 299–316. http://dx.doi.org/10.1142/s1793962311000517.

Повний текст джерела

Анотація:

Computational grids have the potential for solving large-scale scientific applications using heterogeneous and geographically distributed resources. In addition to the challenges of managing and scheduling these applications, reliability challenges arise because of the unreliable nature of grid infrastructure. Two major problems that are critical to the effective utilization of computational resources are efficient scheduling of jobs and providing fault tolerance in a reliable manner. This paper addresses these problems by combining the checkpoint replication based fault tolerance mechanism with minimum total time to release (MTTR) job scheduling algorithm. TTR includes the service time of the job, waiting time in the queue, transfer of input and output data to and from the resource. The MTTR algorithm minimizes the response time by selecting a computational resource based on job requirements, job characteristics, and hardware features of the resources. The fault tolerance mechanism used here sets the job checkpoints based on the resource failure rate. If resource failure occurs, the job is restarted from its last successful state using a checkpoint file from another grid resource. Globus ToolKit is used as the grid middleware to set up a grid environment and evaluate the performance of the proposed approach. The monitoring tools Ganglia and Network Weather Service are used to gather hardware and network details, respectively. The experimental results demonstrate that, the proposed approach effectively schedule the grid jobs with fault-tolerant way thereby reduces TTR of the jobs submitted in the grid. Also, it increases the percentage of jobs completed within specified deadline and making the grid trustworthy.

Стилі APA, Harvard, Vancouver, ISO та ін.

26

Liao, ChenHan, Na Helian, Sining Wu, and Mamunur M. Rashid. "Predictive File Replication on the Data Grids." International Journal of Grid and High Performance Computing 2, no. 1 (January 2010): 69–86. http://dx.doi.org/10.4018/jghpc.2010092805.

Повний текст джерела

Анотація:

Most replication methods either monitor the popularity of files or use complicated functions to calculate the overall cost of whether or not a replication decision or a deletion decision should be issued. However, once the replication decision is issued, the popularity of the files is changed and may have already impacted access latency and resource usage. This article proposes a decision-tree-based predictive file replication strategy that forecasts files’ future popularity based on their characteristics on the Grids. The proposed strategy has shown superb performance in terms of mean job time and effective network usage compared with the other two replication strategies, LRU and Economic under OptorSim simulation environment.

Стилі APA, Harvard, Vancouver, ISO та ін.

27

Alsaih, Mohammed A., Rohaya Latip, Azizol Abdullah, Shamala K. Subramaniam, and Kamal Ali Alezabi. "Dynamic Job Scheduling Strategy Using Jobs Characteristics in Cloud Computing." Symmetry 12, no. 10 (October 6, 2020): 1638. http://dx.doi.org/10.3390/sym12101638.

Повний текст джерела

Анотація:

A crucial performance concern in distributed decentralized environments, like clouds, is how to guarantee that jobs complete their execution within the estimated completion times using the available resources’ bandwidth fairly and efficiently while considering the resource performance variations. Formerly, several models including reservation, migration, and replication heuristics have been implemented to solve this concern under a variety of scheduling techniques; however, they have some undetermined obstacles. This paper proposes a dynamic job scheduling model (DTSCA) that uses job characteristics to map them to resources with minimum execution time taking into account utilizing the available resources bandwidth fairly to satisfy the cloud users quality of service (QoS) requirements and utilize the providers’ resources efficiently. The scheduling algorithm makes use of job characteristics (length, expected execution time, expected bandwidth) with regards to available symmetrical and non-symmetrical resources characteristics (CPU, memory, and available bandwidth). This scheduling strategy is based on generating an expectation value for each job that is proportional to how these job’s characteristics are related to all other jobs in total. That should make their virtual machine choice closer to their expectation, thus fairer. It also builds a feedback method which deals with reallocation of failed jobs that do not meet the mapping criteria.

Стилі APA, Harvard, Vancouver, ISO та ін.

28

Corbett, J. Martin, Robin Martin, Toby D. Wall, and Chris W. Clegg. "Technological coupling as a predictor Note of intrinsic job satisfaction: A replication study." Journal of Organizational Behavior 10, no. 1 (January 1989): 91–95. http://dx.doi.org/10.1002/job.4030100108.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

29

Evans, Martin G., and Daniel A. Ondrack. "The Role of Job Outcomes and Values in Understanding the Union's Impact on Job Satisfaction: A Replication." Human Relations 43, no. 5 (May 1990): 401–18. http://dx.doi.org/10.1177/001872679004300501.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

30

Lash, Timothy L., Lindsay J. Collin, and Miriam E. Van Dyke. "The Replication Crisis in Epidemiology: Snowball, Snow Job, or Winter Solstice?" Current Epidemiology Reports 5, no. 2 (April 12, 2018): 175–83. http://dx.doi.org/10.1007/s40471-018-0148-x.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

31

Nazir, Babar, Kalim Qureshi, and Paul Manuel. "Replication based fault tolerant job scheduling strategy for economy driven grid." Journal of Supercomputing 62, no. 2 (April 12, 2012): 855–73. http://dx.doi.org/10.1007/s11227-012-0756-z.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

32

Wang, Chao, Zhe Zhang, Xiaosong Ma, Sudharshan S. Vazhkudai, and Frank Mueller. "Improving the availability of supercomputer job input data using temporal replication." Computer Science - Research and Development 23, no. 3-4 (May 6, 2009): 149–57. http://dx.doi.org/10.1007/s00450-009-0082-8.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

33

Smith, Carlla S., and Michael T. Brannick. "A role and expectancy model of participative decision-making: A replication and theoretical extension." Journal of Organizational Behavior 11, no. 2 (March 1990): 91–104. http://dx.doi.org/10.1002/job.4030110202.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

34

Saleh, Alireza, Reza Javidan, and Mohammad Taghi FatehiKhajeh. "A four-phase data replication algorithm for data grid." Journal of Advanced Computer Science & Technology 4, no. 1 (April 12, 2015): 163. http://dx.doi.org/10.14419/jacst.v4i1.4009.

Повний текст джерела

Анотація:

<p>Nowadays, scientific applications generate a huge amount of data in terabytes or petabytes. Data grids currently proposed solutions to large scale data management problems including efficient file transfer and replication. Data is typically replicated in a Data Grid to improve the job response time and data availability. A reasonable number and right locations for replicas has become a challenge in the Data Grid. In this paper, a four-phase dynamic data replication algorithm based on Temporal and Geographical locality is proposed. It includes: 1) evaluating and identifying the popular data and triggering a replication operation when the popularity data passes a dynamic threshold; 2) analyzing and modeling the relationship between system availability and the number of replicas, and calculating a suitable number of new replicas; 3) evaluating and identifying the popular data in each site, and placing replicas among them; 4) removing files with least cost of average access time when encountering insufficient space for replication. The algorithm was tested using a grid simulator, OptorSim developed by European Data Grid Projects. The simulation results show that the proposed algorithm has better performance in comparison with other algorithms in terms of job execution time, effective network usage and percentage of storage filled.</p>

Стилі APA, Harvard, Vancouver, ISO та ін.

35

Taheri, Javid, Albert Y. Zomaya, Pascal Bouvry, and Samee U. Khan. "Hopfield neural network for simultaneous job scheduling and data replication in grids." Future Generation Computer Systems 29, no. 8 (October 2013): 1885–900. http://dx.doi.org/10.1016/j.future.2013.04.020.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

36

Bakker, Arnold B., Hetty Van Emmerik, and Pim Van Riet. "How job demands, resources, and burnout predict objective performance: A constructive replication." Anxiety, Stress & Coping 21, no. 3 (July 2008): 309–24. http://dx.doi.org/10.1080/10615800801958637.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

37

Johnston, Mark W., A. Parasuraman, Charles M. Futrell, and Jeffrey Sager. "Performance and job satisfaction effects on salesperson turnover: A replication and extension." Journal of Business Research 16, no. 1 (January 1988): 67–83. http://dx.doi.org/10.1016/0148-2963(88)90081-1.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

38

Elango, P., K. Kuppusamy, and N. Prabhu. "Data Replication Using Data Mining Techniques." Asian Journal of Computer Science and Technology 8, S1 (April 22, 2021): 107–9. http://dx.doi.org/10.51983/ajcst-2019.8.s1.1939.

Повний текст джерела

Анотація:

Database Replication is the successive electronic duplicating of information from a database in one PC or server to a database in another with the goal that all clients share a similar dimension of data. The outcome is a conveyed database in which clients can get to information significant to their assignments without meddling with crafted by others. Anyway information replication is an entrancing theme for both hypothesis and practice. On the hypothetical side, numerous solid outcomes requirement what should be possible as far as consistency: e.g., the difficulty of achieving agreement in offbeat frameworks the blocking idea of CAP hypothesis, and the requirement for picking an appropriate rightness foundation among the numerous conceivable. On the pragmatic side, information replication assumes a key job in a wide scope of settings like storing, back-up, high accessibility, wide territory content dissemination, expanding versatility, parallel preparing, and so forth. Finding a replication arrangement that is reasonable in whatever number such settings as could reasonably be expected remains an open test.

Стилі APA, Harvard, Vancouver, ISO та ін.

39

Zhao, Genliang, and Zhe Xue. "HR Management Big Data Mining Based on Computational Intelligence and Deep Learning." International Journal of Antennas and Propagation 2021 (October 23, 2021): 1–13. http://dx.doi.org/10.1155/2021/1657236.

Повний текст джерела

Анотація:

Decomposing the structure of a large number of existing posts through data mining will greatly improve the effect of enterprise human resource structure optimization. To this end, this paper proposes an end-to-end competency-aware job requirement generation framework to automate the job requirement generation, and the prediction based on competency themes can realize the skill prediction in job requirements. Then an encoder-decoder LSTM is proposed to implement job requirement generation, and a competency-aware attention mechanism and a replication mechanism are proposed to guide the generation process to ensure that the generated job requirement descriptions comprehensively cover the relevant and representative competency and job skill requirements. A competency-aware strategy gradient training algorithm is then proposed to further enhance the rationality of the generated job requirement descriptions. Finally, extensive experiments on real-world HR data sets clearly validate the effectiveness and interpretability of the proposed framework and its variants compared to state-of-the-art benchmarks.

Стилі APA, Harvard, Vancouver, ISO та ін.

40

Müller, Günter F. "Dimensions of Self-Leadership: A German Replication and Extension." Psychological Reports 99, no. 2 (October 2006): 357–62. http://dx.doi.org/10.2466/pr0.99.2.357-362.

Повний текст джерела

Анотація:

In a sample of 167 German students three dimensions of self-leadership, i.e., constructive thoughts, natural reward creation, and proactive behavior, were replicated as when scale values of a German self-leadership questionnaire were subjected to confirmatory factor analysis very satisfactory fit-indices were obtained. In addition, dimensions of self-leadership correlated with entrepreneurial trait disposition (multiple R = 0.46, p <.01), and entrepreneurial job orientation (multiple R = 0.23, p < .05). Conclusions for further research and practical applications are discussed.

Стилі APA, Harvard, Vancouver, ISO та ін.

41

Lin, Jia-Chun, Fang-Yie Leu, and Ying-Ping Chen. "Analyzing job completion reliability and job energy consumption for a heterogeneous MapReduce cluster under different intermediate-data replication policies." Journal of Supercomputing 71, no. 5 (September 11, 2014): 1657–77. http://dx.doi.org/10.1007/s11227-014-1286-7.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

42

Wright, Thomas A., and Dennis A. Sweeney. "The call for an increased role of replication, extension, and mixed-methods study designs in organizational research." Journal of Organizational Behavior 37, no. 3 (October 27, 2015): 480–86. http://dx.doi.org/10.1002/job.2059.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

43

Weaver, Charles N. "Black-White Differences in Job Preferences: 16 Years Later." Psychological Reports 71, no. 3_suppl (December 1992): 1087–90. http://dx.doi.org/10.2466/pr0.1992.71.3f.1087.

Повний текст джерела

Анотація:

Replication of an analysis of nationally representative data from 1973–1974 showed that 16 years later there have been no significant changes in the pattern of differences between what black and white male employees ( ns = 1500) say they want most in a job. In comparison to white employees, black men continued to be more likely to prefer high income and less likely to prefer meaningful work that gives a feeling of accomplishment. This result suggests that the many considerable government efforts in recent decades to affect the economic status of blacks have had little influence on this dimension of their work attitudes.

Стилі APA, Harvard, Vancouver, ISO та ін.

44

Karnes, Frances A., and J. Christopher McGinnis. "Persons Who Most Impress Gifted Youth: A Replication." Psychological Reports 74, no. 3 (June 1994): 851–57. http://dx.doi.org/10.2466/pr0.1994.74.3.851.

Повний текст джерела

Анотація:

A replication of a study of the persons who most impressed gifted youth was conducted with 95 students enrolled in a summer residential program for the gifted. Students were asked to indicate the person who most impressed them and to include the reason(s) for choosing that person. The most frequently chosen category of individuals was family members (61.1%), then a tie between persons in the world of arts and culture and persons doing a specific job (8.4%), another tie between comrades and sports stars (6.3%), followed by political or historical figures (4.2%), themselves (3.2%), and moral and religious personalities (2.1%). Consistent with the 1982 study by Karnes and Lee, most impressive to these students were family members and least impressive moral and religious personalities.

Стилі APA, Harvard, Vancouver, ISO та ін.

45

Frayne, Colette A., and Gary P. Lathan. "Self-Management Training for Increasing Job Attendance: A Follow-up and a Replication." Academy of Management Proceedings 1988, no. 1 (August 1988): 206–10. http://dx.doi.org/10.5465/ambpp.1988.4980543.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

46

Jolfaei, Fatemeh. "Improvement of Job Scheduling and Tow Level Data Replication Strategies in Data Grid." International Journal of Mobile Network Communications & Telematics 2, no. 3 (June 30, 2012): 21–36. http://dx.doi.org/10.5121/ijmnct.2012.2303.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

47

Nazir, Babar, Faiza Ishaq, Shahaboddin Shamshirband, and Anthony Chronopoulos. "The Impact of the Implementation Cost of Replication in Data Grid Job Scheduling." Mathematical and Computational Applications 23, no. 2 (May 25, 2018): 28. http://dx.doi.org/10.3390/mca23020028.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

48

., S. K. Aparnaa. "AN ENHANCED ADAPTIVE SCORING JOB SCHEDULING ALGORITHM WITH REPLICATION STRATEGY IN GRID ENVIRONMENT." International Journal of Research in Engineering and Technology 03, no. 04 (April 25, 2014): 680–84. http://dx.doi.org/10.15623/ijret.2014.0304120.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

49

Golembiewski, Robert T., Robert Boudreau, Keiichi Goto, and Tadamasa Murai. "TRANSNATIONAL PERSPECTIVES ON JOB BURNOUT: REPLICATION OF PHASE MODEL RESULTS AMONG JAPANESE RESPONDENTS." International Journal of Organizational Analysis 1, no. 1 (January 1993): 7–27. http://dx.doi.org/10.1108/eb028781.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

50

Latham, Gary P., and Colette A. Frayne. "Self-management training for increasing job attendance: A follow-up and a replication." Journal of Applied Psychology 74, no. 3 (1989): 411–16. http://dx.doi.org/10.1037/0021-9010.74.3.411.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!