Sign inSubmit
Tips: “quotes” for a phrase · author:Lee · a DOI goes straight to its article

20 articles for “Deadline”
Set a search alert
Also matching:70 special issues
Research ArticleOpen accessEvery word in the titleCost-Efficient Deadline Constrained Scientific Workflow Scheduling in Infrastructure-as-a-Service Clouds by Disqualifying Tasks with AnomaliesAnver Shahabdeen Rahumath, Santhosh Rajendran, Natarajan Mohanasundaram, Abdul Rahiman MalangaiCloud computing has transformed the way businesses and consumers think about their data and businesses. As a result, cloud computing is described as the on-demand availability of all computer system resources via the Internet as a paid service. Enhancing security is a major problem in cloud computing, which is also a major research topic because data is stored and processed … …Journal of Computer Science, Vol. 18, Issue 6 · 27 Jun 2022 · 5,793 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleA Frame Study for Post-Processing Analysis on System Behavior: A Case Study of Deadline Miss DetectionJunghee Lee, Jongman KimProblem statement: A lot of data can be obtained by system simulation using transaction level models without affecting the performance of the system. Due to huge amount of the raw data, we often need to post-process them to extract valuable information. Profiling capabilities of commercial tools provide predefined functionalities and don’t allow users to add or modify for their own … …Journal of Computer Science, Vol. 6, Issue 12 · 22 Nov 2010 · 6,741 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleExplicit Allocation Strategy with Deadline and Budget Constraint Algorithm in Bag of Tasks GridM. Suresh Kumar, T. PurusothamanProblem statement: This study is for effective scheduling of grid jobs based on economy for space shared resources in Bag of tasks grid. Grid Computing aims in combining the power of heterogeneous, geographically distributed, multi-domain computational resources to provide high performance or high throughput. Approach: Space shared resources are parallel supercomputers and clusters of workstations that provides a great amount … …Journal of Computer Science, Vol. 8, Issue 7 · 7 Jun 2012 · 6,229 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleAdaptive Update Policy for Proactive Management of Deadline Miss Ratio and Data Freshness in Real-Time Database ModelsSanjay Tanwani, Ashwani K. RamaniImportant applications, like e-commerce, online stock trading, traffic control demand real-time data services. Conventional database perform poor at these applications. A database for real-time data services has to support timing constraints and temporal consistency in addition to supporting characteristics of a conventional database system. In other words, it is desirable to execute transactions within its deadline using updated data reflecting … …Journal of Computer Science, Vol. 1, Issue 4 · 31 Dec 2005 · 6,207 accessesView PDFCite
Research ArticleOpen accessIn the keywordsIMPROVING QUALITY OF SERVICE IN IP NETWORKS FOR MULTIMEDIA APPLICATIONS WITH OPTIMAL FRAGMENTATIONK. Sasi Kala Rani, J. SuganthiThe tremendous increase of Internet users and the wide ranging need to support both multimedia traffic and other traffic leads to service differentiation schemes. Multimedia applications have uncompromising and strict deadlines and the packets are worthless if they arrive late than their associated deadlines. The aim of the proposed system is to improve the quality of service by increasing the … …Journal of Computer Science, Vol. 10, Issue 7 · 17 Jun 2014 · 6,613 accessesView PDFCite
Research ArticleOpen accessIn the keywordsDYNAMIC PLANNING BASED SCHEDULING APPROACH FOR WIRELESS SENSOR NETWORKSM. Senthil Kumaran, R. RangarajanEnergy efficiency is an important issue in wireless sensor networks. A sensor node has a microprocessor and a small amount of memory for signal processing and task scheduling. Dynamic Planning is a method is used in this approach it combines the flexibility of dynamic scheduling with the predictability offered by schedulabilty check. Whenever a node wants to transmit data packet … …Journal of Computer Science, Vol. 9, Issue 10 · 5 Sep 2013 · 6,819 accessesView PDFCite
Research ArticleOpen accessIn the abstractFeasibility Analysis of Non-Preemptive Periodic Systems from Infeasibility PerspectiveNasro Min-AllahDue to simple implementation, non-preemptive scheduling has the advantage over preemptive counterpart when it comes to deployment of real-time systems. Accordingly, many feasibility techniques have been established to answer schedulability of the task set for non-preemptive case. The time complexity of exact condition for non-preemptive under dynamic priority assignment is of pseud-polynomial nature. Recently, efforts are made to decrease the … …Journal of Computer Science, Vol. 15, Issue 9 · 9 Sep 2019 · 7,617 accessesView PDFCite
Research ArticleOpen accessIn the abstractSecure Selection of Multiple Resources Based on Virtual Private Network for Computational GridsG. Kavitha, V. SankaranarayananProblem statement: Grid computing provides a virtual framework for controlled sharing of resources across institutional boundaries. In computational grids, a client application is executed on the available set of resources that satisfy the user QoS requirements. Some applications require exhaustive computation power for execution of its tasks. In general, these tasks are assigned to a single available resource on the … …Journal of Computer Science, Vol. 7, Issue 12 · 22 Oct 2011 · 7,607 accessesView PDFCite
Research ArticleOpen accessIn the abstractAnalysis of Hierarchical Diff-EDF Schedulability over Heterogeneous Real-Time Packet NetworksMoutaz Saleh, Zulaiha Ali OthmanPacket networks are currently enabling the integration of traffic with a wide range of characteristics that extend from video traffic with stringent QoS requirements to the best-effort traffic requiring no guarantees. QoS guarantees can be provided in conventional packet networks by the use of proper packet scheduling algorithms. As a computer revolution, many scheduling algorithms have been proposed to provide … …Journal of Computer Science, Vol. 3, Issue 9 · 30 Sep 2007 · 6,530 accessesView PDFCite
Research ArticleOpen accessIn the abstractRobustness Results for Hierarchical Diff-EDF Scheduling upon Heterogeneous Real-Time Packet NetworksMoutaz Saleh, Zulaiha Ali OthmanPacket networks are currently enabling the integration of traffic with a wide range of characteristics that extend from video traffic with stringent QoS requirements to the best-effort traffic requiring no guarantees. QoS guarantees can be provided in conventional packet networks by the use of proper packet scheduling algorithms. As a computer revolution, many scheduling algorithms have been proposed to provide … …Journal of Computer Science, Vol. 3, Issue 5 · 31 May 2007 · 6,601 accessesView PDFCite