Filters








3,380 Hits in 5.7 sec

TARDIS: Time And Relative Delays In Simulation [article]

Carsten Baum, Bernardo David, Rafael Dowsley, Jesper Buus Nielsen, Sabine Oechsner
2020 IACR Cryptology ePrint Archive  
This work introduces an extension of the UC framework with an abstract notion of time that allows for modeling relative delays in communication and sequential computation without requiring parties to keep  ...  commitments) in the UC setting and showing how to realize it in the restricted programmable and observable global random oracle model; (3) showing that UC time-lock puzzles yield UC-secure fair coin flips  ...  relies on the relative delays in computation and communication.  ... 
dblp:journals/iacr/BaumDDNO20 fatcat:rls6nmcdmncm3bds3vzlo6u6uq

Tardis

Earl T. Barr, Mark Marron
2014 Proceedings of the 2014 ACM International Conference on Object Oriented Programming Systems Languages & Applications - OOPSLA '14  
TARDIS realizes our design: it provides affordable time-travel with an average overhead of only 7% during normal execution, a rate of 0.6 MB/s of history logging, and a worst-case 0.68s time-travel latency  ...  TARDIS can also debug optimized code using time-travel to reconstruct state.  ...  To time-travel, we restore the nearest snapshot that precedes the time-travel Figure 1 . TARDIS running the BH n-body simulation benchmark.  ... 
doi:10.1145/2660193.2660209 dblp:conf/oopsla/BarrM14 fatcat:exhjjwvpjzal3hczzvnlnhdvpa

Tardis

Earl T. Barr, Mark Marron
2014 SIGPLAN notices  
TARDIS realizes our design: it provides affordable time-travel with an average overhead of only 7% during normal execution, a rate of 0.6 MB/s of history logging, and a worst-case 0.68s time-travel latency  ...  TARDIS can also debug optimized code using time-travel to reconstruct state.  ...  To time-travel, we restore the nearest snapshot that precedes the time-travel Figure 1 . TARDIS running the BH n-body simulation benchmark.  ... 
doi:10.1145/2714064.2660209 fatcat:jfeulltt4nbzlal4ihe2vgjuwe

Minimizing Tardiness Penalty Costs in Job Shop Scheduling Under Maximum Allowable Tardiness

Jae-Gon Kim, Hong-Bae Jun, June-Young Bang, Jong-Ho Shin, Seong-Hoon Choi
2020 Processes  
Customers may cancel their orders and request compensation for damages, for breach of contract, when the delivery time is expected to exceed maximum allowable tardiness, whereas they may accept the delayed  ...  In many manufacturing or service industries, there exists maximum allowable tardiness for orders, according to purchase contracts between the customers and suppliers.  ...  Acknowledgments: This work was supported by Incheon National University (International Cooperative) Research Grant in 2019. Conflicts of Interest: The authors declare no conflict of interest.  ... 
doi:10.3390/pr8111398 fatcat:3ko4tqaxwvbydbsudkwsqcfj7i

Tardy Flow Scheduling in Data Center Networks

Gyuyeong KIM, Wonjun LEE
2016 IEICE transactions on information and systems  
We propose two tardy flow scheduling algorithms and show that our work offers significant performance gains through performance analysis and simulations.  ...  Query response times are critical for cluster computing applications in data centers.  ...  flows 6: end if 7: end for 8: Queue Q ← H ∪ L Set of flows to schedule at a time 9: return Q.Front() Table 1 1 Mean and the 99.9th percentile query response times (ms) in ns-3 simulations.  ... 
doi:10.1587/transinf.2016edl8038 fatcat:7wbwxqlbkngubjohdz33w4ppv4

A Tardy Uptake

Anne Freadman
2020 Canadian Journal for Studies in Discourse and Writing/Rédactologie  
I consider an ambiguity at the heart of this concept of exigence between the work it does in accounting for punctual rhetorical action—the genre in actu—and its work in generalizing over some genre in  ...  The site of this mediation is now referred to as the subject—a term that is imported from psychoanalysis and critical social theory.  ...  Acknowledgements This paper had its genesis in a series of workshops conducted with Carolyn Miller in Melbourne, and the conversations we had following the sessions.  ... 
doi:10.31468/cjsdwr.781 fatcat:nv3fmsjqy5e7jbeusiqvwdfzum

Tardiness heuristic for scheduling Flexible Manufacturing Systems

ALI S. KIRAN, SEMA ALPTEKIN, A. CELAL KAPLAN
1991 Production planning & control (Print)  
To be able to respond to these The results of these simulation studies arc summarized. changes effectively, a scheduling system must be able to develop new feasible schedules in a short time.  ...  The proposed algorithm has been operations, changes in demand, customer priorities and implemented in this simulated cnvironmenL After fme tuning the algorithm, it has been tested in various shop conditions  ...  Acknowledgment The authors are indebted to Selcuk Karabati for his help In coding and running computer programs. This work was partially supported by the National Science Foundation under  ... 
doi:10.1080/09537289108919351 fatcat:av6do3gukrggrc2ddnbqrkgk3q

