Where results make sense

About us   |   Why use us?   |   Reviews   |   PR   |   Contact us

Topic: Scheduling (computing)

    Note: these results are not from the primary (high quality) database.

Ads by Google

In the News (Sun 15 Nov 09)

Northern Trust

Marvin Harrison

Peter Chernin

Gary Locke

Match Play

Penelope Cruz

Mickey Rourke

AR Rahman

Danny Boyle

Hugh Jackman

reading-group.bib Parallel Programming Symposium (IPPS'99), Workshop on Java for Distributed Computing}, MONTH = {April}, YEAR = {1999}, } % Paper Summary % % Process networks are described as an abstraction for metacomputing and % their use is demonstrated in a Geographical Information System. The different strategies surveyed in the paper are % {\it static chunking}, {\it self-scheduling}, {\it fixed-size chunking}, % {\it guided self-scheduling}, {\it trapezoid self-scheduling}, % {\it factoring}, % {\it TAPER}. Scheduling is done in a work % queue manner such that processes are started when there is data available in % their queue (so that scheduling is dynamic). www-cse.ucsd.edu /groups/hpcl/apples/pubs/reading-group.bib

Amazon.com: Hard Real-Time Computing Systems (The International Series in Engineering and Computer Science): Books After introducing the basic concepts of real-time computing, the book covers such topics as taxonomy of scheduling algorithms, models of tasks with explicit time constraints, handling tasks with precedence relations, periodic and aperiodic task scheduling, access protocols to shared resources, asynchronous communication mechanisms, schedulability analysis, and handling overload conditions. Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications was written for use as a textbook and serves as an excellent reference for those interested in real-time computing for designing and/or developing predictable control applications, which may include robotics, plant control, monitoring systems, data acquisition, simulations of real-world systems, virtual reality, interactive games, etc. Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications is a basic treatise on real-time computing, with particular emphasis on predictable scheduling algorithms. www.amazon.com /exec/obidos/tg/detail/-/0792399943?v=glance   (1169 words)

Introduction to Enterprise Job Scheduling :: www.nextslm.org: The Service Level Management Learning Community Several computing job scheduling architectures have emerged for heterogeneous, distributed environments: collaborative; master and agent; and variations of master and agent which include master, submaster, agent, and console, master and agent. Job scheduling comprises one of the most important components in a production-computing environment. With the large distributed computing environments, some job schedulers have not scaled to meet the challenges of enterprise computing. www.nextslm.org /jobscheduling.shtml   (2421 words)

Rajkumar Buyya's Home Page Scheduling Parameter Sweep Applications on Global Grids: A Deadline and Budget Constrained Cost-Time Optimisation Algorithm, International Journal of Software: Practice and Experience, Wiley Press, USA (accepted in Aug. 2004 and in print). I have also involved in Gradens Adaptive Parallel Computing Cluster Monitoring System, which allows the monitoring of tasks, task properties, heap usage, etc. during the execution of programs (written using Oberon-based parallel language) on Gardens cluster. Task Force Chairs Message, 2nd IEEE International Conference on Cluster Computing (Cluster 2000), (IEEE Computer Society Press,) November 28 - December 1, 2000, Germany. www.buyya.com /cv.html   (2421 words)

Dr. Rajkumar Buyya's Home Page Tianchi Ma and Rajkumar Buyya, Critical-Path and Priority based Algorithms for Scheduling Workflows with Parameter Sweep Tasks on Global Grids, Proceedings of the 17th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD 2005, IEEE CS Press, Los Alamitos, CA, USA), Oct. 24-27, 2005, Rio de Janeiro, Brazil. Economic-based Distributed Resource Management and Scheduling for Grid Computing, Ph.D. Thesis, Monash University, Melbourne, Australia, April 12, 2002. Nature's Heuristics for Scheduling Jobs on Computational Grids, The 8th IEEE International Conference on Advanced Computing and Communications (ADCOM 2000), December 14-16, 2000, Cochin, India. www.buyya.com /cv.html   (12381 words)

adv-pgm-srmcc Stochastic Scheduling of a Meta-task in Heterogeneous Distributed Computing Workshop on Scheduling and Resource Management for Cluster Computing Comparison of Contention Aware List Scheduling Heuristics for Cluster Computing www.cse.ohio-state.edu /~saday/srmcc01.html   (12381 words)

Request for Services for Faculty at the University of Pittsburgh To have a course permanently assigned to a computer lab or TRC for scheduling purposes, the request must be submitted to the registrar’s office through a Department Chairperson when courses are committed for scheduling. Classrooms in the campus computing lab system are available for reservations. Laptop computers and portable video projectors are available for loan to students, faculty and staff for class presentations, workshops and conferences. www.pitt.edu /~upjlabs/servicesFaculty.html   (445 words)

ccgrid,3rd International Symposium on Cluster Computing and the Grid In Data Grid environment, effective scheduling mechanism considering both computational and data storage resources must be provided for large scale data intensive applications. In this paper, we describe new scheduling model that considers both amount of computational resources and data availability in Data Grid environment. Chameleon shows performance improvements in data intensive applications that require both large number of processors and data replication mechanisms. csdl2.computer.org /persagen/DLAbsToc.jsp?resourcePath=/dl/proceedings/&toc=comp/proceedings/ccgrid/2003/1919/00/1919toc.xml&DOI=10.1109/CCGRID.2003.1199376   (445 words)

Explicitly Parallel Instruction Computing - Wikipedia, the free encyclopedia Explicitly Parallel Instruction Computing ('EPIC) is a computing paradigm that began to be researched in the 1990s. One goal is to move the complexity of dynamic scheduling of multiple instruction issue from the hardware implementation to the compiler, which can do the instruction scheduling statically (with help of trace feedback information). They have been less successful in general purpose computing as it is debatable whether there is enough inherent instruction level parallelism in general purpose programs that these new features can exploit. en.wikipedia.org /wiki/Explicitly_Parallel_Instruction_Computing   (563 words)

Raj's Homepage "Selective Preemption Strategies for Parallel Job Scheduling", Rajkumar Kettimuthu, Vijay Subramani, Srividya Srinivasan, Thiagaraja B. Gopalsamy, D. Panda and P. Sadayappan, International Journal of High Performance Computing and Networking, Vol. "Distributed Job Scheduling on Computational Grids using Multiple Simultaneous Requests", Vijay Subramani, Rajkumar Kettimuthu, Srividya Srinivasan and P. Sadayappan, Proceedings of 11th IEEE Symposium on High Performance Distributed Computing (HPDC 2002), July 2002 (pdf) "Restricted Slow-Start for TCP", William Allcock, Sanjay Hegde and Rajkumar Kettimuthu, The 2005 IEEE International Conference on Cluster Computing 2005, September 2005. www-unix.mcs.anl.gov /~kettimut/publications.html   (646 words)

Tritanium Overview The system is currently oriented towards EPIC (Explicitly Parallel Instruction Computing) architectures, in particular, the Intel's IA-64 Itanium processor. It supports compiler research in what is typically considered to be "back end" techniques such as instruction scheduling, register allocation, and machine-dependent optimizations. A compiler back-end (ELCOR) parameterized by a machine description, performing instruction scheduling, register allocation, and machine-dependent optimizations. hydrogen.cs.gwu.edu /tritanium/overview.shtml   (433 words)

Platform Computing - Wikipedia, the free encyclopedia Platform Computing is a privately-held software company that is primarily known for its job scheduling product, Load Sharing Facility (LSF). en.wikipedia.org /wiki/Platform_Computing   (81 words)

Reviews.com The algorithm belongs to the family of job shop scheduling algorithms that start with a feasible... The Association for Computing Machinery/Institute of Electrical and Electronics Engineers Curricula... Collecting input from distributed computers that are only sometimes connected to the network is a growing issue. www.reviews.com   (81 words)

Preemption - Xen Wiki Preemption is important to "real time" applications running in Virtual Machines (DomU) as well in the scheduling of multiple VMs (Dom0). In theory, this can impact general performance, scheduler latency, user experience, and real time computing. Kernel Preemption strives towards a CPU that is performing "higest priority processing" at any given time slice and is both art and technique. wiki.xensource.com /xenwiki/Preemption   (244 words)

Scheduling Tasks with Mixed Preemption Relations for Robustness to Timing Faults Scheduling Tasks with Mixed Preemption Relations for Robustness to Timing Faults We show that the preemption threshold logic for mapping tasks to as few threads as possible can rule out the schedules with the highest critical scaling factors --- these schedules are the least likely to miss deadlines under timing faults. Barriers prevent the preemption threshold logic that runs multiple design-time tasks in the same run-time thread from violating architectural constraints, e.g. www.cs.utah.edu /flux/papers/spak-flux-tn-02-01   (299 words)

Business Wire: Portera Signs First Asia-Pacific Reseller Agree... @ HighBeam Research Eclipse Computing Australia, ranked as the 27th fastest growing company in Australia in 2001 by BRW magazine, has been a value-added reseller for Microsoft Great Plains since 1998, gaining recent recognition for outstanding sales achievement and customer satisfaction. Eclipse Computing is a leading business solutions provider delivering financial and business management solutions to local and multinational organisations from a global network of offices. Eclipse wasted no time including Portera's ServicePort suite among its business solution offerings, scheduling demonstrations with their existing clients even before the ink was dry on the agreement. www.highbeam.com /library/doc0.asp?DOCID=1G1:83906174&refid=holomed_1   (946 words)

writeup.html Uriel Feige and Christian Scheideler; "Improved bounds for acyclic job shop scheduling" (extended abstract) ; Proceedings of the thirtieth annual ACM symposium on Theory of computing, 1998, Pages 624 - 633 In general, a cache scheduling policy is a way to decide, in the case that a process requests a page which is not presently in the cache, which cache frame should have its contents replaced. The goal of this project is to find a genetic algorithm that will successfully evolve a useful cache scheduling algorithm. www.cs.wisc.edu /~molla/OS-DIE/writeup.html   (3428 words)

Microsoft Solutions for Management: Job Scheduling This guide provides detailed information about the job scheduling service management function (SMF) for organizations that have deployed, or are considering deploying, Microsoft technologies in a data center or other type of enterprise computing environment. Job scheduling is considered one of the foundational SMFs of the MOF operating quadrant. Job scheduling and security administration have a relationship because some forms of corporate output (reports, for example) that are created via the job scheduling process must remain secure. www.microsoft.com /technet/itsolutions/cits/mo/smf/smfjobsc.mspx   (8951 words)

Task Scheduler - Autotask 2000 Scheduling flexibility is the key to successful automation. AutoTask 2000 is a task scheduler for Windows that is designed to automate all those routine computing tasks. It is designed to replace and extend the use of the task scheduler that comes with Windows with more flexibility for when and how your tasks are performed.. www.cypressnet.com /Products/autotask/autotask.htm   (8951 words)

task scheduling - OneLook Dictionary Search task scheduling : Free On-line Dictionary of Computing [ home, info ] task scheduling : Dictionary.com [ home, info ] Tip: Click on the first link on a line below to go directly to a page where "task scheduling" is defined. www.onelook.com /cgi-bin/cgiwrap/bware/dofind.cgi?word=task+scheduling   (8951 words)

Embedded Papers - Scheduling Fixed-Priority Tasks with Preemption Threshold In this paper, we use the notion of preemption threshold, first introduced by Express Logic, Inc. in their ThreadX real-time operating system, to develop a scheduling model that subsumes both preemptive and non-preemptive fixed priority scheduling. We develop the equations for computing the worst-case response times, using the concept of level-i busy period. Preemption threshold allows a task to only disable preemption of tasks up to a specified threshold priority. www.embeddedstar.com /technicalpapers/content/s/embedded650.html   (228 words)

Community spotlight BlueCat is a standard Linux distribution with the open software scheduling algorithms which include some preemption points for priority management. Early QNX OS technology focused on x86 platforms (QNX produced the first OS to support a hard disk, to offer protected-mode computing, and the first RTOS to run on a 386). Another aspect of RTOS is that the computation it provides cannot only be "correct" (as in traditional operating systems), but that it has to be correct within a certain time constraint. www-128.ibm.com /developerworks/power/library/pa-nl14-partnerspot.html   (1616 words)

ATN Scientific Computing - Accessing SciComp LSF is a very powerful scheduler which distributes computing load efficiently among all computational servers. After the job is submitted, you can look at the scheduling status of all jobs including yours running on Chastity and other ATN computational servers. Of course, if Zephyr is at full load (60 job slots are already being used), any jobs you submit will also pend even though you have not reached your user job slot limit. www.unc.edu /atn/scientific/access_servers/chastity_intro_lsf.html   (924 words)

Amazon.com: Grid Computing - GRID 2000 : First IEEE/ACM International Workshop Bangalore, India, December 17, 2000 Proceedings (Lecture Notes in Computer Science): Books: Rajkumar Buyya,Mark Baker The papers are grouped in topical sections on grid resource management, grid middleware and problem solving environments, grid test beds and resource recovery, and application-level scheduling on the grid. Solve complex computing tasks with HPC computing solutions from Intel. Proceedings of the First IEEE/ACM International Workshop on Grid Computing, held in Bangalore, India, December 17, 2000. www.amazon.com /exec/obidos/tg/detail/-/3540414037?v=glance   (493 words)

Running Condor Jobs on UTCS Computing Clusters UTCS operates two general-purpose High Throughput Computing (HTC) clusters, Mastodon and Scout, which are managed using the Condor job scheduling software. Condor is a software system that creates a High-Throughput Computing (HTC) environment. Optional: Compile and link the program with Condor's libraries to enable the job to be migrated among the machines using condor_compile. www.cs.utexas.edu /users/hyukcho/condorAtUTCS.html   (3075 words)

Mercury - Distributed Multimedia Computing Laboratory, UT Austin We articulated the inadequacies of packet scheduling disciplines proposed in the literature and formulated the requirements for one suited for integrated services networks. In fact, a specific instance of the FA algorithm leads to the first fair scheduling discipline that achieves separation of rate and delay guarantees. We developed a hierarchical link-sharing discipline based on the SFQ and FA scheduling algorithms and formally analyzed its properties. www.cs.utexas.edu /users/dmcl/projects/mercury/results1.html   (230 words)

Job Scheduling Software One topic the Operations Guide series covers is job scheduling (you can access the Job Scheduling Operations Guide at http://www.microsoft.com/technet/prodtechnol/windows2000serv/maintain/opsguide/jobschog.asp.) Mainframe-based IT shops have long used job-scheduling packages to reduce total operating cost, to more reliably carry out routine and predictable application maintenance and reporting tasks, and to make better use of available computing resources. Some job scheduling systems can detect specific error conditions that cause a scheduled job to abend and automatically execute a job to recover from the error. Other job scheduling systems can track changes to production job definitions and implement procedural controls to ensure that someone tests and approves changes to production jobs before they run. www.windowsitpro.com /Articles/Index.cfm?ArticleID=22552   (756 words)

Publications By Year Journal for Approximate Reasoning (Special Scheduling Issue); a version is also available as UMass Computer Science Technical Report 1997-59, Volume 19, Elsevier Science Inc., pp. Proceedings of the 14th International Conference on Automated Planning and Scheduling, (ICAPS 2004), Workshop on Planning and Scheduling for Web and Grid Services. The Role of an Agent Organization in a Grid Computing Environment. dis.cs.umass.edu /pub/yearall.html   (756 words)

A Static Task Scheduling Heuristic for Homogeneous Computing Environments Index Terms- list scheduling, compile time scheduling, task graph scheduling, homogeneous computing A Static Task Scheduling Heuristic for Homogeneous Computing Environments List-based scheduling is generally accepted as an attractive approach to static task scheduling in a homogeneous environment, since it pairs low complexity with good results. csdl.computer.org /comp/proceedings/pdp/2004/2083/00/20830192abs.htm   (756 words)

Adaptive Scheduling for Task Farming with Grid Middleware Scheduling in metacomputing environments is an active field of research as the vision of a Computational Grid becomes more concrete. The International Journal of High Performance Computing, Volume 13, Number 3, Fall, 1999. An important class of Grid applications are long-running parallel computations with large numbers of somewhat independent tasks (Monte Carlo simulations, parameter-space searches, etc.). www.cs.utk.edu /~plank/papers/HPCA-99.html   (315 words)

Try your search on: Qwika (all wikis)

About us   |   Why use us?   |   Reviews   |   Press   |   Contact us   Copyright © 2005-2007 www.factbites.com Usage implies agreement with terms.