Minimizing total tardiness in no-wait flowshops

Tariq Aldowaisan, Ali Allahverdi
2012 Foundations of Computing and Decision Sciences  
This achieves at least 50% improvement in the SA and GA performances.  ...  We identify through computational experiments the best performing dispatching rule; and then propose simulated annealing (SA) and genetic algorithms (GA) by using the best performing dispatching rule as  ...  The value 0.10 was selected since it gave the best average total tardiness. The tested and selected values for the parameters of the improved simulated annealing are given in Table 1 .  ... 
doi:10.2478/v10209-011-0009-6 fatcat:xbe2utlopzechovphtlinunicy

Reducing Tardiness under Global Scheduling by Splitting Jobs

Jeremy P. Erickson, James H. Anderson
2013 2013 25th Euromicro Conference on Real-Time Systems  
Under current analysis, tardiness bounds applicable to global earliest-deadline-first scheduling and related policies depend on per-task worst-case execution times.  ...  This study shows that despite practical issues affecting job splitting, it can still yield substantial reductions in tardiness bounds.  ...  This delay is referred to as release overhead, denoted rel (after time 18) in Fig. 4 . 3.  ... 
doi:10.1109/ecrts.2013.13 dblp:conf/ecrts/EricksonA13 fatcat:zozujxdkwbekfd3hr5tnxpc2oe

Estimating customer delay and tardiness sensitivity from periodic queue length observations [article]

Liron Ravner, Jiesen Wang
2022 arXiv   pre-print
The costs are proportional to the waiting time and the tardiness with rates α and β, respectively.  ...  A single server commences its service at time zero every day. A random number of customers decide when to arrive to the system so as to minimize the waiting time and tardiness costs.  ...  Acknowledgments The authors would like to thank Peter Taylor for his valuable comments and advice. J.  ... 
arXiv:2105.06192v2 fatcat:xqm7tb3tkvgwfcksgomyfblgia

No-Wait Flowshops to Minimize Total Tardiness with Setup Times

Tariq Aldowaisan, Ali Allahverdi
2015 Intelligent Control and Automation  
The m-machine no-wait flowshop scheduling problem is addressed where setup times are treated as separate from processing times. The objective is to minimize total tardiness.  ...  Two heuristics, a simulated annealing (SA) and a genetic algorithm (GA), have been proposed by using the best performing dispatching rule as the initial solution for SA, and the three superior dispatching  ...  In many practical situations, the cost increases with the delay duration. This increase may take the form of financial penalties corresponding to different time period delays.  ... 
doi:10.4236/ica.2015.61005 fatcat:ryb7tsiorjgkxn533d4rtie76m

Impact of Network Dynamics on Tardiness of Data in Sensor Networks

Tarun Banka, Anura P. Jayasumana
2007 2007 2nd International Conference on Communication Systems Software and Middleware  
on tardiness, and hence the application in real-time sensor networks.  ...  Impact of random delays and losses in sensor networks manifests in the form of tardiness of data used for processing at the sink nodes.  ...  In Fig. 3 , relative larger area of trapezoid indicates greater tardiness compared to Fig. 2 .  ... 
doi:10.1109/comswa.2007.382433 dblp:conf/comsware/BankaJ07 fatcat:wks7xdqpe5brdbdqz5vxvwf3de

Robust Resource Investment Problem with Time-Dependent Resource Cost and Tardiness Penalty

A. Hattab, M. Haouari
2016 2016 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM)  
RIP helps to decide the amount of investment in resources that yield the optimal solution, in addition to the optimal tradeoff between completion time and resource investment.  ...  The work done in this thesis can be extended in future by applying more robustness measures to assess the solution robustness and not only the quality robustness.  ...  The time performance of the algorithm can be improved by replacing the MIP model by any efficient heuristic. This will make the algorithm more capable to solve larger instances as well.  ... 
doi:10.1109/ieem.2016.7798166 fatcat:webplfw3yvgoxk4svtigacs6gy

Correlation among tardiness-based measures for scheduling using priority dispatching rules

Nasser Mebarki, Atif Shahzad
2013 International Journal of Production Research  
The documents may come from teaching and research institutions in France or abroad, or from public or private research centers.  ...  HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not.  ...  The arrival of jobs in the system is modeled as a Poisson process and are simulated over long time periods.  ... 
doi:10.1080/00207543.2012.762131 fatcat:yjt5k2k2rbfqvee4l3acvyk6cq

Tardiness based new dispatching rules for shop scheduling with unreliable machines

A. Singh
2005 International Journal of Simulation Modelling  
Simulation results indicate that shop loading, breakdown level and mean time to repair are important parameters for the selection of an appropriate rule in a shop.  ...  Mean tardiness, maximum tardiness and the number of tardy jobs objectives have been used to evaluate the performance of each dispatching rule.  ...  The expected tardiness is a relative measure of how much tardiness a job might experience if it is delayed by one time unit.  ... 
doi:10.2507/ijsimm04(1)1.036 fatcat:xctiiqkctjgp3gjol2h2xif4na
« Previous Showing results 1 — 15 out of 3,380 results